Abstract interpretation is a theory of abstraction and constructive approximation of the
mathematical structures used in the formal description of complex or infinite systems and the …

Abstract interpretation is a sound-by-construction method for program verification: any
erroneous program will raise some alarm. However, the verification of correct programs may …

It is well known that simulation equivalence is an appropriate abstraction to be used in
model checking because it strongly preserves ACTL* and provides a better space reduction …

A number of algorithms for computing the simulation preorder and equivalence are
available. Let Σ denote the state space,→ the transition relation and Psim the partition of Σ …

The Paige and Tarjan algorithm (PT) for computing the coarsest refinement of a state
partition which is a bisimulation on some Kripke structure is well known. It is also well known …

Abstract interpretation is a method to automatically find invariants of programs or pieces of
code whose semantics is given via least fixed-points. Up-to techniques have been …

Abstract Semantics-preserving program transformations, such as those carried out by an
optimizing compiler, can affect the results of static program analyses. In the best cases, a …

While soundness captures an essential requirement of the intrinsic approximation of any
static analysis, completeness encodes approximations that are as precise as possible …

Completeness is a key feature of abstract interpretation. It corresponds to exactness of the
abstraction of fix-points and relies upon the need of absence of false alarms in static …

We consider the refinement of a static analysis method called thread-modular verification. It
was an open question whether such a refinement can be done automatically. We present a …