Analysis of message passing programs using SMT-solvers

DOI10.1007/978-3-319-02444-8_20MaRDI QIDQ5166693zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Jonathan Cederberg, Parosh A. Abdulla

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_20

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Bounded phase analysis of message-passing programs
• On the completeness of verifying message passing programs under bounded asynchrony
• Reachability analysis of communicating pushdown systems
• Data communicating processes with unreliable channels
• Reachability analysis of communicating pushdown systems

Cited in

(5)

• Bounded phase analysis of message-passing programs
• EasyMSG: Tools and techniques for an adaptive overlapping in SPMD programming
• Decidable models of integer-manipulating programs with recursive parallelism
• On the completeness of verifying message passing programs under bounded asynchrony
• Delay-bounded scheduling without delay!

This page was built for publication: Analysis of message passing programs using SMT-solvers

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