Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical method for verifying event-driven software
Proceedings of the 21st international conference on Software engineering
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Syntactic Program Transformations for Automatic Abstraction
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Successive Approximation of Abstract Transition Relations
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
A local approach for temporal model checking of Java bytecode
Journal of Computer and System Sciences
Data structures for symbolic multi-valued model-checking
Formal Methods in System Design
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
On model checking multiple hybrid views
Theoretical Computer Science
Refinement of Kripke Models for Dynamics
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
3-Valued abstraction: More precision at less cost
Information and Computation
LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
An integrated infrastructure for monitoring and evaluating agent-based systems
Expert Systems with Applications: An International Journal
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Three-Valued Spotlight Abstractions
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Abstraction and Probabilities for Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
More precise partition abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Better under-approximation of programs by hiding variables
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Leaping loops in the presence of abstraction
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
An abstraction-refinement framework for trigger querying
SAS'11 Proceedings of the 18th international conference on Static analysis
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Improved model checking of hierarchical systems
Information and Computation
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Multi-valued model checking games
Journal of Computer and System Sciences
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
How thorough is thorough enough?
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Smaller abstractions for ∀CTL* without next
Concurrency, Compositionality, and Correctness
Why waste a perfectly good abstraction?
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Generalized model checking is a framework for reasoning about partial state spaces of concurrent reactive systems. The state space of a system is only "partial" (partially known) when a full state-space exploration is not computationally tractable, or when abstraction techniques are used to simplify the system's representation. In the context of automatic abstraction, generalized model checking means checking whether there exists a concretization of an abstraction that satisfies a temporal logic formula. In this paper, we showh owgen eralized model checking can extend existing automatic abstraction techniques (such as predicate abstraction) for model checking concurrent/reactive programs and yield the three following improvements: (1) any temporal logic formula can be checked (not just universal properties as with traditional conservative abstractions), (2) correctness proofs and counterexamples are both guaranteed to be sound, and (3) verification results can be more precise. We study the cost needed to improve precision by presenting new upper and lower bounds for the complexity of generalized model checking in the size of the abstraction.