Verification of program properties using different theorem provers: a case study

Authors:
J. Santiago Jorge;Victor M. Gulias;Laura M. Castro
Affiliations:
MADS group, Department of Computer Science, Universidade da Coruña, A Coruña, Spain;MADS group, Department of Computer Science, Universidade da Coruña, A Coruña, Spain;MADS group, Department of Computer Science, Universidade da Coruña, A Coruña, Spain
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 7
Cited 0

Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)
An introduction to functional programming

An introduction to functional programming
Concurrent programming in ERLANG (2nd ed.)

Concurrent programming in ERLANG (2nd ed.)
Formal methods: state of the art and future directions

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Software reliability methods

Software reliability methods
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
VoDKA: Developing a Video-on-Demand Server using Distributed Functional Programming

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the use of theorem provers to certify particular properties of software. Two different proof assistants are used to illustrate the method: Coq and Pvs. By comparing two theorem provers, conclusions about their suitability can be stated. The selected scenario is part of a real-world application: a distributed Video-on-Demand server. The development consists on two steps: first, the definition of a model of the algorithm to be studied in the proof assistants; second, the development and proving of the theorems.