Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Symbolic Model Checking
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
Automatic Deductive Verification with Invisible Invariants
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Partial-Order Reduction in Symbolic State Space Exploration
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
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
Handling Global Conditions in Parameterized System Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Liveness and Acceleration in Parameterized Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Permutation Rewriting and Algorithmic Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Composed Bisimulation for Tree Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A Backward and a Forward Simulation for Weighted Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Abstract Regular Tree Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Attenuation regulation as a term rewriting system
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Computing simulations over tree automata: efficient techniques for reducing tree automata
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Efficient inclusion checking on explicit and semi-symbolic tree automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Abstract regular tree model checking of complex dynamic data structures
SAS'06 Proceedings of the 13th international conference on Static Analysis
Bisimulation minimization of tree automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
Simulation-Based iteration of tree transducers
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
VATA: a library for efficient manipulation of non-deterministic tree automata
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A completion algorithm for lattice tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Enhancing approximations for regular reachability analysis
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In this paper, we present an approach for algorithmic verification of infinite-state systems with a parameterized tree topology. Our work is a generalization of regular model checking, where we extend the work done with strings toward trees. States are represented by trees over a finite alphabet, and transition relations by regular, structure preserving relations on trees. We use an automata theoretic method to compute the transitive closure of such a transition relation. Although the method is incomplete, we present sufficient conditions to ensure termination.We have implemented a prototype for our algorithm and show the result of its application on a number of examples.