328 citations · 382 across the 9 of their papers we have counts for
8 papers · 1 filter
Static Analysis of Run-Time Errors in Embedded Real-Time Parallel C Programs
Antoine Miné
We present a static analysis by Abstract Interpretation to check for run-time errors in parallel and multi-threaded C programs. Following our work on Astrée, we focus on embedded c…
The Octagon Abstract Domain
Antoine Miné
This article presents a new numerical abstract domain for static analysis by abstract interpretation. It extends a former numerical abstract domain based on Difference-Bound Matric…
Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors
Antoine Miné
We present a new idea to adapt relational abstract domains to the analysis of IEEE 754-compliant floating-point numbers in order to statically detect, through abstract Interpretati…
Symbolic Methods to Enhance the Precision of Numerical Abstract Domains
Antoine Miné
We present lightweight and generic symbolic methods to improve the precison of numerical static analyses based on Abstract Interpretation. The main idea is to simplify numerical ex…
A Few Graph-Based Relational Numerical Abstract Domains
Antoine Miné
This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the fo…
Field-Sensitive Value Analysis of Embedded C Programs with Union Types and Pointer Arithmetics
Antoine Miné
We propose a memory abstraction able to lift existing numerical static analyses to C programs containing union types, pointer casts, and arbitrary pointer arithmetics. Our framewor…
A New Numerical Abstract Domain Based on Difference-Bound Matrices
Antoine Miné
This paper presents a new numerical abstract domain for static analysis by abstract interpretation. This domain allows us to represent invariants of the form (x-y<=c) and (+/-x<=c)…
A Static Analyzer for Large Safety-Critical Software
Bruno Blanchet, Patrick Cousot, Radhia Cousot +5
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…