Verifying Parallel Programs with Dynamic Communication Structures

DOI10.1007/978-3-642-02979-0_18MaRDI QIDQ3637351zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Tayssir Touili

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

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

Recommendations

• Verifying parallel programs with dynamic communication structures
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 5954655
• Reachability analysis of communicating pushdown systems
• Reachability analysis of communicating pushdown systems

Cites work

• scientific article; zbMATH DE number 1232241 (Why is no real title available?)
• scientific article; zbMATH DE number 1304991 (Why is no real title available?)
• scientific article; zbMATH DE number 1538033 (Why is no real title available?)
• scientific article; zbMATH DE number 1796143 (Why is no real title available?)
• scientific article; zbMATH DE number 2090847 (Why is no real title available?)
• A generic approach to the static analysis of concurrent programs with procedures
• CONCUR 2005 – Concurrency Theory
• Computer Aided Verification
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• On the analysis of interacting pushdown systems
• Term Rewriting and Applications
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(7)

• Model checking concurrent programs
• Refinement-Based Verification of Communicating Unstructured Code
• Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings
• Verification of programs with half-duplex communication
• Tools and Algorithms for the Construction and Analysis of Systems
• Verifying parallel programs with dynamic communication structures
• Reasoning about threads with bounded lock chains

Describes a project that uses

Uses Software

• MAGIC

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

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