ENTCS
2007
13 years 10 months ago
2007
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 ...
ENGL
2007
13 years 10 months ago
2007
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...
CSL
1999
Springer
14 years 3 months ago
1999
Springer
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...
ASIACRYPT
2000
Springer
14 years 3 months ago
2000
Springer
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...