Accession Number : ADA298854

Title :   Final Technical Report for Grant N00014-89-J-1064 (University of Massachusetts).

Descriptive Note : Final rept. 1 Oct 88-31 Jan 94,

Corporate Author : MASSACHUSETTS UNIV AMHERST

Personal Author(s) : Avrunin, George S. ; Wileden, Jack C.

PDF Url : ADA298854

Report Date : 1994

Pagination or Media Count : 6

Abstract : This project investigated the problem of analyzing concurrent and distributed systems, in order to determine whether they behave as intended by their developers. We explored analysis of both "logical" properties, such as freedom from deadlock or enforcement of mutually exclusive access to a resource, and timing properties, such as the time that can elapse between the occurrence of certain events in an execution of the system. Our work has focussed on the development of automated analysis techniques that could serve as the basis for practical tools to be used by developers of concurrent systems. The major difficulty in analyzing the behavior of concurrent systems is the combinatorial explosion in the number of possible states of the systems as the number of component processes increases. The approach taken in this project deals with the state space explosion by attempting to find strong necessary conditions, in the form of linear inequalities, for there to exist an execution of the concurrent system with a certain property and using standard integer programming techniques to determine whether these necessary conditions are consistent 3, 8. (References in this section refer to the publications listed in the next section. Additional references to earlier work, and the work of other investigators, can be found in those papers.) (KAR) p. 1

Descriptors :   *COMPUTER PROGRAMMING, *SYSTEMS ANALYSIS, LINEAR SYSTEMS, AUTOMATION, COMPARISON, INTEGER PROGRAMMING, PROTOTYPES, TIME, FORTRAN, UNIVERSITIES, COMBINATORIAL ANALYSIS, MASSACHUSETTS, INEQUALITIES.

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE