Testing with functional reference implementations

Authors:
Pieter Koopman;Rinus Plasmeijer
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands
Venue:
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Year:
2010

Citing 1
Cited 1

GAST: generic automated software testing

IFL'02 Proceedings of the 14th international conference on Implementation of functional languages

Formal model-based validation for tally systems

Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses our approach to test programs that determine which candidates are elected in the Scottish Single Transferable Vote (STV) elections. Due to the lack of properties suited for modelbased testing, we have implemented a reference implementation in a pure functional programming language. Our tests revealed issues in the law regulating these elections as well as the programs implementing the rules that are offered for certification. Hence, certification by testing with a reference implementation is able to reveal problems in the software to be certified. Functional programming languages appeared to be an excellent tool to implement reference implementations. The reference implementation was developed quickly and none of the differences found was due to an error in the reference implementation.