A Hoare logic for the state monad: Proof pearl
Paper i proceeding, 2009

This pearl examines how to verify functional programs written using the state monad. It uses Coq's Program framework to provide strong specifications for the standard operations that the state monad supports, such as return and bind. By exploiting the monadic structure of such programs during the verification process, it becomes easier to prove that they satisfy their specification.

Författare

Wouter Swierstra

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 5674 LNCS 440-451

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/978-3-642-03359-9_30

ISBN

978-364203358-2

Mer information

Skapat

2017-12-01