Filters








14,077 Hits in 4.1 sec

Towards Automated Proof Support for Probabilistic Distributed Systems [chapter]

Annabelle K. McIver, Tjark Weber
2005 Lecture Notes in Computer Science  
In this paper we propose a framework for verification of probabilistic distributed systems based on the generalisation of Kleene algebra with tests that has been used as a basis for development of concurrency  ...  The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience indicates [12, 4, 11] that there  ...  Conclusions and comparisons with other approaches This work represents the first step towards automated reasoning tools for probabilistic distributions systems.  ... 
doi:10.1007/11591191_37 fatcat:ehhm7ahxnzh6rl2pt56jdnfpaa

The Probabilistic Termination Tool Amber [article]

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács
2021 arXiv   pre-print
We describe the Amber tool for proving and refuting the termination of a class of probabilistic while-programs with polynomial arithmetic, in a fully automated manner.  ...  Amber supports programs parameterized by symbolic constants and drawing from common probability distributions.  ...  Our recent work introduces relaxations of existing proof rules for probabilistic (non-)termination together with automation techniques based on asymptotic bounding functions [19] .  ... 
arXiv:2107.13072v1 fatcat:glpim3x7infmjf4k6kte4wprli

Foreword

Joost-Pieter Katoen
2002 Theoretical Computer Science  
Quantitative Program Logic and Expected Time Bounds in Probabilistic Distributed Algorithms" describes a proof technique for probabilistic distributed algorithms based on Dijkstra/Hoarelogic and wp-style  ...  These developments are essential to provide a solid basis for reasoning about the performance and dependability characteristics of systems, as well as for assessing the correctness of probabilistic distributed  ... 
doi:10.1016/s0304-3975(01)00042-1 fatcat:limdbji7r5bjfj2sf4btxi7q5i

Metis1: An Integrated Reference Architecture for Addressing Uncertainty in Decision-support Systems

Bas Huijbrechts, Marina Velikova, Steffen Michels, Roeland Scheepens
2015 Procedia Computer Science  
In particular, outlined are the innovative components (i) for fusing of and reasoning on uncertain information based on probabilistic logic and (ii) for a complementary interactive visualization disclosing  ...  Deliver "actionable" intelligence instead of just raw information -this is what the Metis research project pursues for supporting operational work in domains characterized by constantly evolving situations  ...  Special thanks go out to Tom Regeling (Intelligent Systems / Altran) for most work in exploring and realizing the full integration of all ideas with respect to the realized proof of concept.  ... 
doi:10.1016/j.procs.2015.03.007 fatcat:7c5jao4yz5eohls42hnvvakrmi

An Assertion-Based Program Logic for Probabilistic Programs [chapter]

Gilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub
2018 Lecture Notes in Computer Science  
Ellora features new proof rules for loops and adversarial code, and supports richer assertions than existing program logics.  ...  We also show that Ellora allows convenient reasoning about complex probabilistic concepts by developing a new program logic for probabilistic independence and distribution law, and then smoothly embedding  ...  This work was partially supported by ERC Grant #679127, and NSF grant 1718220.  ... 
doi:10.1007/978-3-319-89884-1_5 fatcat:vuxgmjepovgslhqggyidblsyxe

BCRB 2018 introduction

Alysson Bessani, Hans P. Reiser, Marko Vukolic, Tobias Distler
2018 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)  
discussing new ideas towards probabilistic model checking.  ...  Apart from elaborating on further use cases, BCRB '18 gives researchers an opportunity to present system support and techniques for improving the resilience and scalability of Byzantine fault-tolerant  ...  Furthermore, we are grateful to Johannes Köstler for his support as Web and Publication Chair.  ... 
doi:10.1109/dsn-w.2018.00049 dblp:conf/dsn/BessaniRVD18 fatcat:3uonfzygznd3ppqy2z6cvbszru

Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs [chapter]

Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin
2012 Lecture Notes in Computer Science  
Provable security The goal of provable security is to verify rigorously the security of cryptographic systems. A provable security argument proceeds in three steps: hal-00765864, version 1 -  ...  Both support the code-based approach, and capture many common reasoning patterns in cryptographic proofs.  ...  Proofs in provable security are by reduction. For simplicity, assume that the system under consideration is proved secure under a single assumption.  ... 
doi:10.1007/978-3-642-31113-0_1 fatcat:57nuknuetba6xfvn4bougb2yqy

Towards Probabilistic Modelling in Event-B [chapter]

