On the correctness problem for serializability

DOI10.1007/978-3-030-85315-0_4OpenAlexW3193492192MaRDI QIDQ2119957

Jürgen König, Heike Wehrheim

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85315-0_4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Towards formally specifying and verifying transactional memory
• On reducing linearizability to state reachability
• Model-checking of correctness conditions for concurrent objects
• Model checking transactional memories
• Monitoring Atomicity in Concurrent Programs
• The serializability of concurrent database updates
• The notions of consistency and predicate locks in a database system
• Decidability and Complexity for Quiescent Consistency
• Verifying Concurrent Programs against Sequential Specifications

This page was built for publication: On the correctness problem for serializability