Thread modularity at many levels: a pearl in compositional verification

DOI10.1145/3009837.3009893zbMath1380.68274OpenAlexW2566058028MaRDI QIDQ5370882

Jochen Hoenicke, Rupak Majumdar, Andreas Podelski

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

concurrencyparameterized verificationOwicki-Griesthread-modularity

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) 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 (5)

RustHorn: CHC-Based Verification for Rust Programs ⋮ Sound verification procedures for temporal properties of infinite-state systems ⋮ Unnamed Item ⋮ Temporal prophecy for proving temporal properties of infinite-state systems ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

This page was built for publication: Thread modularity at many levels: a pearl in compositional verification