Liveness Reasoning with Isabelle/HOL

DOI10.1007/978-3-642-03359-9_33MaRDI QIDQ3183549zbMATH OpenOpenAlexFDO

Authors Jinshuang Wang, Huabing Yang, Xingyuan Zhang

Publication date 20 October 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-03359-9_33

zbMATH Keywords

inductive protocol verificationliveness proofparametric fairnessprobabilistic model

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Liveness and acceleration in parameterized verification
• Liveness by Invisible Invariants
• Liveness and fairness in process-algebraic verification
• Verification, Model Checking, and Abstract Interpretation
• Parameterized verification by probabilistic abstraction

Cites work

• A formal approach to probabilistic termination
• Completing the temporal picture
• Formalizing integration theory with an application to probabilistic algorithms
• Isabelle/HOL. A proof assistant for higher-order logic
• On fairness and randomness
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• Probabilistic verification

Cited in

(2)

• Priority inheritance protocol proved correct
• Proving Liveness by Backwards Reachability

Describes a project that uses

Uses Software

• Isabelle/HOL
• Isabelle
• Isar

This page was built for publication: Liveness Reasoning with Isabelle/HOL

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