Reasoning about probabilistic sequential programs
DOI10.1016/J.TCS.2007.02.040zbMATH Open1121.68028DBLPjournals/tcs/ChadhaCMS07OpenAlexW2041467928WikidataQ59196685 ScholiaQ59196685MaRDI QIDQ2373709FDOQ2373709
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
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
Probability and inductive logic (03B48) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Probabilistic logic
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- A logic for reasoning about time and reliability
- Retracted: Semantic domains for combining probability and non-determinism
- An axiomatic basis for computer programming
- A probabilistic PDL
- A decidable propositional dynamic logic with explicit probabilities
- A probabilistic dynamic logic
- Decidability of finite probabilistic propositional dynamic logics
- A logic for reasoning about probabilities
- Semantics of probabilistic programs
- Weakly complete axiomatization of exogenous quantum propositional logic
- Decidability and expressiveness for first-order logics of probability
- Title not available (Why is that?)
- The complexity of elementary algebra and geometry
- Extending classical logic for reasoning about quantum systems
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
- Title not available (Why is that?)
- Reasoning about imperative quantum programs
- Exogeneous semantics approach to enriching logics
- Probabilistic logic revisited
- Reasoning About States of Probabilistic Sequential Programs
- Quantum Institutions
- Title not available (Why is that?)
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
- Title not available (Why is that?)
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)
