3552 search results - page 129 / 711 » Proof theory in the abstract |
172
click to vote
BSL
2002
15 years 6 months ago
2002
Abstract. In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910
177
click to vote
PKC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
139
click to vote
ICSE
2000
IEEE-ACM
15 years 10 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
178
click to vote
FMCAD
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
165
click to vote
ICTAC
2004
Springer
15 years 11 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...