Analysis of Message Passing Programs Using SMT-Solvers

DOI10.1007/978-3-319-02444-8_20zbMath1410.68079OpenAlexW1928626871MaRDI QIDQ5166693

Mohamed Faouzi Atig, Jonathan Cederberg, Parosh Aziz 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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Delay-bounded scheduling without delay! ⋮ Decidable models of integer-manipulating programs with recursive parallelism

This page was built for publication: Analysis of Message Passing Programs Using SMT-Solvers