Constraint-based debugging in probabilistic model checking
From MaRDI portal
Publication:6488104
DOI10.1007/S00607-022-01130-0zbMath1519.68132MaRDI QIDQ6488104
Publication date: 24 March 2023
Published in: Computing (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Automated debugging based on a constraint model of the program and a test case
- Explaining counterexamples using causality
- A logic for reasoning about time and reliability
- Model-based diagnosis of hardware designs
- Abstract model repair for probabilistic systems
- Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
- Minimal Critical Subsystems for Discrete-Time Markov Models
- Causality Checking for Complex System Models
- The Birth of Model Checking
- Whodunit? Causal Analysis for Counterexamples
- The program dependence graph and its use in optimization
- Model-checking continuous-time Markov chains
- On the relationship between model-based debugging and program slicing
- Counterexample guided inductive synthesis modulo theories
This page was built for publication: Constraint-based debugging in probabilistic model checking