Sciweavers

54 search results - page 6 / 11
» A New Interactive Hashing Theorem
Sort
View
JACM
2002
163views more  JACM 2002»
13 years 6 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
ENTCS
2006
127views more  ENTCS 2006»
13 years 7 months ago
Process Algebraic Non-product-forms
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interactin...
Peter G. Harrison
COMPGEOM
1998
ACM
13 years 11 months ago
Matching 2D Patterns of Protein Spots
A new algorithmic approach to comparing 2D patterns of protein spots obtained by the 2D gel electrophoresis technique is presented. Both the matching of a local pattern vs. a full...
Frank Hoffmann, Klaus Kriegel, Carola Wenk
IFM
2004
Springer
14 years 12 days ago
Verifying Controlled Components
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
Steve Schneider, Helen Treharne