Term Rewriting and Applications
From MaRDI portal
Publication:5703871
DOI10.1007/b135673zbMath1078.68652OpenAlexW2504734884MaRDI QIDQ5703871
Ahmed Bouajjani, Tayssir Touili
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (12)
One-variable context-free hedge automata ⋮ Verifying parallel programs with dynamic communication structures ⋮ When Is Reachability Intrinsically Decidable? ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Equational approximations for tree automata completion ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ Verifying Multithreaded Recursive Programs with Integer Variables ⋮ Rigid tree automata and applications ⋮ A note on partially ordered tree automata ⋮ Rigid Tree Automata ⋮ Verifying Parallel Programs with Dynamic Communication Structures ⋮ On Symbolic Verification of Weakly Extended PAD
Uses Software
This page was built for publication: Term Rewriting and Applications
