Automatic modular abstractions for template numerical constraints release_ekfxoelwwfgqlfljvclta3hb4i

by David Monniaux

Released as a article .

2010  

Abstract

We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions. Our algorithms are based on new quantifier elimination and symbolic manipulation techniques. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. The motivation of our work is data-flow synchronous programming languages, used for building control-command embedded systems, but it also applies to imperative and functional programming.
In text/plain format

Archived Files and Locations

application/pdf  592.8 kB
file_fjo3vcpkzfeozdcodivkskbcom
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-05-31
Version   v2
Language   en ?
arXiv  0909.4013v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 27797247-d7e8-460a-93f1-fcb739c315be
API URL: JSON