Reasoning about probabilistic sequential programs

DOI10.1016/J.TCS.2007.02.040MaRDI QIDQ2373709zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas

Publication date 16 July 2007

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

Full work available at URL https://doi.org/10.1016/j.tcs.2007.02.040

zbMATH Keywords

completenessdecidabilityprobabilistic reasoningHoare calculus

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Reasoning about probabilistic sequential programs in a probabilistic logic
• Reasoning About States of Probabilistic Sequential Programs
• Reasoning about Recursive Probabilistic Programs
• Automated reasoning for probabilistic sequential programs with theorem proving
• scientific article; zbMATH DE number 3890702
• An assertion-based program logic for probabilistic programs
• Fine-grained semantics for probabilistic programs
• Probabilistic semantics and program analysis
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cites work

• scientific article; zbMATH DE number 4179422 (Why is no real title available?)
• scientific article; zbMATH DE number 3890702 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1330140 (Why is no real title available?)
• scientific article; zbMATH DE number 1948164 (Why is no real title available?)
• A decidable propositional dynamic logic with explicit probabilities
• A logic for reasoning about probabilities
• A logic for reasoning about time and reliability
• A probabilistic PDL
• A probabilistic dynamic logic
• Algorithms in real algebraic geometry
• An axiomatic basis for computer programming
• Decidability and expressiveness for first-order logics of probability
• Decidability of finite probabilistic propositional dynamic logics
• Exogeneous semantics approach to enriching logics
• Extending classical logic for reasoning about quantum systems
• Probabilistic logic
• Probabilistic logic revisited
• Quantum Institutions
• Reasoning About States of Probabilistic Sequential Programs
• Reasoning about imperative quantum programs
• Retracted: Semantic domains for combining probability and non-determinism
• Semantics of probabilistic programs
• The complexity of elementary algebra and geometry
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Weakly complete axiomatization of exogenous quantum propositional logic

Cited in

(11)

• Reasoning about Recursive Probabilistic Programs
• Formalising Semantics for Expected Running Time of Probabilistic Programs
• Reverse Hoare logic
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
• Temporalization of Probabilistic Propositional Logic
• VPHL: a verified partial-correctness logic for probabilistic programs
• Importing logics: soundness and completeness preservation
• Formal semantics of a classical-quantum language
• Importing logics
• scientific article; zbMATH DE number 3890702 (Why is no real title available?)

This page was built for publication: Reasoning about probabilistic sequential programs

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