Smten: automatic translation of high-level symbolic computations into SMT queries

Authors:
Richard Uhler;Nirav Dave
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science Laboratory, SRI International, Menlo Park, CA
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 5
Cited 0

Domain specific embedded compilers

Proceedings of the 2nd conference on Domain-specific languages
HAMPI: a solver for string constraints

Proceedings of the eighteenth international symposium on Software testing and analysis
A decision procedure for bit-vectors and arrays

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Scala to the power of Z3: integrating SMT and programming

CADE'11 Proceedings of the 23rd international conference on Automated deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Development of computer aided verification tools has greatly benefited from SMT technologies; instead of writing an ad-hoc reasoning engine, designers translate their problem into SMT queries which solvers can efficiently solve. Translating a problem into effective SMT queries, however, is itself a tedious, error-prone, and non-trivial task. This paper introduces Smten, a tool for automatically translating high-level symbolic computations into SMT queries. We demonstrate the use of Smten in the development of an SMT-based string constraint solver.