Counter machines and verification Problems

Authors:
Oscar H. Ibarra;Jianwen Su;Zhe Dang;Tevfik Bultan;Richard A. Kemmerer
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
Theoretical Computer Science
Year:
2002

Citing 12
Cited 13

Analysis of a class of communicating finite state machines

Acta Informatica
Symbolic model checking: an approach to the state explosion problem

Symbolic model checking: an approach to the state explosion problem
A theory of timed automata

Theoretical Computer Science
New Decidability Results Concerning Two-Way Counter Machines

SIAM Journal on Computing
On Context-Free Languages

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
An NP-Complete Number-Theoretic Problem

Journal of the ACM (JACM)
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Verifying Systems with Infinite but Regular State Spaces

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)

CAV '97 Proceedings of the 9th 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

Past pushdown timed automata and safety verification

Theoretical Computer Science - Implementation and application automata
Alternating two-way AC-tree automata

Information and Computation
Reversal-Bounded Counter Machines Revisited

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Monadic second-order logics with cardinalities

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Expressive languages for path queries over graph-structured data

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Model checking recursive programs with numeric data types

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The complexity of reversal-bounded model-checking

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Flat acceleration in symbolic model checking

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
When model-checking freeze LTL over counter machines becomes decidable

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Algorithmic metatheorems for decidable LTL model checking over infinite systems

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Expressive Languages for Path Queries over Graph-Structured Data

ACM Transactions on Database Systems (TODS)
On selective unboundedness of VASS

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study various generalizations of reversal-bounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. The extensions include allowing the machines to perform linear-relation tests among the counters and parameterized constants (e.g., "Is 3x-5y-2D1 + 9D2 ?", where x, y are counters, and D1,D2 are parameterized constants). We believe that these machines are the most powerful machines known to date for which these decision problems are decidable. Decidability results for such machines are useful in the analysis of reachability problems and the verification/debugging of safety properties in infinite-state transition systems. For example, we show that (binary, forward, and backward) reachability and safety are solvable for these machines.