Bounded phase analysis of message-passing programs

DOI10.1007/978-3-642-28756-5_31MaRDI QIDQ2894290zbMATH OpenOpenAlexFDO

Authors Ahmed Bouajjani, Michael Emmi

Publication date 29 June 2012

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28756-5_31

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Analysis of message passing programs using SMT-solvers
• On the completeness of verifying message passing programs under bounded asynchrony
• Data flow analysis of asynchronous systems using infinite abstract domains
• Context-Bounded Analysis of Concurrent Queue Systems
• Interprocedural analysis of asynchronous programs

Cited in

(9)

• Automated verification of automata communicating via FIFO and bag buffers
• Data flow analysis of asynchronous systems using infinite abstract domains
• Model checking concurrent programs
• Parameterized Verification of Communicating Automata under Context Bounds
• Analysis of message passing programs using SMT-solvers
• Inferring Channel Buffer Bounds Via Linear Programming
• On the completeness of verifying message passing programs under bounded asynchrony
• A pragmatic approach to stateful partial order reduction
• Delay-bounded scheduling without delay!

This page was built for publication: Bounded phase analysis of message-passing programs

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