CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452MaRDI QIDQ5897502zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Constrained dynamic tree networks
• Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
• Forward analysis of dynamic network of pushdown systems is easier without order
• Reachability analysis of pushdown automata: Application to model-checking

Cited in

(38)

• Analyzing pushdown systems with stack manipulation
• Constrained dynamic tree networks
• Verifying parallel programs with dynamic communication structures
• Model checking dynamic pushdown networks
• On store languages and applications
• Reachability analysis of synchronized PA systems
• On symbolic verification of weakly extended PAD
• 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
• Forward analysis of dynamic network of pushdown systems is easier without order
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Approximate Symbolic Reachability of Networks of Transition Systems
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Verifying Parallel Programs with Dynamic Communication Structures
• Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
• Collections
• Tree Automata
• Program-Conflict-Analysis
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Budget-bounded model-checking pushdown systems
• Iterable forward reachability analysis of monitor-DPNs
• Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous
• Verification of asynchronous programs with nested locks
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Using dynamic pushdown networks to automate a modular information-flow analysis
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• Backwards-reachability for cooperating multi-pushdown systems
• Model-checking parametric lock-sharing systems against regular constraints
• Store languages of Turing machines and counter machines
• LTL model checking of concurrent self-modifying code
• Dynamic Pushdown Networks
• Verification of well-formed communicating recursive state machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897502)