CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68427MaRDI QIDQ5897502

Tayssir Touili, Ahmed Bouajjani, Markus Müller-Olm

Publication date: 1 November 2006

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

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

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems, Budget-bounded model-checking pushdown systems, Verification of well-formed communicating recursive state machines, Analyzing pushdown systems with stack manipulation, Verifying parallel programs with dynamic communication structures, Model checking dynamic pushdown networks, On store languages and applications, Automated formal analysis and verification: an overview, Reachability for Dynamic Parametric Processes, Normalization of Linear Horn Clauses, On Probabilistic Parallel Programs with Process Creation and Synchronisation, Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation, Verifying Parallel Programs with Dynamic Communication Structures, Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order