Who: A Verifier for Effectful Higher-order Programs

Johannes Kanig 1 Jean-Christophe Filliâtre 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00777585
Contributor : Claude Marché <>
Submitted on : Thursday, January 17, 2013 - 4:47:04 PM
Last modification on : Thursday, April 5, 2018 - 12:30:08 PM
Long-term archiving on : Thursday, April 18, 2013 - 4:01:54 AM

File

wml09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00777585, version 1

Collections

Citation

Johannes Kanig, Jean-Christophe Filliâtre. Who: A Verifier for Effectful Higher-order Programs. ACM SIGPLAN Workshop on ML, Aug 2009, Edinburgh, United Kingdom. ⟨hal-00777585⟩

Share

Metrics

Record views

407

Files downloads

647