Formula-Dependent Abstraction for CTL Model Checking

Authors:
Junyan Qian;Lingzhong Zhao;Guoyong Cai;Tianlong Gu
Affiliations:
Department of Computer Science and Technology, Guilin University of Electronic Technology, Guilin, China 541004;Department of Computer Science and Technology, Guilin University of Electronic Technology, Guilin, China 541004;Department of Computer Science and Technology, Guilin University of Electronic Technology, Guilin, China 541004;Department of Computer Science and Technology, Guilin University of Electronic Technology, Guilin, China 541004
Venue:
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Year:
2008

Citing 22
Cited 0

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Timing verification by successive approximation

Information and Computation
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Equivalences for Fair Kripke Structures

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Incremental Verification by Abstraction

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Generation of Reduced Models for Checking Fragments of CTL

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Formula-Dependent Equivalence for Compositional CTL Model Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Efficient Verification of Sequential and Concurrent C Programs

Formal Methods in System Design
Strong preservation of temporal fixpoint-based operators by abstract interpretation

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a state abstraction that is defined with respect to a given CTL formula. Since it does not attempt to preserve all ACTL formula, like simulation does, we can expect to compute coarser abstraction. Specifically, the abstraction is used to reduce the size of each Kripke structure, so that their product will be smaller. When the abstraction is too coarse, we show how refinement can be applied to produce a more precise abstract model. We also extend the notion of formula-dependent abstraction to Kripke structure with fairness, and define the coarsest abstraction that preserves the given CTL formula interpreted with respect to the fair paths. The method is exact and fully automatic, and handles full CTL.