Theory of linear and integer programming
Theory of linear and integer programming
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel program design: a foundation
Parallel program design: a foundation
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Probabilistic non-determinism
Building on the unity experience: compositionality, fairness and probability in parallelism
Building on the unity experience: compositionality, fairness and probability in parallelism
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about Grover's quantum search algorithm using probabilistic wp
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
A probabilistic approach to information hiding
Programming methodology
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Theoretical Computer Science
Reliability assessment through probabilistic refinement
Nordic Journal of Computing
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
Cost-based analysis of probabilistic programs mechanised in HOL
Nordic Journal of Computing
FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
Journal of Functional Programming
Probabilistic guarded commands mechanized in HOL
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
An elementary proof that Herman's ring is Θ(N2)
Information Processing Letters
Eilenberg--Moore algebras for stochastic relations
Information and Computation
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about probabilistic sequential programs
Theoretical Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
A static analysis for quantifying information flow in a simple imperative language
Journal of Computer Security
Proofs and Refutations for Probabilistic Refinement
FM '08 Proceedings of the 15th international symposium on Formal Methods
Probabilistic Choice in Refinement Algebra
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Towards mechanized correctness proofs for cryptographic algorithms
Science of Computer Programming
Temporalization of Probabilistic Propositional Logic
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate transformers for extended probability and non-determinism
Mathematical Structures in Computer Science
A DSL for Explaining Probabilistic Reasoning
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
IBM Journal of Research and Development
How to Brew-up a Refinement Ordering
Electronic Notes in Theoretical Computer Science (ENTCS)
Data Refinement with Probability in Mind
Electronic Notes in Theoretical Computer Science (ENTCS)
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Unifying Probability with Nondeterminism
FM '09 Proceedings of the 2nd World Congress on Formal Methods
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Tank Monitoring: A pAMN Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Guarded Commands Mechanized in HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning About Imperative Quantum Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
An elementary proof that Herman's Ring is Θ(N2)
Information Processing Letters
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Probabilistic invariants for probabilistic machines
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic choice, reversibility, loops, and miracles
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Modeling genome evolution with a DSEL for probabilistic programming
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Retrospective and prospective for unifying theories of programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Reasoning about states of probabilistic sequential programs
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Probabilistic program analysis for parallelizing compilers
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
The challenge of probabilistic event B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Quantitative temporal logic mechanized in HOL
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Using probabilistic kleene algebra for protocol verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Programming-logic analysis of fault tolerance: expected performance of self-stabilisation
Rigorous Development of Complex Fault-Tolerant Systems
Of probabilistic wp and CSP - and compositionality
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Semantics of non-deterministic possibility computation
Fuzzy Sets and Systems
Probabilistic abstract interpretation
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Elementary probability theory in the eindhoven style
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Tracing Relations Probabilistically
Fundamenta Informaticae
Tracing Relations Probabilistically
Fundamenta Informaticae
Probabilistic contracts for component-based design
Formal Methods in System Design
Approaches to modelling security scenarios with domain-specific languages
SP'12 Proceedings of the 20th international conference on Security Protocols
A visual language for explaining probabilistic reasoning
Journal of Visual Languages and Computing
Probabilistic Relational Reasoning for Differential Privacy
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying quantitative reliability for programs that execute on unreliable hardware
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Quantitative reactive modeling and verification
Computer Science - Research and Development
Duality in Logic and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
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.