Sciweavers

837 search results - page 38 / 168
» Proof Development with OMEGA
Sort
View
RTA
2010
Springer
15 years 4 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
100
Voted
CONCUR
1995
Springer
15 years 4 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
114
Voted
CCS
2008
ACM
15 years 2 months ago
Type-checking zero-knowledge
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...
Michael Backes, Catalin Hritcu, Matteo Maffei
87
Voted
VSTTE
2010
Springer
14 years 10 months ago
Reusable Verification of a Copying Collector
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 ...
Magnus O. Myreen
103
Voted
TPHOL
2002
IEEE
15 years 5 months ago
The 5 Colour Theorem in Isabelle/Isar
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
Gertrud Bauer, Tobias Nipkow