scientific article
From MaRDI portal
Publication:4037387
zbMATH Open0765.68115MaRDI QIDQ4037387
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Circuits, networks (94C99) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (9)
A Fast Verified Liveness Analysis in SSA Form ⋮ A lattice-theoretic characterization of safety and liveness ⋮ Symbolic liveness analysis of real-world software ⋮ A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms ⋮ Proving Liveness by Backwards Reachability ⋮ Refining the Safety-Liveness Classification of Temporal Properties According to Realizability ⋮ Liveness characterization for GFC systems. II ⋮ Title not available (Why is that?) ⋮ Liveness checking as safety checking for infinite state spaces
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Using integer programming to verify general safety and liveness properties 👍 👎
- A lattice-theoretic characterization of safety and liveness 👍 👎
- Do We Need Liveness? – Approximation of Liveness Properties by Safety Properties 👍 👎
- Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems 👍 👎
- Computer Science Logic 👍 👎
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)