Adequate proof principles for invariance and liveness properties of concurrent programs

DOI10.1016/0167-6423(84)90003-0MaRDI QIDQ795497zbMATH OpenOpenAlexFDO

Authors Zohar Manna, Amir Pnueli

Publication date 1984

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(84)90003-0

zbMATH Keywords

concurrent programsinvariance propertiesliveness properties

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Concurrent program verification with invariant-guided underapproximation
• Specification and verification of concurrent programs through refinements
• scientific article; zbMATH DE number 177266
• On verifying that a concurrent program satisfies a nondeterministic specification
• A proof system for concurrent ADA programs
• Property preserving abstractions for the verification of concurrent systems

Cited in

(28)

• Defining conditional independence using collapses
• Automated temporal reasoning about reactive systems
• Atomic semantics of nonatomic programs
• On relative and probabilistic finite counterability
• An operator net model for distributed systems
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
• A verification system for concurrent programs based on the Boyer-Moore prover
• Proving liveness of parameterized programs
• Verification of concurrent programs: The automata-theoretic framework
• Liminf progress measures
• Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems
• The power of temporal proofs
• Interleaving set temporal logic
• Property Directed Reachability for Proving Absence of Concurrent Modification Errors
• Proving partial order properties
• A complete fragment of LTL(EB)
• Quantitative safety and liveness
• Verifying atomic data types
• Completing the temporal picture
• Axiomatic treatment of processes with shared variables revisited
• Syntax directed analysis of liveness properties of while programs
• A mechanically verified incremental garbage collector
• A criterion for atomicity
• Specifying modules to satisfy interfaces: A state transition system approach
• Méthode axiomatique sur les propriétés de fatalité des programmes parallèles
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• A methodology for designing proof rules for fair parallel programs

This page was built for publication: Adequate proof principles for invariance and liveness properties of concurrent programs

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