Operational Reasoning for Concurrent Caml Programs and Weak Memory Models

This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, written in real programming languages, running on machines with real memory models. To this end, we verify a Caml implementation of a concurrent algorithm, Peterson’s mutual exclusion algorithm, down to the operational semantics. The implementation makes use of Caml features such as higher order parameters, state, concurrency and nested general recursion. Our Caml model includes a datatype of expressions, and a small step reduction relation for programs (a Caml expression together with a store). We also develop a new proof of correctness for a modified version of Peterson’s algorithm, designed to run on a machine with a weak memory.

• Type: Conference
• Year: 2007
• Where: TPHOL
• Authors: Tom Ridge
• Keywords: Artificial Intelligence, Caml, Caml Implementation, Programming Languages, TPHOL 2007