Journal Article10.1145/229542.229547
Probabilistic predicate transformers
TL;DR: With the healthiness conditions, the associated weakest-precondition calculus seems suitable for exploring the rigorous derivation of small probabilistic programs.
read more
Abstract: Probabilistic predicates generalize standard predicates over a state space; with probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- and postconditions. Probabilistic healthiness conditions generalize the standard ones, characterizing “real” probabilistic programs, and are based on a connection with an underlying relational model for probabilistic execution; in both contexts demonic nondeterminism coexists with probabilistic choice. With the healthiness conditions, the associated weakest-precondition calculus seems suitable for exploring the rigorous derivation of small probabilistic programs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Probabilistic relational reasoning for differential privacy
Gilles Barthe,Boris Köpf,Federico Olmedo,Santiago Zanella Béguelin +3 more
- 25 Jan 2012
TL;DR: The central component of CertiPriv is a quantitative extension of a probabilistic relational Hoare logic that enables one to derive differential privacy guarantees for programs from first principles, providing the first machine-checked proofs of correctness of the Laplacian and Exponential mechanisms and of the privacy of randomized and streaming algorithms from the recent literature.
Verifying quantitative reliability for programs that execute on unreliable hardware
TL;DR: A static quantitative reliability analysis is presented that verifies quantitative requirements on the reliability of an application, enabling a developer to perform sound and verified reliability engineering.
205
PSI: Exact Symbolic Inference for Probabilistic Programs
Timon Gehr,Sasa Misailovic,Sasa Misailovic,Martin Vechev +3 more
- 17 Jul 2016
TL;DR: This paper presents a meta-modelling framework for approximate inference, which automates the very labor-intensive and therefore time-heavy and expensive process of exact inference for probabilistic programs.
195
Symbolic Model Checking for Probabilistic Processes
Christel Baier,Edmund M. Clarke,Vassili Hartonas-Garmhausen,Marta Kwiatkowska,Mark Ryan +4 more
- 07 Jul 1997
TL;DR: A symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models is introduced, based on the algorithm used by Hansson and Jonsson [24], and is efficient because it avoids explicit state space construction.
Formal verification of probabilistic algorithms
Joe Hurd
- 01 Jan 2003
TL;DR: This thesis shows how probabilistic algorithms can be formally verified using a mechanical theorem prover, and defines a version with strong properties, which can execute in the logic to prove compositeness of numbers.
References
•Book
Theory of Linear and Integer Programming
Alexander Schrijver
- 01 Dec 1986
TL;DR: Introduction and Preliminaries.
•Book
An axiomatic basis for computer programming
C. A. R. Hoare
- 01 Jan 2002
TL;DR: In this article, the logical foundations of computer programming are explored by using techniques first applied in the study of geometry and later extended to other branches of mathematics, and a formal proof of a simple theorem is displayed.
3.3K
•Journal Article
An Axiomatic Basis for Computer Programming (Reprint).
Abstract: In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics.
1.5K
A logic for reasoning about probabilities
Ronald Fagin,Joseph Y. Halpern,Nimrod Megiddo +2 more
- 05 Jul 1988
TL;DR: In both cases, an elegant complete axiomization is provided, and it is shown that the problem of deciding satisfiability is NP-complete.
691
Related Papers (5)
Edsger W. Dijkstra
- 01 Jan 1976
Annabelle Mclver,Carroll Morgan +1 more
- 19 Nov 2004
Carroll Morgan,A McI +1 more
- 01 Jan 1998