Reasoning About States of Probabilistic Sequential Programs

DOI10.1007/11874683_16MaRDI QIDQ3613341zbMATH OpenOpenAlexFDO

Authors Rohit Chadha, Paulo Mateus, Amílcar Sernadas

Publication date 12 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• A decidable propositional dynamic logic with explicit probabilities
• Reasoning about probabilistic sequential programs in a probabilistic logic
• scientific article; zbMATH DE number 1500556
• A probabilistic dynamic logic

Cited in

(9)

• Proving properties of states in the situation calculus
• Reasoning about probabilistic sequential programs in a probabilistic logic
• Reasoning about probabilistic sequential programs
• Exogenous probabilistic computation tree logic
• Reverse Hoare logic
• Reasoning about Recursive Probabilistic Programs
• Foundations of Software Science and Computational Structures
• VPHL: a verified partial-correctness logic for probabilistic programs
• Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs

This page was built for publication: Reasoning About States of Probabilistic Sequential Programs

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