Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Approximations for Model Construction

Aleksandar Zeljic, Christoph M. Wintersteiger, and Philipp Rummer

Abstract

We consider the problem of efficiently computing models for satisfiable constraints, in the presence of complex background theories such as oating-point arithmetic. Model construction has various applications, for instance the automatic generation of test inputs. It is well-known that naive encoding of constraints into simpler theories (for instance, bit-vectors or propositional logic) can lead to a drastic increase in size, and be unsatisfactory in terms of memory and runtime needed for model construction. We define a framework for systematic application of approximations in order to speed up model construction. Our method is more general than previous techniques in the sense that approximations that are neither under- nor over-approximations can be used, and shows promising results in practice.

Details

Publication typeInproceedings
Published inProceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR 2014)
URLhttp://link.springer.com/chapter/10.1007/978-3-319-08587-6_26
DOI10.1007/978-3-319-08587-6_26
PublisherSpringer
> Publications > Approximations for Model Construction