The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Randomized algorithms
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Game-theoretic analysis of call-by-value computation
Theoretical Computer Science
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Introduction to algorithms
ACM Transactions on Computational Logic (TOCL)
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Toolbox for Functional and Quantitative Analysis of DEDS
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
ProbVerus: Probabilistic Symbolic Model Checking
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Deletion in binary storage trees.
Deletion in binary storage trees.
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
Functions with local state: regularity and undecidability
Theoretical Computer Science
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
CONCUR 2005 - Concurrency Theory
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
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
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
On automated verification of probabilistic programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fragment of ML decidable by visibly pushdown automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Ymer: a statistical model checker
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.00 |
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin's probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the behaviour of probabilistic programs and protocols. We illustrate our approach on a number of case studies.