The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Probabilistic self-stabilization
Information Processing Letters
A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Introduction to Algorithms
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Deletion in binary storage trees.
Deletion in binary storage trees.
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
CONCUR 2005 - Concurrency Theory
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Model checking the probabilistic pi-calculus
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear-invariant generation for probabilistic programs: automated support for proof-based methods
SAS'10 Proceedings of the 17th international conference on Static analysis
A compositional method for deciding equivalence and termination of nondeterministic programs
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Best probabilistic transformers
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
APEX: an analyzer for open probabilistic programs
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 0.00 |
We introduce a simple procedural probabilistic programming language which is suitable for coding a wide variety of randomised algorithms and protocols. This language is interpreted over finite datatypes and has a decidable equivalence problem. We have implemented an automated equivalence checker, which we call apex, for this language, based on game semantics.We illustrate our approach with three non-trivial case studies: (i) Herman's self-stabilisation algorithm; (ii) an analysis of the average shape of binary search trees obtained by certain sequences of random insertions and deletions; and (iii) the problem of anonymity in the Dining Cryptographers protocol. In particular, we record an exponential speed-up in the latter over state-of-the-art competing approaches.