A Reduction Theorem for Store Buffers
From MaRDI portal
- ECOOP 2008 -- object-oriented programming. 22nd European conference, Paphos, Cyprus, July 7--11, 2008. Proceedings
- Effective Program Verification for Relaxed Memory Models
- Formalising Java’s Data Race Free Guarantee
- From total store order to sequential consistency: a practical reduction theorem
- Interpretation of Locales in Isabelle: Theories and Proof Contexts
- Isabelle. A generic theorem prover
- Isabelle/HOL. A proof assistant for higher-order logic
- Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
- Theorem proving in higher order logics. 20th international conference, TPHOLs 2007, Kaiserslautern, Germany, September 10--13, 2007. Proceedings
- Types for Proofs and Programs
- Verifying distributed systems: the operational approach
- Winskel is (almost) right. Towards a mechanized semantics textbook
This page was built for software: A Reduction Theorem for Store Buffers
