Thread-Modular Verification Is Cartesian Abstract Interpretation

DOI10.1007/11921240_13zbMath1168.68423OpenAlexW2153037257MaRDI QIDQ3525149

Alexander Malkis, Andreas Podelski, Andrey Rybalchenko

Publication date: 11 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11921240_13

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Static analysis of embedded real-time concurrent software with dynamic priorities ⋮ Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free

This page was built for publication: Thread-Modular Verification Is Cartesian Abstract Interpretation