The Village Telephone System: A case study in formal software
engineering.
| Karthikeyan Bhargavan |
Carl A. Gunter |
Elsa L. Gunter |
Michael Jackson |
Davor Obradovic |
Pamela Zave |
| University of Pennsylvania |
University of Pennsylvania |
Bell Labs, Lucent Technologies |
AT&T Laboratories |
University of Pennsylvania |
AT&T Laboratories |
Abstract:
In this paper we illustrate the use of formal methods in the
development of a benchmark application we call the Village
Telephone System which is characteristic of a class of network and
telecommunication protocols. The aim is to show an effective
integration of methodology and tools in a software engineering task
that proceeds from user-level requirements to an implementation. In
particular, we employ a general methodology which we advocate for
requirements capture and refinement based on a treatment of designated
terminology, domain knowledge, requirements, specifications, and
implementations. We show how a general-purpose theorem prover (HOL)
can provide formal support for all of these components and how a model
checker (Mocha) can provide formal support for the specifications and
implementation. We develop a new HOL theory of inductive sequences
that is suited to modelling reactive systems and provide a common
basis for interoperability between HOL and Mocha.
Bibtex Entry
@InProceedings{vts,
author = "Karthikeyan Bhargavan and Carl A. Gunter and Elsa L. Gunter
and Michael Jackson and Davor Obradovic and Pamela Zave",
title = "The {Village Telephone System}: A Case Study in Formal
Software Engineering",
booktitle = "Theorem Proving in Higher Order Logics 11th International
Conference {TPHOLs} '98",
year = 1998,
month = "September",
editor = "Jim Grundy and Malcolm Newey",
address = {Canberra, Australia},
series = "Lecture Notes in Computer Science",
volume = 1479,
pages = "49-66",
publisher = "Springer"}
Postscript version of paper
Back to
bibliography
Elsa Gunter