On the Reachability Analysis of Acyclic Networks of Pushdown Systems

DOI10.1007/978-3-540-85361-9_29zbMath1160.68451OpenAlexW1496958170MaRDI QIDQ3541030

Ahmed Bouajjani, Mohamed Faouzi Atig, Tayssir Touili

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_29

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Model Checking Concurrent Programs ⋮ On store languages and applications ⋮ Verifying parallel programs with dynamic communication structures ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Bounded Context Switching for Valence Systems ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Unnamed Item ⋮ Fine-grained complexity of safety verification ⋮ Verifying Parallel Programs with Dynamic Communication Structures ⋮ On the Complexity of Bounded Context Switching. ⋮ Generalized Post embedding problems ⋮ Model checking dynamic pushdown networks

Uses Software

• MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Undecidable problems in unreliable computations.
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Using forward reachability analysis for verification of lossy channel systems
• Verifying programs with unreliable channels
• Interprocedural analysis of asynchronous programs
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
• Rewriting Models of Boolean Programs
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Context-Bounded Analysis of Concurrent Queue Systems
• Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Term Rewriting and Applications
• Computer Aided Verification
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Well-structured transition systems everywhere!

This page was built for publication: On the Reachability Analysis of Acyclic Networks of Pushdown Systems