Thread Quantification for Concurrent Shape Analysis

DOI10.1007/978-3-540-70545-1_37zbMath1155.68360OpenAlexW1527710292MaRDI QIDQ3512507

Mooly Sagiv, Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam

Publication date: 15 July 2008

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_37

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)

Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems ⋮ Parametrized invariance for infinite state processes ⋮ Verification of concurrent programs using Petri net unfoldings ⋮ Proving linearizability with temporal logic ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free

Uses Software

• SIMPLIFY
• TVLA

This page was built for publication: Thread Quantification for Concurrent Shape Analysis