Inferring sufficient conditions with backward polyhedral under-approximations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Inferring sufficient conditions with backward polyhedral under-approximations

Abstract

In this article, we discuss the automatic inference of sufficient pre-conditions by abstract interpretation and sketch the construction of an under-approximating backward analysis. We focus on numeric domains and propose transfer functions, including a lower widening, for polyhedra, without resorting to disjunctive completion nor complementation, while soundly handling non-determinism. Applications include the derivation of sufficient conditions for a program to never step outside an envelope of safe states, or dually to force it to eventually fail. Our construction is preliminary and essentially untried, but we hope to convince that this avenue of research is worth considering.
Fichier principal
Vignette du fichier
article-mine-nsad12.pdf (393 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00748095 , version 1 (04-11-2012)

Identifiers

  • HAL Id : hal-00748095 , version 1

Cite

Antoine Miné. Inferring sufficient conditions with backward polyhedral under-approximations. NSAD'12 - 4th International Workshop on Numerical and Symbolic Abstract Domains, Sep 2012, Deauville, France. pp.12. ⟨hal-00748095⟩
157 View
92 Download

Share

Gmail Facebook X LinkedIn More