1410 search results - page 26 / 282 » Proving theorems by reuse |
168
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
143
click to vote
VSTTE
2010
Springer
15 years 4 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
167
click to vote
TABLEAUX
2005
Springer
15 years 11 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...
156
click to vote
FASE
2010
Springer
16 years 20 days 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...
155
click to vote
IPPS
2008
IEEE
16 years 17 days ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...