Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries

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.

DOI: 10.1007/978-3-642-39799-8_45
View Slides

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Uhler2013SmtenAT, title={Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries}, author={Richard Uhler and Nirav Dave}, booktitle={CAV}, year={2013} }