632 search results - page 74 / 127 » Combining programming with theorem proving |
223
Voted
CADE
2011
Springer
14 years 1 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
132
click to vote
TPHOL
2005
IEEE
15 years 7 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
120
Voted
CAV
2001
Springer
15 years 6 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
111
Voted
SIAMDM
2010
14 years 8 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
112
click to vote
LISP
2002
15 years 1 months ago
2002
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...