Title: Optimal abstraction on real-valued programs
In this paper, we show that it is possible to abstract program fragments
using real variables using formulas in the theory of real closed fields.
This abstraction is compositional and modular. We first propose an exact
abstraction for programs without loops. Given an abstract domain (in a
wide class including intervals and octagons), we then show how to obtain
an optimal abstraction of program fragments with respect to that domain.
This abstraction allows computing optimal fixed points inside that
abstract domain, without the need for a widening operator.
Computer Science Department
University of California, Santa Cruz