Specifying and Proving Properties of Guardians for Distributed Systems
Name
AI_WP_172a.pdf
Description
Main article
Size
1.74 MB
Format
Adobe PDF
Checksum (MD5)
57eb6b251efcdd64e03b503f22336d43
Author(s)
Hewitt, Carl
Attardi, Giuseppe
Lieberman, Henry
Date Issued
May 1979
Publisher
MIT Artificial Intelligence Laboratory
Series/Report no.
MIT Artificial Intelligence Laboratory Working Papers, WP-172a
Abstract
In a distributed system where many processors are connected by a network and communicate using message passing, many users can be allowed to access the same facilities. A public utility is usually an expensive or limited resource whose use has to be regulated. A guardian is an abstraction that can be used to regulate the use of resources by scheduling their access, providing protection, and implementing recovery from hardware failures. We present a language construct called a primitive serializer which can be used to express efficient implementations of guardians in modular fashion. We have developed proof methodology for proving strong properties of network utilities e.g. the utility is guaranteed to respond to each request which it is sent. This proof methodology is illustrated by proving properties of a guardian which manages two hardcopy printing devices.
Description
This report describes research conducted at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-c-0522.
Persistent DSpace Link
