Search
Now showing items 1-10 of 60
A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis
(1979-01-01)
Automated Program Analysis is the process of discovering decompositions of a system into sub-units such that the behavior of the whole program can be inferred from the behavior of its parts. Analysis can be employed ...
Non-Monotonic Logic I
(1979-01-01)
"Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence ...
Dependency Directed Reasoning for Complex Program Understanding
(1979-04-01)
Artificial Intelligence research involves the creation of extremely complex programs which must possess the capability to introspect, learn, and improve their expertise. Any truly intelligent program must be able to ...
A Fair Power Domain for Actor Computations
(MIT Artificial Intelligence Laboratory, 1979-06)
Actor-based languages feature extreme concurrency, allow side effects, and specify a form of fairness which permits unbounded nondeterminism. This makes it difficult to provide a satisfactory mathematical foundation for ...
Towards a Better Definition of Transactions
(MIT Artificial Intelligence Laboratory, 1979-05)
This paper builds on a technical report written by Carl Hewitt and Henry Baker called "Actors and Continuous Functionals". What is called a "goal-oriented activity" in that paper will be referred to in this paper as a ...
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 ...
Evolutionary Programming with the Aid of A Programmers' Apprentice
(MIT Artificial Intelligence Laboratory, 1979-05)
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 ...
Concurrent Systems Need Both Sequences And Serializers
(MIT Artificial Intelligence Laboratory, 1979-02)
Contemporary concurrent programming languages fall roughly into two classes. Languages in the first class support the notion of a sequence of values and some kind of pipelining operation over the sequence of values. Languages ...
Global Time in Actor Computations
(MIT Artificial Intelligence Laboratory, 1979-06)