An efficiently checkable, proof-based formulation of vacuity in model checking
From MaRDI portal
Recommendations
Cited in
(12)- Before and after vacuity
- Vacuity in practice: temporal antecedent failure
- Timed vacuity
- Vacuity in synthesis
- Beyond vacuity: towards the strongest passing formula
- Extracting unsatisfiable cores for LTL via temporal resolution
- Inherent vacuity in lattice automata
- Synthesizing non-vacuous systems
- On the Notion of Vacuous Truth
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Linear temporal logic symbolic model checking
- Vacuum cleaning CTL formulae
This page was built for publication: An efficiently checkable, proof-based formulation of vacuity in model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312943)