54 search results - page 6 / 11 » A New Interactive Hashing Theorem |
113
click to vote
JACM
2002
14 years 11 months ago
2002
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: ...
104
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
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...
ENTCS
2006
14 years 11 months ago
2006
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...
103
click to vote
COMPGEOM
1998
ACM
15 years 3 months ago
1998
ACM
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...
IFM
2004
Springer
15 years 5 months ago
2004
Springer
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...