Verifying parallel programs with dynamic communication structures

DOI10.1016/j.tcs.2010.05.028zbMath1209.68114OpenAlexW2128935480MaRDI QIDQ1959654

Mohamed Faouzi Atig, Tayssir Touili

Publication date: 7 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.028

zbMATH Keywords

concurrent programsmodel checkingreachability analysisrecognizable setspushdown networks

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Model Checking Concurrent Programs ⋮ Unnamed Item ⋮ Model checking dynamic pushdown networks

Uses Software

• MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generic approach to the static analysis of concurrent programs with procedures
• On the analysis of interacting pushdown systems
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• 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
• Tools and Algorithms for the Construction and Analysis of Systems
• Term Rewriting and Applications
• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Reachability Analysis of Communicating Pushdown Systems
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: Verifying parallel programs with dynamic communication structures