Sciweavers

Share
ENTCS
2007
98views more  ENTCS 2007»
8 years 11 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
ENGL
2007
94views more  ENGL 2007»
8 years 11 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
CSL
1999
Springer
9 years 3 months ago
Anti-Symmetry of Higher-Order Subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Adriana B. Compagnoni, Healfdene Goguen
ASIACRYPT
2000
Springer
9 years 3 months ago
Proofs of Security for the Unix Password Hashing Algorithm
We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost...
David Wagner, Ian Goldberg
books