10 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.PL2014
How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics
Julien Henry, Mihail Asavoae, David Monniaux +1
In systems with hard real-time constraints, it is necessary to compute upper bounds on the worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the…
cs.PL2012
PAGAI: a path sensitive static analyzer
Julien Henry, David Monniaux, Matthieu Moy
We describe the design and the implementation of PAGAI, a new static analyzer working over the LLVM compiler infrastructure, which computes inductive invariants on the numerical va…
cs.PL2012★ 10 cited
Succinct Representations for Abstract Interpretation
Julien Henry, David Monniaux, Matthieu Moy
Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and spar…