Assumption/guarantee specifications in linear-time temporal logic
From MaRDI portal
Publication:671674
DOI10.1016/0304-3975(96)00069-2zbMath0874.68210OpenAlexW2001219520MaRDI QIDQ671674
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00069-2
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (7)
Automated compositional proofs for real-time systems ⋮ Assumption/guarantee specifications in linear-time temporal logic (extended abstract) ⋮ Model checking, synthesis, and learning ⋮ From linear temporal logics to Büchi automata: the early and simple principle ⋮ LTL is closed under topological closure ⋮ Conditions of contracts for separating responsibilities in heterogeneous systems ⋮ Proving linearizability with temporal logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical view of composition
- The existence of refinement mappings
- Defining liveness
- The temporal semantics of concurrent programs
- Tentative steps toward a development method for interfering programs
- Proofs of Networks of Processes
- Application of the composition principle to unity-like specifications
This page was built for publication: Assumption/guarantee specifications in linear-time temporal logic
