Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Constrained Expressions: Toward Broad Applicability of Analysis Methods for
 

Summary: Constrained Expressions: Toward Broad
Applicability of Analysis Methods for
Distributed Software Systems
LAURA K. DILLON
University of California, Santa Barbara
and
GEORGE S. AVRUNIN and JACK C. WILEDON
University of Massachusetts, Amherst
It is extremely difficult to characterize the possible behaviors of a distributed software system through
informal reasoning. Developers of distributed systems require tools that support formal reasoning
about properties of the behaviors of their systems. These tools should be applicable to designs and
other preimplementation descriptions of a system, as well as to completed programs. Furthermore,
they should not limit a developer's choice of development languages.
In this paper we present a basis for broadly applicable analysis methods for distributed software
systems. The constrained expression formalism can be used with a wide variety of distributed system
development notations to give a uniform closed-form representation of a system's behavior. A
collection of formal analysis techniques can then be applied with this representation to establish
properties of the system. Examples of these formal analysis techniques appear elsewhere. Here we
illustrate the broad applicability of the constrained expression formalism by showing how constrained
expression representations are obtained from descriptions of systems in three different notations:

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst

 

Collections: Mathematics