Sciweavers

25 search results - page 2 / 5
» A Completeness Proof for Bisimulation in the pi-calculus Usi...
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 5 months ago
A TLA+ Proof System
We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The ...
Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport,...
JAR
2007
104views more  JAR 2007»
13 years 4 months ago
Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book
The Intelligent Book project aims to improve online education by designing materials that can model the subject matter they teach, in the manner of a Reactive Learning Environment...
William Billingsley, Peter Robinson
TPHOL
2009
IEEE
13 years 11 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
LICS
1999
IEEE
13 years 9 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 8 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang