Verifying Parallel Programs with Dynamic Communication Structures

DOI10.1007/978-3-642-02979-0_18zbMath1248.68138OpenAlexW2177564498MaRDI QIDQ3637351

Tayssir Touili, Mohamed Faouzi Atig

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_18

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Model Checking Concurrent Programs ⋮ Reasoning about Threads with Bounded Lock Chains

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
• 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
• 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

This page was built for publication: Verifying Parallel Programs with Dynamic Communication Structures