1302 search results - page 103 / 261 » Free-Style Theorem Proving |
251
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
112
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
127
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
We carefully investigate humanity’s intuitive understanding of trust and extract from it fundamental properties that succinctly synthesize how trust works. From this detailed ch...
184
click to vote
TPHOL
2006
IEEE
15 years 10 months ago
2006
IEEE
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irr...
121
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...