Interfacing dynamically typed languages and the why tool: Reasoning about lists and tuples
Paper i 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.

erlang

verification conditions

why tool

Författare

Claudio Amaral

Chalmers, Data- och informationsteknik, Programvaruteknik

M. Florido

Universidade do Porto

Patrik Jansson

Chalmers, Data- och informationsteknik, Programvaruteknik

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

92-93

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1145/2034654.2034673

ISBN

978-145030859-5