The following pages link to Verification: Theory and Practice (Q5305642):
Displaying 10 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
- On the Notion of Vacuous Truth (Q3498452) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- Fundamental Approaches to Software Engineering (Q5316437) (← links)
- Diagnostic Information for Realizability (Q5452707) (← links)
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture (Q5756675) (← links)
- Counterexample classification (Q6045060) (← links)
