220 search results - page 21 / 44 » Coq Modulo Theory |
77
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
118
click to vote
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract. Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specith abstract structures by quantification o...
90
Voted
ITP
2010
15 years 4 months ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
113
click to vote
AMAI
2007
Springer
15 years 25 days ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
146
Voted
FROCOS
2011
Springer
14 years 12 days ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...