220 search results - page 17 / 44 » Coq Modulo Theory |
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
107
click to vote
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We describe a technique and a tool called Qex for generating input tables and parameter values for a given parameterized SQL query. The evaluation semantics of an SQL query is tra...
103
click to vote
CADE
2012
Springer
13 years 1 days ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
167
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...