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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Uhler, R., & Dave, N. (2013). Smten: Automatic translation of high-level symbolic computations into SMT queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8044 LNCS, pp. 678–683). https://doi.org/10.1007/978-3-642-39799-8_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
