Interfacing dynamically typed languages and the why tool: reasoning about lists and tuples

  • Authors:

  • Cláudio Amaral;Mário Florido;Patrik Jansson

  • Affiliations:

  • Chalmers University of Technology & LIACC - Un of Porto, Gòteborg, Sweden;DCC-FC, University of Porto & LIACC, University of Porto, Porto, Portugal;Chalmers University of Technology, Gòteborg, Sweden

  • Venue:
  • Proceedings of the 10th ACM SIGPLAN workshop on Erlang
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.