1302 search results - page 142 / 261 » Free-Style Theorem Proving |
150
click to vote
JCT
2010
15 years 2 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
243
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
114
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
237
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
141
Voted
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...