论文信息 - Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries

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

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.

Nirav Dave | Richard Uhler

[1] Viktor Kuncak,et al. Scala to the Power of Z3: Integrating SMT and Programming , 2011, CADE.

[2] Daan Leijen,et al. Domain specific embedded compilers , 1999, DSL '99.

[3] Simon Peyton Jones,et al. The Glasgow Haskell Compiler , 2012 .

[4] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[5] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.

[6] Michael D. Ernst,et al. HAMPI: a solver for string constraints , 2009, ISSTA.

[7] David L. Dill,et al. A Decision Procedure for Bit-Vectors and Arrays , 2007, CAV.

[8] L. D. Moura,et al. The YICES SMT Solver , 2006 .

[9] Peyton Jones,et al. Haskell 98 language and libraries : the revised report , 2003 .

[10] Nikolaj Bjørner,et al. Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings , 2011, CADE.