Abstract

Run-time assurance of a distributed system can be obtained by comparing, at run-time, the behavior of the program with the expected behavior described in the program's specification. Executable assertions, embedded into the program code, can determine when there are discrepancies, due to processor failures, between actual and expected behavior. Thus, there is no global monitoring scheme but processes will check each other.

A non-faulty process will always perform correct computation. It can detect errors in other processes after receiving information from them and checking it against expected values by using executable assertions. In order to efficiently check programs at run-time, we need to determine how many assertions need to be used, where they need to be located, and what they need to check to ensure that all occurring errors can be detected.

This paper introduces temporal subsumption to remove, from a given set of as­sertions for a specific program, the assertions which perform redundant checking. The remaining set of assertions is then the set necessary to provide run-time as­surance. To subsume assertions, the fl.ow graph of the program is examined using a graph traversal algorithm.

Department(s)

Computer Science

Comments

The first Author is a Graduate Student

This work was supported in part by the National Science Foundation under Grant Numbers MSS- 9216479 and CDA-9222827, and, in part, from the Air Force Office of Scientific Research under contract numbers F49620-92-J-0546 and F49620-93-I-0409 and, in part, by a grant from the University of Missouri Research Board.

Report Number

CSc-94-01

Document Type

Technical Report

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 1994 University of Missouri - Rolla, All rights reserved

Publication Date

6 January, 1994

Download

Share

 
COinS