Anton Tarasyuk, Elena Troubitsyna, Linas Laibinis
2010 Lecture Notes in Computer Science  
We show how to transform an Event-B model into a Markov model amendable for probabilistic reliability analysis.  ...  In Section 3 we introduce a general pattern for specifying cyclic systems.  ...  Acknowledgments This work is supported by IST FP7 DEPLOY Project. We also wish to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-16265-7_20 fatcat:jghwxcymyfgr5j2mtwscuwzof4

An Automated Analysis of the Security of Quantum Key Distribution [article]

Rajagopal Nagarajan, Nikolaos Papanikolaou, Garry Bowen, Simon Gay
2005 arXiv   pre-print
This paper discusses the use of computer-aided verification as a practical means for analysing quantum information systems; specifically, the BB84 protocol for quantum key distribution is examined using  ...  The results presented here are a testament to the effectiveness of the model-checking approach for systems where analytical solutions may not be possible or plausible.  ...  For systems which exhibit probabilistic behaviour, a variation of this technique is used; a probabilistic model-checker, such as PRISM [14] , computes the probability Pr{σ |= Φ i } (7) for given σ and  ... 
arXiv:cs/0502048v1 fatcat:rssoae56qrep3adljwuxctae2a

PhD Abstracts

GRAHAM HUTTON
2017 Journal of functional programming  
Model checking is gaining popularity as an automated technique for systematically analyzing behaviors of systems.  ...  One motivation for using computable distributions, as opposed to more generally measures, is so that we can think of a Turing-complete probabilistic programming language as expressing computable distributions  ... 
doi:10.1017/s0956796817000089 fatcat:p2yk5sbqazcuriv33wdtzekcc4

Computer-Aided Cryptographic Proofs [chapter]

Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, Santiago Zanella Béguelin
2012 Lecture Notes in Computer Science  
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey  ...  The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.  ...  Automation. EasyCrypt provides automated support to prove the validity of pRHL judgments and to derive inequalities about probability quantities.  ... 
doi:10.1007/978-3-642-32347-8_2 fatcat:kxt2kyff2nea3dfdze2blbreay

Computer-Aided Cryptographic Proofs [chapter]

Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin
2012 Lecture Notes in Computer Science  
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey  ...  The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.  ...  Automation. EasyCrypt provides automated support to prove the validity of pRHL judgments and to derive inequalities about probability quantities.  ... 
doi:10.1007/978-3-642-33125-1_1 fatcat:ync6ijz7pzdzleutqaxytfkyje

Advances and challenges of quantitative verification and synthesis for cyber-physical systems

Marta Kwiatkowska
2016 2016 Science of Security for Cyber-Physical Systems Workshop (SOSCYPS)  
They include factory automation systems, robotic assistants, self-driving cars, and wearable and implantable devices.  ...  to support the design process, and hence improve the reliability and reduce production costs.  ...  Probabilistic timed automata, which are timed automata with transitions generalised to discrete probability distributions, are directly supported in PRISM, as is parameter synthesis for timing delays to  ... 
doi:10.1109/soscyps.2016.7579999 dblp:conf/cpsweek/Kwiatkowska16 fatcat:ugbkizf4xrcgzjvgtutecnepuu

Model exploration and analysis for quantitative safety refinement in probabilistic B

Ukachukwu Ndukwu, Annabelle McIver
2011 Electronic Proceedings in Theoretical Computer Science  
The role played by counterexamples in standard system analysis is well known; but less common is a notion of counterexample in probabilistic systems refinement.  ...  analysis for the refinement of quantitative safety specifications in the probabilistic B language.  ...  Acknowledgement: The authors are grateful to Thai Son Hoang for assistance with the pB models of the embedded controller. We also appreciate the anonymous reviewers for their very helpful comments.  ... 
doi:10.4204/eptcs.55.7 fatcat:g6lk756nszad3j56bftrcmjmwa

A Formalized Hierarchy of Probabilistic System Types [chapter]

Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel
2015 Lecture Notes in Computer Science  
This approach yields simple and concise proofs, as bisimilarity coincides with equality for codatatypes.  ...  On the way, we develop libraries of bounded sets and discrete probability distributions and integrate them with the facility for (co)datatype definitions.  ...  We thank Tobias Nipkow for supporting this collaboration and Ana Sokolova for confirming our findings regarding Vardi systems.  ... 
doi:10.1007/978-3-319-22102-1_13 fatcat:xt75einfl5epvkunnqi4bxjgki
« Previous Showing results 1 — 15 out of 14,077 results