PLDI
2012
ACM
11 years 7 months ago
2012
ACM
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
PLDI
2003
ACM
13 years 9 months ago
2003
ACM
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
APLAS
2005
ACM
13 years 10 months ago
2005
ACM
Dependences for Alarm Diagnosis Xavier Rival ´Ecole Normale Sup´erieure 45, rue d’Ulm, 75230, Paris cedex 5, France We propose a framework for dependence analyses, adapted –a...
RTA
2007
Springer
13 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
KBSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...