SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format
dc.contributor.author
dc.date.accessioned
2013-10-03T11:08:51Z
dc.date.available
2013-10-03T11:08:51Z
dc.date.issued
2009
dc.identifier.uri
dc.description.abstract
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
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Alan M. Frisch and Jimmy Lee
dc.relation.isformatof
Reproducció digital del document publicat a: http://www-users.cs.york.ac.uk/~frisch/ModRef/09/proceedings.pdf
dc.relation.ispartof
© Constraint Modelling and Reformulation, 8th International Workshop : Lisbon, Portugal, September, 2009, p.30-45
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.subject
dc.title
SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB Format
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.embargo.terms
Cap
dc.type.version
info:eu-repo/semantics/publishedVersion
dc.identifier.idgrec
012844