We show that abstract interpretation-based static program analysis can be made efficient
and precise enough to formally verify a class of properties for a family of large programs with …

Almost every programmer has faced the problem of representing a tree together with a
subtree that is the focus of attention, where that focus may move left, right, up or down the …

We report on a successful preliminary experience in the design and implementation of a
special-purpose Abstract Interpretation based static program analyzer for the verification of …

We describe the structure of the abstract domains in the Astrée static analyzer, their modular
organization into a hierarchical network, their cooperation to over-approximate the …

Astrée was the first static analyzer able to prove automatically the total absence of runtime
errors of actual industrial programs of hundreds of thousand lines. What makes Astrée such …

We propose a type system MLF that generalizes ML with first-class polymorphism as in
System F. Expressions may contain secondorder type annotations. Every typable expression …

Rule-based approaches (as in our own Kappa, or the BNG language, or many other
propositions allowing the consideration of" reaction classes'') offer new and more powerful …

Asynchronous exceptions, such as timeouts are important for robust, modular programs, but
are extremely difficult to program with—so much so that most programming languages either …

We present the Zen toolkit for morphological and phonological processing of natural
languages. This toolkit is presented in literate programming style, in the Pidgin ML subset of …

A gentle introduction to formal verification of computer systems by abstract interpretation Page 1
A gentle introduction to formal verification of computer systems by abstract interpretation Patrick …