Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

40

TPHOL
2009
IEEE

favoriteEmaildiscussreport

282views Automated Reasoning» more TPHOL 2009»

A Hoare Logic for the State Monad

14 years 5 months ago

A Hoare Logic for the State Monad

Download www.cse.chalmers.se

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

Wouter Swierstra

Real-time Traffic

Artificial Intelligence | Coq’s Program Framework | Functional Programs | State Monad | TPHOL 2009 |

claim paper

Related Content

» MonadIndependent Hoare Logic in HASCASL

» Generic Exception Handling and the Java Monad

» Polymorphism and separation in hoare type theory

» Structuring the verification of heapmanipulating programs

» Parametrized Exceptions

» A Hoare Logic for the Coinductive TraceBased BigStep Semantics of While

» Reasoning About States of Probabilistic Sequential Programs

» On decidability of monadic logic of order over the naturals extended by monadic predicates

» Hoare Logic for Realistically Modelled Machine Code

Post Info
More Details (n/a)

Added	24 May 2010
Updated	24 May 2010
Type	Conference
Year	2009
Where	TPHOL
Authors	Wouter Swierstra

Comments (0)