10 search results - page 2 / 2 » Automated Proof Compression by Invention of New Definitions |
CSL
2002
Springer
13 years 7 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. Intel is applying formal verification to various pieces of mathematical software used in Merced, the first implementation of the new IA-64 architecture. This paper discus...
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
ICWS
2003
IEEE
13 years 8 months ago
2003
IEEE
Semantic Web technology has a vision to define and link Web data in a way that it can be understood and used by machines for automation, integration and reuse of data across variou...