211 citations
- Université Grenoble AlpesFR49 papers
- Centre National de la Recherche ScientifiqueFR44 papers
- Institut polytechnique de GrenobleFR12 papers
- Université Joseph FourierFR7 papers
- FortissDE4 papers
- Institut des langues et cultures d'Europe, Amérique, Afrique, Asie et AustralieFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Aalto UniversityFI3 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
- Laboratoire d'Informatique de GrenobleFR3 papers
- LIP6FR3 papers
6 papers · 1 filter
Distributed Priority Synthesis
Chih-Hong Cheng, Rongjie Yan, Saddek Bensalem +1
Given a set of interacting components with non-deterministic variable update and given safety requirements, the goal of priority synthesis is to restrict, by means of priorities, t…
Underapproximation of Procedure Summaries for Integer Programs
Pierre Ganty, Radu Iosif, Filip Konecny
We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approac…
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
Thomas Martin Gawlitza, David Monniaux
We consider the problem of computing numerical invariants of programs, for instance bounds on the values of numerical program variables. More specifically, we study the problem of…
Analysis of parametric biological models with non-linear dynamics
Romain Testylier, Thao Dang
In this paper we present recent results on parametric analysis of biological models. The underlying method is based on the algorithms for computing trajectory sets of hybrid system…
PAGAI: a path sensitive static analyzer
Julien Henry, David Monniaux, Matthieu Moy
We describe the design and the implementation of PAGAI, a new static analyzer working over the LLVM compiler infrastructure, which computes inductive invariants on the numerical va…
Succinct Representations for Abstract Interpretation
Julien Henry, David Monniaux, Matthieu Moy
Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and spar…