The following pages link to Completing the temporal picture (Q1176248):
Displaying 21 items.
- A dynamic logic for deductive verification of multi-threaded programs (Q470007) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Developing topology discovery in Event-B (Q1044181) (← links)
- Models for reactivity (Q1323323) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Hybrid diagrams (Q1853604) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
- Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- Selectively-amortized resource bounding (Q2145338) (← links)
- A sound and complete proof system for a unified temporal logic (Q2197533) (← links)
- First-order temporal logic monitoring with BDDs (Q2225472) (← links)
- Monitorability for the Hennessy-Milner logic with recursion (Q2402551) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past (Q2842605) (← links)
- Liveness Reasoning with Isabelle/HOL (Q3183549) (← links)
- MODULAR RANKING ABSTRACTION (Q3426785) (← links)
- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification (Q5047167) (← links)
