Verification of parameterized concurrent programs by modular reasoning about data and control

DOI10.1145/2103656.2103693zbMath1321.68192OpenAlexW4243742593MaRDI QIDQ2942881

Azadeh Farzan, Zachary Kincaid

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103693

zbMATH Keywords

concurrencyabstract interpretationcompositional reasoningdata flow graphsparameterized programsthread invariants

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

A tree-based approach to data flow proofs ⋮ Compositional Reasoning ⋮ Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems ⋮ Verification of concurrent programs using Petri net unfoldings ⋮ Lost in abstraction: monotonicity in multi-threaded programs

This page was built for publication: Verification of parameterized concurrent programs by modular reasoning about data and control