Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations

DOI10.1145/2532440zbMath1291.03028OpenAlexW2164131403MaRDI QIDQ5169969

Dana Fisman, John W. Havlicek, Cindy Eisner

Publication date: 17 July 2014

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2532440

zbMATH Keywords

livenesssafetytopologyregular expressionstemporal logicSVAPSL

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) Temporal logic (03B44)

Related Items (1)

Functional Specification of Hardware via Temporal Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining liveness
• Recognizing safety and liveness
• The temporal semantics of concurrent programs
• Reasoning about infinite computations
• Safety, liveness and fairness in temporal logic
• A lattice-theoretic characterization of safety and liveness
• Temporal logic can be more expressive
• Looping vs. repeating in dynamic logic
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• A topological characterization of weakness
• Computer Science Logic
• Some Complexity Results for SystemVerilog Assertions
• Computer Aided Verification

This page was built for publication: Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations