The following pages link to CEGAR (Q16776):
Displaying 37 items.
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Constraint Markov chains (Q554215) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Abstract model repair for probabilistic systems (Q1706149) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Local abstraction refinement for probabilistic timed programs (Q2453108) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Proof spaces for unbounded parallelism (Q2819827) (← links)
- Infeasible Paths Elimination by Symbolic Execution Techniques (Q2829242) (← links)
- Solving QBF with Counterexample Guided Refinement (Q2843327) (← links)
- Refinement and difference for probabilistic automata (Q2878759) (← links)
- Verification and refutation of probabilistic specifications via games (Q2920132) (← links)
- SMT-Based Bisimulation Minimisation of Markov Models (Q2926637) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains (Q3400550) (← links)
- Effective Verification of Replicated Data Types Using Later Appearance Records (LAR) (Q3460572) (← links)
- Probabilistic CEGAR (Q3512491) (← links)
- Abstraction for Stochastic Systems by Erlang’s Method of Stages (Q3541024) (← links)
- Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification (Q3584923) (← links)
- A Framework for Verification of Software with Time and Probabilities (Q3588082) (← links)
- Compositional Abstraction for Stochastic Systems (Q3648832) (← links)
- Variable Probabilistic Abstraction Refinement (Q4649305) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- Reveal: A Formal Verification Tool for Verilog Designs (Q5505565) (← links)
- Applying CEGAR to the Petri Net State Equation (Q5892497) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5899060) (← links)
