Search
Now showing items 31-39 of 39
Specifying and Proving Properties of Guardians for Distributed Systems
(1979-06-01)
In a distributed system where many processors are connected by a networ and communicate using message passing, many users can be allowed to access the same facilities. A public utility is usually an expensive or limited ...
Preliminary Design of the APIARY for VLSI Support of Knowledge-Based Systems
(MIT Artificial Intelligence Laboratory, 1979-06)
Knowledge-based applications will require vastly increased computational resources to achieve their goals. We are working on the development of a VLSI Message Passing Architecture to meet this need. As a first step we ...
Guardians for Concurrent Systems
(MIT Artificial Intelligence Laboratory, 1980-12)
In this paper we survey the current state of the art on fundamental aspects of concurrent systems. We discuss the notion of concurrency and discuss a model of computation which unifies the lambda calculus model and the ...
Security and Modularity in Message Passing
(MIT Artificial Intelligence Laboratory, 1979-02)
This paper addresses theoretical issues involved for the implementation of security and modularity in concurrent systems. It explicates the theory behind a mechanism for safely delegating messages to shared handlers in ...
The Incremental Garbage Collection Processes
(1977-12-01)
This paper investigates some problems associated with an expression evaluation order that we call "future" order, which is different from call-by-name, call-by-value, and call-by-need. In future order evaluation, an ...
A Session with TINKER: Interleaving Program Testing with Program Design
(1980-09-01)
Tinker is an experimental interactive programming system which integrates program testing with program design. New procedures are created by working out the steps of the procedure in concrete situations. Tinker displays ...
Using Message Passing Instead of the GOTO Construct
(MIT Artificial Intelligence Laboratory, 1978-04)
This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems ...
Foundations for Office Semantics
(1982-07)
In this paper we develop the semantics of work in the office in terms of the concepts of application structure and organizational structure of the office. Application structure is concerned with the rules and constraints ...
Functional Abstraction in LISP and PLANNER
(1968-01-01)
Presented here is part of the graduate work that I am doing in the much broader area of protocol analysis (see A.I. memo 137). The goal of the function abstraction is to find a procedure that satisfies a given set of ...