Automatic modular abstractions for template numerical constraints

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Automatic modular abstractions for template numerical constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automatic modular abstractions for template numerical constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic modular abstractions for template numerical constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-301178

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.