A stuttering closed temporal logic for modular reasoning about concurrent programs

DOI10.1007/BFB0014000MaRDI QIDQ4518435zbMATH OpenFDO

Authors Abdel Mokkedem, Daniel Méry

Publication date 28 November 2000

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

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

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On using temporal logic for refinement and compositional verification of concurrent systems
• scientific article; zbMATH DE number 4119598
• Proving correctness of timed concurrent constraint programs
• Proving correctness of timed concurrent constraint programs
• “Sometimes” and “not never” revisited

Cited in

(6)

• RGITL: a temporal logic framework for compositional reasoning about interleaved programs
• Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
• scientific article; zbMATH DE number 4060695 (Why is no real title available?)
• Global equivalence proofs for ISTL
• Modal logics for communicating systems
• On using temporal logic for refinement and compositional verification of concurrent systems

This page was built for publication: A stuttering closed temporal logic for modular reasoning about concurrent programs

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