Interfacing dynamically typed languages and the why tool: Reasoning about lists and tuples
Paper in proceeding, 2011

Formal software verification is currently contributing to new generations of software systems that are proved to follow a given specification. Unfortunately, most dynamically typed languages lack the tools for such reasoning. We present a tool used to help verify some user specified properties on a small language. The process is based on functional contracts with annotations on the source code that later are transformed into logic goals that need to be proved in order to conclude that the program meets its specification. As part of the tool we also present a term model for dynamically typed data structures.

verification conditions


why tool


Claudio Amaral

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

M. Florido

University of Porto

Patrik Jansson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Proceedings of the 2011 ACM SIGPLAN Erlang Workshop, Tokyo, 23 September 2011

978-145030859-5 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Software Engineering

Computer Science





More information

Latest update

9/7/2021 1