Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata for reduction properties solving
Journal of Symbolic Computation
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Term rewriting and all that
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
LTL Model Checking for Security Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Tree Automata with Global Constraints
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Approximation-based tree regular model-checking
Nordic Journal of Computing
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
From linear temporal logic properties to rewrite propositions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
This paper investigates the use of tree automata with global equalities and disequalities (TAGED for short) in reachability analysis over term rewriting systems (TRSs). The reachability problem being in general undecidable on non terminating TRSs, we provide TAGED-based construction, and then design approximation-based semi-decision procedures to model-check useful temporal patterns on infinite state rewriting graphs. To show that the above TAGED-based construction can be effectively carried out, complexity analysis for rewriting TAGED-definable languages is given.