10 search results - page 1 / 2 » Automated Proof Compression by Invention of New Definitions |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
FASE
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
CSFW
2008
IEEE
13 years 9 months ago
2008
IEEE
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...