research
∙
11/17/2022
Completeness in static analysis by abstract interpretation, a personal point of view
Static analysis by abstract interpretation is generally designed to be ”...
share
research
∙
11/02/2022
BAXMC: a CEGAR approach to Max#SAT
Max#SAT is an important problem with multiple applications in security a...
research
∙
07/18/2022
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic
Some recent processors are not equipped with an integer division unit. C...
research
∙
02/24/2022
NP^#P = ∃PP and other remarks about maximized counting
We consider the following decision problem DMAX#SAT, and generalizations...
research
∙
01/31/2022
The complexity gap in the static analysis of cache accesses grows if procedure calls are added
The static analysis of cache accesses consists in correctly predicting w...
research
∙
01/25/2022
The Trusted Computing Base of the CompCert Verified Compiler
CompCert is the first realistic formally verified compiler: it provides ...
research
∙
05/04/2021
Simple, Light, Yet Formally Verified, Global Common Subexpression Elimination and Loop-Invariant Code Motion
We present an approach for implementing a formally certified loop-invari...
research
∙
09/29/2020
A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations
Parametric linear programming is a central operation for polyhedral comp...
research
∙
11/18/2019
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
Polyhedral projection is a main operation of the polyhedron abstract dom...
research
∙
04/12/2019
Parallel parametric linear programming solving, and application to polyhedral computations
Parametric linear programming is central in polyhedral computations and ...
research
∙
11/05/2018
On the complexity of cache analysis for different replacement policies
Modern processors use cache memory: a memory access that "hits" the cach...
research
∙
11/05/2018
Fast and exact analysis for LRU caches
For applications in worst-case execution time analysis and in security, ...
research
∙
09/28/2017
Ascertaining Uncertainty for Efficient Exact Cache Analysis
Static cache analysis characterizes a program's cache behavior by determ...
research
∙
09/13/2017
On the decidability of the existence of polyhedral invariants in transition systems
Automated program verification often proceeds by exhibiting inductive in...
research
∙
07/05/2017