Approximations for Model Construction

  • Aleksandar Zeljić
  • Christoph M. Wintersteiger
  • Philipp Rümmer
Conference paper

DOI: 10.1007/978-3-319-08587-6_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)
Cite this paper as:
Zeljić A., Wintersteiger C.M., Rümmer P. (2014) Approximations for Model Construction. In: Demri S., Kapur D., Weidenbach C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science, vol 8562. Springer, Cham

Abstract

We consider the problem of efficiently computing models for satisfiable constraints, in the presence of complex background theories such as floating-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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Aleksandar Zeljić
    • 1
  • Christoph M. Wintersteiger
    • 2
  • Philipp Rümmer
    • 1
  1. 1.Uppsala UniversitySweden
  2. 2.Microsoft ResearchUK

Personalised recommendations