Compositionality Entails Sequentializability

DOI10.1007/978-3-642-19835-9_4zbMath1315.68091OpenAlexW2142940251MaRDI QIDQ3000634

Pranav Garg, P. Madhusudan

Publication date: 19 May 2011

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19835-9_4

zbMATH Keywords

concurrent programscompositional verificationsequentialization

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Compositional Reasoning

Uses Software

• SLAM
• Boogie

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to automating the verification of compact parallel coordination programs. I
• An axiomatic proof technique for parallel programs
• The Rely-Guarantee method for verifying shared variable concurrent programs
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Tentative steps toward a development method for interfering programs
• Local rely-guarantee reasoning
• Local Proofs for Global Safety Properties
• Computer Aided Verification

This page was built for publication: Compositionality Entails Sequentializability