scientific article; zbMATH DE number 177518
From MaRDI portal
Publication:4037387
Recommendations
- A lattice-theoretic characterization of safety and liveness
- Do we need liveness? Approximation of liveness properties by safety properties
- Using integer programming to verify general safety and liveness properties
- scientific article; zbMATH DE number 1318512
- Publication:4945222
- Computer Science Logic
- Direct formal verification of liveness properties in continuous and hybrid dynamical systems
Cited in
(19)- Liveness in timed and untimed systems
- Using integer programming to verify general safety and liveness properties
- Liveness characterization for GFC systems. II
- Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
- Off-the-shelf automated analysis of liveness properties for just paths
- Liveness checking as safety checking for infinite state spaces
- A lattice-theoretic characterization of safety and liveness
- Liveness properties in CafeOBJ -- a case study for meta-level specifications
- scientific article; zbMATH DE number 177525 (Why is no real title available?)
- scientific article; zbMATH DE number 1324660 (Why is no real title available?)
- scientific article; zbMATH DE number 2043538 (Why is no real title available?)
- Liveness in timed and untimed systems
- scientific article; zbMATH DE number 1424032 (Why is no real title available?)
- A Fast Verified Liveness Analysis in SSA Form
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Proving Liveness by Backwards Reachability
- Symbolic liveness analysis of real-world software
- Refining the Safety-Liveness Classification of Temporal Properties According to Realizability
- Proving liveness of fair transition systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037387)
