Effective Abstractions for Verification under Relaxed Memory Models

DOI10.1007/978-3-662-46081-8_25zbMath1432.68259OpenAlexW227403520MaRDI QIDQ5172657

Yuri Meshman, Eran Yahav, Martin Vechev, Andrei Marian Dan

Publication date: 4 February 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46081-8_25

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 problems of computer architecture (68M07) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Verification of Concurrent Programs on Weak Memory Models ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption