FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/b94618zbMath1205.68183OpenAlexW2246750081MaRDI QIDQ5191507

Ahmed Bouajjani, Tayssir Touili

Publication date: 6 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94618

Mathematics Subject Classification ID

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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Verifying parallel programs with dynamic communication structures, On the Reachability Analysis of Acyclic Networks of Pushdown Systems, Verification of well-formed communicating recursive state machines, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Verifying Multithreaded Recursive Programs with Integer Variables, Tree regular model checking: a simulation-based approach, Model checking for process rewrite systems and a class of action-based regular properties, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Verifying Parallel Programs with Dynamic Communication Structures, Reachability is decidable for weakly extended process rewrite systems, Decidable first-order transition logics for PA-processes, On Symbolic Verification of Weakly Extended PAD