Patrick Cousot
YOU?
Author Swipe
Calculational Design of Hyperlogics by Abstract Interpretation Open
We design various logics for proving hyper properties of iterative programs by application of abstract interpretation principles. In part I, we design a generic, structural, fixpoint abstract interpreter parameterized by an algebraic abstr…
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation Open
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a n…
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation Open
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a n…
Asynchronous Correspondences Between Hybrid Trajectory Semantics Open
We formalize the semantics of hybrid systems as sets of hybrid trajectories, including those generated by an hybrid transition system. We study the abstraction of hybrid trajectory semantics for verification, static analysis, and refinemen…
The Systematic Design of Responsibility Analysis by Abstract Interpretation Open
Given a behavior of interest, automatically determining the corresponding responsible entity (i.e., the root cause) is a task of critical importance in program static analysis. In this article, a novel definition of responsibility based on…
Responsibility Analysis by Abstract Interpretation Open
Given a behavior of interest in the program, statically determining the corresponding responsible entity is a task of critical importance, especially in program security. Classical static analysis techniques (e.g. dependency analysis, tain…
Program Analysis is Harder than Verification: A Computability Perspective Open
We study from a computability perspective static program analysis, namely detecting sound program assertions, and verification, namely sound checking of program assertions. We first provide a general computability model for domains of prog…
View article: Finding All Potential Run-Time Errors and Data Races in Automotive Software
Finding All Potential Run-Time Errors and Data Races in Automotive Software Open
Safety-critical embedded software has to satisfy stringent quality requirements. All contemporary safety standards require evidence that no data races and no critical run-time errors occur, such as invalid pointer accesses, buffer overflow…
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471) Open
This report documents the program and the outcomes of Dagstuhl Seminar 16471 "Concurrency with Weak Memory Models: Semantics, Languages, Compilation, Verification, Static Analysis, and Synthesis". The aim of the seminar was to bring togeth…
Syntax and semantics of the weak consistency model specification language cat Open
We provide the syntax and semantics of the cat language, a domain specific language to describe consistency properties of parallel/distributed programs. The language is implemented in the herd7 too (http://diy.inria.fr/doc/herd.html)l.
Syntax and analytic semantics of LISA Open
We provide the syntax and semantics of the LISA (for "Litmus Instruction Set Architecture") language. The parallel assembly language LISA is implemented in the herd7 tool (http://virginia.cs.ucl.ac.uk/herd/) for simulating weak consistency…
View article: Taking Static Analysis to the Next Level: Proving the Absence of Run-Time Errors and Data Races with Astrée
Taking Static Analysis to the Next Level: Proving the Absence of Run-Time Errors and Data Races with Astrée Open
International audience