1894 search results - page 112 / 379 » A TLA Proof System |
95
Voted
TCC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...
126
click to vote
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
213
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
93
Voted
FMCAD
2007
Springer
15 years 7 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
121
Voted
LFCS
2007
Springer
15 years 7 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...