activity
20102021
most citedSuccinct Representations for Abstract Interpretation

10 citations · 19 across the 5 of their papers we have counts for

collaborators

5 papers

cs.PL2021★ 2 cited

An Optimised Flow for Futures: From Theory to Practice

Nicolas Chappe, Ludovic Henrio, Amaury Maillé +2

A future is an entity representing the result of an ongoing computation. A synchronisation with a "get" operation blocks the caller until the computation is over, to return the cor…

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…

cs.PF2010★ 7 cited

Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

Karine Altisen, Yanhong Liu, Matthieu Moy

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order…

cs.PF2010

Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

Karine Altisen, Yanhong Liu, Matthieu Moy

To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order…