The following pages link to (Q4553254):
Displaying 18 items.
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Bounded semantics (Q483292) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Certifying proofs for SAT-based model checking (Q2058379) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- A self-certifying compilation framework for WebAssembly (Q2234063) (← links)
- From complementation to certification (Q2575735) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- Automatic Synthesis of Assumptions for Compositional Model Checking (Q3613064) (← links)
- Automated Verification of Parallel Nested DFS (Q5039512) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Verified Certification of Reachability Checking for Timed Automata (Q5039522) (← links)
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design (Q5039527) (← links)
- Proving the Refuted: Symbolic Model Checkers as Proof Generators (Q5187831) (← links)
- Foundations of probability-raising causality in Markov decision processes (Q6151547) (← links)
