A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 275-287
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Tree-like counterexamples in model checking2003
- Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis2002
- Symbolic Localization Reduction with Reconstruction Layering and Backtracking2002
- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques2002
- Local Parallel Model Checking for the Alternation-Free μ-CalculusLecture Notes in Computer Science, 2002
- From Falsification to Verification2001
- Model Checking with Formula-Dependent Abstract ModelsLecture Notes in Computer Science, 2001
- Counterexample-Guided Abstraction Refinement2000
- Abstract interpretation of reactive systemsACM Transactions on Programming Languages and Systems, 1997
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977