Publications associées à Definite assignment analysis

Just-in-time performance without warm-up

Scala has been developed as a language that deeply integrates with the Java ecosystem. It offers seamless interoperability with existing Java libraries. Since the Scala compiler targets Java bytecode, Scala programs have access to high-performance runtimes ...

EPFL2020

Towards Predicting Success in MOOCs: Programming Assignments

Pierre Dillenbourg, Patrick Jermann, Kshitij Sharma, Lukasz Kidzinski

Students of programming languages in massive on-line open courses (MOOCs) solve programming assignments in order to internalize the concepts. Programming assignments also constitute the assessment procedure for such courses. Depending on their motivation a ...

Books on Demand GmbH, Norderstedt2016

Fully automatic assignment of small molecules' NMR spectra without relying on chemical shift predictions

Luc Patiny, Julien Wist

We present a method for the automatic assignment of small molecules' NMR spectra. The method includes an automatic and novel self-consistent peak-picking routine that validates NMR peaks in each spectrum against peaks in the same or other spectra that are ...

Wiley-Blackwell2015

Capturing CO2 in Monoethanolamine (MEA) Aqueous Solutions: Fingerprints of Carbamate Formation Assessed with First-Principles Simulations

Wanda Andreoni, Fabio Pietrucci, Changru Ma

Chemical absorption in amine aqueous solutions is a widespread technology for postcombustion carbon capture, and a large effort is ongoing to improve their performance. Characterization of the "reactant" and "product" solutions at the microscopic level is ...

Amer Chemical Soc2014

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

An optimal linear-time algorithm for interprocedural register allocation in high level synthesis is presented. Historically, register allocation has been modeled as a graph coloring problem, which is nondeterministic polynomial time-complete in general; ho ...

2010

Optimistic chordal coloring: a coalescing heuristic for SSA form programs

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

The interference graph for a procedure in Static Single Assignment (SSA) Form is chordal. Since the k-colorability problem can be solved in polynomial-time for chordal graphs, this result has generated interest in SSA-based heuristics for spilling and coal ...

Springer US2009