A theory of interfaces and modules I-composition theorem

Author

Lam, Simon S. ; Shankar, A. Udaya

Author_Institution

Dept. of Comput. Sci., Texas Univ., Austin, TX, USA

Volume

20

Issue

1

fYear

1994

fDate

1/1/1994 12:00:00 AM

Firstpage

55

Lastpage

71

Abstract

We model a system as a directed acyclic graph where nodes represent modules and arcs represent interfaces. At the heart of our theory is a definition of what it means for a module to satisfy a set of interfaces as a service provider for some and as a service consumer for others. Our definition of interface satisfaction is designed to be separable; i.e., interfaces encode adequate information such that each module in a system can be designed and verified separately, and composable; i.e., we have proved a composition theorem for the system model in general

Keywords

directed graphs; formal specification; systems analysis; user interfaces; arcs; composition theorem; directed acyclic graph; interface satisfaction; interface theory; module design; module verification; modules; nodes; service consumer; service provider; specification; system design; system model; system modelling; Australia; Communication networks; Computer science; Heart; Routing protocols; Software engineering; Telecommunication network reliability; Transport protocols;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.263755

Filename

263755