Verifying probabilistic procedural programs

DOI10.1007/978-3-540-30538-5_2MaRDI QIDQ5465856zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Kousha Etessami

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algorithmic verification of recursive probabilistic state machines
• Verification of Probabilistic Programs
• Validation of Stochastic Systems
• The complexity of probabilistic verification
• Probabilistic verification

Cited in

(16)

• A note on the attractor-property of infinite-state Markov chains
• Verification of multiprocess probabilistic protocols
• Bounded model checking for probabilistic programs
• An assertion-based program logic for probabilistic programs
• Reasoning about probabilistic sequential programs
• Probabilistic verification and approximation
• On probabilistic parallel programs with process creation and synchronisation
• Verification of procedural programs
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Carrying probabilities to the infinite world
• Program verification as probabilistic inference
• Verification of Probabilistic Programs
• An automata-theoretic approach to infinite-state systems
• Verifying probabilistic programs using a Hoare like logic
• Validation of Stochastic Systems
• Probabilistic verification of Boolean functions

This page was built for publication: Verifying probabilistic procedural programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465856)