Beyond Regular Model Checking

Authors:
Dana Fisman;Amir Pnueli
Affiliations:
-;-
Venue:
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2001

Citing 22
Cited 6

Limits for automatic verification of finite-state concurrent systems

Information Processing Letters
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Automatic verification of parameterized linear networks of processes

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
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
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Composition, decomposition and model checking of pushdown processes

Nordic Journal of Computing
The Equivalence Problem for Deterministic Pushdown Automata is Decidable

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Transitive Closures of Regular Relations for Verifying Infinite-State Systems

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Veryfying Parameterized Networks using Abstraction and Regular Languages

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The Power of QDDs (Extended Abstract)

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Symbolic Model Checking with Rich ssertional Languages

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Verifying Systems with Infinite but Regular State Spaces

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Liveness and Acceleration in Parameterized Verification

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Regular Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification

Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Visibly Pushdown Transducers

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences
Height-deterministic pushdown automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Proofs that count

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Finite Reasons for Safety

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, it has been established that regular model checking can be successfully applied to several parameterized verification problems. However, there are many parameterized verification problems that cannot be described by regular languages, and thus cannot be verified using regular model checking. In this study we try to practice symbolic model checking using classes of languages more expressive than the regular languages. We provide three methods for the uniform verification of non-regular parameterized systems.