Abstract:

In this talk we describe ongoing work on developing a compositional proof system for the concurrent functional programming language Erlang. Three main components of the work are: a (Plotkin-style) operational semantics for a core fragment of Erlang including recursion, parallelism, communication and process spawning; a specification logic for the Erlang fragment based on the modal mu-calculus; and a compositional proof system for establishing that Erlang programs possesses properties expressed in the specification logic. The proof system is based on an early prototype tool for the pi-calculus developed at SICS. An early implementation of the system can be demonstrated on request.