Operational Reasoning for Concurrent Caml Programs and Weak Memory Models

DOI10.1007/978-3-540-74591-4_21zbMath1144.68305OpenAlexW1520556632MaRDI QIDQ3523182

Thomas Ridge

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-74591-4_21

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Event-based proof of the mutual exclusion property of Peterson's algorithm ⋮ Best practices for comparing optimization algorithms ⋮ ASP\(_{\text{fun}}\) : a typed functional active object calculus ⋮ Inferring large graphs using \(\ell_1\)-penalized likelihood ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives

Uses Software

• SPIN
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Operational Reasoning for Concurrent Caml Programs and Weak Memory Models