Contract-based design is a method to facilitate modular system design. While there has
been substantial progress on the theory of contracts, there has been less progress on …

The Verified Polyhedra Library operates upon a constraint-only representation of convex
polyhedra and provides all common operations (image, pre-image, projection, convex hull …

Numerical abstract domains such as Polyhedra, Octahedron, Octagon, Interval, and others
are an essential component of static program analysis. The choice of domain offers a …

We show how to leverage reinforcement learning (RL) in order to speed up static program
analysis. The key insight is to establish a correspondence between concepts in RL and …

In this paper, we propose an efficient method for removing all redundant inequalities
generated by Fourier-Motzkin Elimination. This method is based on an improved version of …

Formally verified compilers and formally verified static analyzers are a solution to the
problem that certain industries face when they have to demonstrate to authorities that the …

Convex polyhedra capture linear relations between variables. They are used in static
analysis and optimizing compilation. Their high expressiveness is however barely used in …

Contract-based design is a method to facilitate modular design of systems. While there has
been substantial progress on the theory of contracts, there has been less progress on …

This document presents a lightweight approach–combining Coq and OCaml typecheckers–
in order to formally verify higher-order imperative programs for partial correctness. In this …

Polyhedral projection is a main operation of the polyhedron abstract domain. It can be
computed via parametric linear programming (PLP), which is more efficient than the classic …