CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68427OpenAlexW1737342522MaRDI 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

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (19)

Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous ⋮ On store languages and applications ⋮ Reachability for Dynamic Parametric Processes ⋮ Analyzing pushdown systems with stack manipulation ⋮ Verifying parallel programs with dynamic communication structures ⋮ Budget-bounded model-checking pushdown systems ⋮ Normalization of Linear Horn Clauses ⋮ On Probabilistic Parallel Programs with Process Creation and Synchronisation ⋮ Verification of well-formed communicating recursive state machines ⋮ 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 ⋮ Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Verifying Parallel Programs with Dynamic Communication Structures ⋮ Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order ⋮ Automated formal analysis and verification: an overview ⋮ Verification of Asynchronous Programs with Nested Locks ⋮ Model checking dynamic pushdown networks

This page was built for publication: CONCUR 2005 – Concurrency Theory