Ítem
|
Bofill Arasa, Miquel
Palahí i Sitges, Miquel Suy Franch, Josep Villaret i Ausellé, Mateu |
|
| 2009 | |
| In this paper we introduce Simply, a compiler from a declarative language for CSP modeling to the standard SMT-LIB format. The current version of Simply is able to generate problem instances falling into the quanti er free linear integer arithmetic logic. The compiler has been developed with the aim of building a system for easy CSP modeling and solving. By taking advantage of the year-over-year increase in performance of SMT solvers, we hope that such a system can serve as an alternative to other decision procedures in many applications. The compiler can also be used for easy SMT benchmark generation | |
| application/pdf | |
| http://hdl.handle.net/10256/8406 | |
| eng | |
| Alan M. Frisch and Jimmy Lee | |
|
Reproducció digital del document publicat a: http://www-users.cs.york.ac.uk/~frisch/ModRef/09/proceedings.pdf Articles publicats (D-IMA) |
|
| © Constraint Modelling and Reformulation, 8th International Workshop : Lisbon, Portugal, September, 2009, p.30-45 | |
| Tots els drets reservats | |
|
Algorismes computacionals
Computer algorithms Lògica matemàtica Logic, Symbolic and mathematical |
|
| SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format | |
| info:eu-repo/semantics/article | |
| DUGiDocs |
