1302 search results - page 35 / 261 » Free-Style Theorem Proving |
110
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
137
click to vote
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...
181
click to vote
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
145
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
131
click to vote
FASE
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...