Who: A verifier for effectful higher-order programs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present Who, a tool for verifying effectful higher-order functions. It features Effect polymorphism, higher-order logic and the possibility to reason about state in the logic, which enable highly modular specifications of generic code. Several small examples and a larger case study demonstrate its usefulness. The Who tool is intended to be used as an intermediate language for verification tools targeting ML-like programming languages.

Original languageEnglish
Title of host publicationML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML
Pages39-48
Number of pages10
Publication statusPublished - 30 Nov 2009
Event2009 ACM SIGPLAN Workshop on ML, ML'09 - Edinburgh, United Kingdom
Duration: 30 Aug 200930 Aug 2009

Publication series

NameML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML

Conference

Conference2009 ACM SIGPLAN Workshop on ML, ML'09
Country/TerritoryUnited Kingdom
CityEdinburgh
Period30/08/0930/08/09

Keywords

  • Higher-order programs
  • Hoare logic

Fingerprint

Dive into the research topics of 'Who: A verifier for effectful higher-order programs'. Together they form a unique fingerprint.

Cite this