Verifying Concurrent Programs against Sequential Specifications

DOI10.1007/978-3-642-37036-6_17zbMath1381.68048OpenAlexW2145919405MaRDI QIDQ5326292

Michael Emmi, Constantin Enea, Ahmed Bouajjani, Jad Hamza

Publication date: 5 August 2013

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37036-6_17

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 (11)

On the correctness problem for serializability ⋮ TSO-to-TSO linearizability is undecidable ⋮ On reducing linearizability to state reachability ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ Decomposable Relaxation for Concurrent Data Structures ⋮ On the complexity of linearizability ⋮ Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency ⋮ Concurrent correctness in vector space ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Verifying Concurrent Programs against Sequential Specifications