TR-262 ``High Level VAL Constructs in a Data Flow Machine'' by Kenneth Wayne Todd, February 1981. The Dennis-Misunas Form 1 Data Flow Machine can best be described as a static and scalar machine. Despite these two limiting characteristics it is still possible to translate the whole of the functional programming language VAL into the base language of this machine. Methods for translating the various high level construucts of VAL are presented which exploit the parallelism inherent in programs written in VAL mainly by pipeling through s dingle expression (vertical parallelism) rather than employing many copies of that same expression (horizontal parallelism), although the latter is not ruled out. These methods are tested by translating two different versions of a vector dot product algorithm, and the results obtained from running these translations on an interpreter are analyzed. TR-261 ``Preliminary Analysis of a Breadth-First Parsing Algorithm: Theoretical and Experimental Results'' by W.A. Martin, K. Church and R.S. Patil, June 1981. TR-260 ``Nested Transactions: An Approach to Reliable Distributed Computing'' by J. Eliot B. Moss (Ph.D. dissertation), April 1981, $4.00. This report addresses the issue of providing software for reliable distributed systems. In particular, we examine how to program a system so that the software continues to work in the face of a variety of failures of parts of the system. The design presented uses the concept of transactions: collections of primitive actions that are indivisible. The indivisibility of transactions insures that consistent results are obtained even when requests are processed concurrently or failures occur during a request. Our design permists transactions to be nested. Nested transactions provide nested universes of synchronization and recovery from failures. The advantages of nested transactions over single-level transactions are that they provide concurrency control within transactions by serializing subtransansactions appropriately, and they they permit parts of a transaction to fail without necessarily aborting the entire transaction. The method for implementing nested transactions described in this report is novel in that it uses locking for concurrency control. We present the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system. While the design has not been implemented, it has been simulated. TR-259 ``A Switch-Level Simulation Model for Integrated Logic Circuits'' by Randal E. Bryant (Ph.D. dissertation), March 1981, $4.50. The switch-level model describes the logical behavior of digital integrated circuits implemented in metal oxide semiconductor (MOS) technology. A network in this model consists of a set of nodes connected by transistor "switches." Many aspects of MOS circuits can be described which cannot be expressed in the Boolean logic gate model, such as bidirectional pass transistors, dynamic storage, and charge sharing. Furthermore, the logic network can be extracted directly from the mask specification of a circuit by a relatively straightforward computer program. Unlike analog circuit models, however, the nodes in a switch-level network assume discrete logic states 0, 1, and X (for unknown), and the transistors assume discrete states "open," "closed," and "unknown." This model can form the basis of a logic simulator for MOS circuits with performance comparable to logic gate simulators. This dissertation presents a rigorous development of the switch-level model and several simulation algorithms. TR-258 ``A Design Methodology for Self-Timed Systems'' by Narinder P. Singh (S.M. thesis), February 1981, $3.00. This thesis presents a design methodology for self-timed systems which will be extremely attractive for implementing systems in VLSI. Self-timed systems are characterized by the absence of a timing reference to which all operations are synchronized. The methodology proposed in this thesis defines a set of modules which form the building blocks for implementing an arbitrary self-timed system. The various module types are based on familiar programming constructs such as iterations, conditionals and constructs that aid in the activation and synchronization of parallel processes, such as, forking and joining. The modules of a self-timed system communicate with each other via an asynchronous communication protocol, and the correct behavior of the system is independent of the delays in the communication medium. This methodology simplifies the design effort by restricting the timing constraints to be local to the modules of the system. TR-257 ``Application of Data Flow Architecture to Computer Music Synthesis'' by Carol A. Cesari (S.B./S.M. thesis), February 1981, $3.50. This thesis presents a proposed computer synthesis system that includes a data flow machine, a computer whose architecture is highly parallel. The Music-11 synthesis system at MIT was used as a model in its design. An analysis of the algorithms used in the sample conversion process and how it would run on the data flow machine is presented. An example of how a composition would be described in a synthesis language and how it would run on the proposed system is given. TR-256 ``Semiautomatic Translation of COBOL into HIBOL'' by G.G. Faust (S.M. Thesis), April 1981, $3.00. This paper discusses in detail how an analyzed plan for a COBOL program can be translated into a HIBOL program. It is currently possible to translate into HIBOL analyzed plans for a relatively small (but well defined) subset of COBOL programs. Suggestions are made as to how that subset could be expanded through further research. TR-255 ``Protecting Externally Supplied Software in Small Computers'' by S. Kent (Ph.D. Dissertation), March 1981, $4.50. This thesis employs two tools to achieve the security requirements of vendors of external software: tamper-resistant modules (TRMs) and cryptographic techniques. TR-254 ``A Very High Level Language for Business Data Processing'' by G. Ruth, S. Alter and W. Martin, March 1981, $7.50. The focus of this report is an on-going research effort whose basic purpose is to produce fundamental improvements in the software technology relevant to business applications systems. The basic philosophy of this research is that the system development process can be significantly expedited by the further automation of its part. We give a history of applications systems technology and show how it can be expected to evolve in the future. TR-253 ``An Integrated Approach to Formatted Document Production'' by R. Ilson (S.M. Thesis), February 1981, $2.00. Recent advances in printing technology have reduced the cost of typeset quality printers. Unfortunately, the production of attractively formatted documents requires typographic skill and special training on computer-based text processing systems. In response to this situation, we have developed the Etude text processing system. The principal characteristics of Etude are that it embodies substantial typographic expertise, and is based on concepts familiar to untrained users. Furthermore, Etude provides a real-time display facility that allows the results of editing and formatting operations to be seen immediately. Thus, Etude supports the entire process of producing decorously formatted documents. TR-252 ``Recovery of the Swallow Repository'' by G.C. Arens (S.M. Thesis), Jan. 1981, AD A096-374, $2.25. This thesis presents the design of a set of recovery mechanisms for the Swallow repository. The Swallow repository is a data storage server that keeps permanent data in write-once stable storage such as optical disk. TR-251 ``Producing Explanations and Justifications of Expert Consulting Programs'' by W.R. Swartout (Ph.D. Dissertation), Jan. 1981, $2.25. TR-250 ``Fault Tolerance in Packet Communication Computer Architectures'' by C.K.C. Leung (Ph.D. Dissertation), Dec. 1980, $3.00. In this thesis we show how to tolerate hardware failures in a self-timed hardware system with a packet communication architecture, designed to execute parallel programs organized by data flow concepts. TR-249 ``Computers and People: Personal Computation'' by S. Turkle, Dec. 1980, $1.00. TR-248 ``Algorithms for Integrated Circuit Layout: An Analytic Approach'' by A.S. LaPaugh (Ph.D. Dissertation), Nov. 1980, $3.00. In this thesis, the problem of designing the layout of integrated circuits is examined. We examine problems encountered in layout design from the point of view of complexity theory. The analysis of heuristic algorithms for NP-complete problems is discussed, and the analysis of one common algorithm is presented. TR-247 ``Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables, and Label Variables'' by W.E.Weihl (S.B.& S.M. Thesis) Oct. 1980, $1.25. TR-246 ``A Survey of the Logic of Effective Definitions'' by J.Tiuryn, Oct. 1980, $1.25. LED, the Logic of Effective Definitions, is an extension of first order predicate calculus used for making assertions about programs. Programs are modeled as effective definitional schemes (following Friedman). Logical properties of LED and its relations to classical logics and other programming logics are surveyed. TR-245 ``On Memory Limitations in Natural Language Processing'' by K.W.Church (S.M.Thesis) Sept. 1980, $2.75. This paper proposes a welcome hypothesis: a computationally simple device is sufficient for processing natural language. We will propose two performance limitations, bounded memory and deterministic control, which have been incorporated in a new parser YAP. TR-244 ``Data Driven Loops'' by G.R. Ruth, August 1980, $2.00. The notion of the data driven loop arises in connection with our work in the Very High Level Language HIBOL and the automatic programming system (ProtoSystem I) that supports it. Although the concept is of general interest outside of VHLL's and automatic programming, we find it profitable to use HIBOL as a vechile for our discussion and a means of narrowing the scope of our discussion. Therefore, we first present a brief description of the domain which HIBOL treats. *TR-243 ``Management of Object Histories in the Swallow Repository'' by L.Svobodova, August 1980, AD A089-836. TR-242 ``Simulations Among Multidimensional Turing Machines'' by M.C. Loui (Ph.D. Dissertation), August 1980, $1.00. This thesis presents three independent papers: nearly optimal on-line simulations among multidimensional Turing machines, a space bound for one-tape multidimensional Turing machines, and new proofs in the pebble game. TR-241 ``Representation and Analysis of Real-Time Control Structures'' by R.F. Archer, Jr. (S.M. Thesis), August 1980, AD A089-828, $2.00. A new notation is introduced for representing real-time scheduling at the task and event level. TR-240 ``Safety and Optimization Transformations for Data Flow Programs'' by L. Montz (S.M. Thesis), July 1980, $1.50. This thesis explores the translation of a subset of the high level languages VAL to data flow graphs. TR-239 ``Artwork Analysis Tools for VLSI Circuits'' by C.M. Baker (S.M. & E.E. Thesis), June 1980, AD A087-040, $1.50. Current methods of designing VLSI chips do not insure that the chips will perform correctly when manufactured. Because the turnaround time on chip fabrication varies from a few weeks to a few months, a scheme other than "try it and see if it works" is needed. Checking of chips by hand simulation and visual inspection of checkplots will not catch all of the errors. A series of programs that use the actual mask descriptors for input are described. TR-238 ``The Complexity of Monotone Boolean Functions and an Algorithm for Finding Shortest Paths in a Graph'' by P.A. Bloniarz (Ph.D. Dissertation), June 1980, $4.25. The first part of this thesis considers the complexity of Boolean functions. The second part of this thesis describes an algorithm for computing shortest paths in a graph. TR-237 ``Towards a Theory for Abstract Data Types'' by D. Kapur (Ph.D. Dissertation), June 1980, AD A085-877, $4.00. A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data type taken in programming languages, and supports hierarchical and modular structure among data types. TR-236 ``Scheduling Task Systems with Resources'' by E.L. Lloyd (Ph.D. Dissertation), May 1980, $2.25. TR-235 ``A Concept of Independence with Applications in Various Fields of Mathematics'' by L.A. Levin, May 1980, $1.00. We use Kolmogorov's algorithmic approach to information theory to define a concept of independence of sequences, or equivalently, the boundedness of their mutual information. This concept is applied to probability theory, intuitionistic logic, and the theory of algorithms. For each case, we study the advantage of accepting the postulate that the objects studied by the theory are independent of any sequence determined by a mathematical property. TR-234 ``Transmitting Abstract Values in Messages'' by M.P. Herlihy (S.M. Thesis), May 1980, AD A086-984, $2.00. This thesis develops primitives for a programming language intended for use in a distributed computer system where individual nodes may have different hardware or software configurations. TR-233 ``Automatic Extension of an Augmented Transition Network Grammar for Morse Code Conversations'' by G.E. Kaiser, (S.B. Thesis), April 1980, AD A084-411, $1.75. This report describes a 'learning program' that acquires much of the knowledge required by a parsing system that processes conversations in a 'natural' language akin to ham-radio jargon. This report relates the mechanisms used by the learning program to grammatical inference of context-sensitive languages, which include the natural languages, and some proposed linguistic models of human language acquisition. *TR-232 ``The Architecture of an Object Based Personal Computer'' by A.W. Luniewski (Ph.D. Dissertation), March 1980, AD A083-433. TR-231 ``Parallel Computation: Synchronization, Scheduling, and Schemes'' by J.M.Jaffe (Ph.D.Dissertation) March 1980, $4.00. TR-230 ``The Complexity of the Maximum Network Flow Problem'' by A.E.Baratz (S.M.Thesis) March 1980, $l.00. This thesis deals with the computational complexity of the maximum network flow problem. TR-229 ``Automatic Verification of Serializers'' by R.R. Atkinson (Ph.D. Dissertation), March 1980, AD A082-885, $3.50. This thesis is concerned with the problem of controlling concurrent access to shared data. A language construct is proposed to enforce such control; a specification language is defined to describe the formal requirements of such control; and verification techniques are given to prove that instances of the construct satisfy their specifications. *TR-228 ``An Abstract Implementation for a Generalized Data Flow Language'' by K. Weng (Ph.D. Dissertation), Jan. 1980. *TR-227 ``Incomprehensible Computer Systems: Knowledge Without Wisdom'' by R.L. Rosenberg (S.M. Thesis), Jan. 1980. *TR-226 ``The Event Based Language and Its Multiple Processor Implementations'' by A. Reuveni (Ph.D. Dissertation), Jan. 1980, AD A081-950. TR-225 ``CLU Reference Manual'' by B.Liskov, R.Atkinson, T.Bloom, E.Moss, C.Schaffert, B.Scheifler and A.Snyder, Oct. 1979, AD A077-018, $3.00. This document serves both as an introduction to CLU and as a language reference manual. Sections 1 through 4 present an overview of the language. These sections highlight the essential features of CLU, and discuss how CLU differs from other, more conventional, languages. Sections 5 through 13 form the reference manual proper. These sections describe each aspect of CLU in detail, and discuss the proper use of various features. Appendices 1 through III provide concise summaries of CLU's syntax, data types, and I/O facilities. Appendix IV contains example programs. *TR-224 ``Data-Structuring Operations in Concurrent Computations'' by D.L. Isaman (Ph.D. Dissertation), Oct. 1979. TR-223 ``Toward a Computational Theory of Indirect Speech Acts'' by G.P. Brown, Oct. 1979, AD A077-065, $3.25. TR-222 ``Reference Tree Networks: Virtual Machine and Implementation'' by R.H. Halstead, Jr. (Ph.D. Dissertation), Sept. 1979, AD A076-570, $4.00. TR-221 ``Abstract Model Specifications for Data Abstractions'' by V.A. Berzins (Ph.D. Dissertation), July 1979, $3.00. TR-220 ``Denotational Semantics of Determinate and Non-determinate Data Flow Programs'' by P.R. Kosinski (Ph.D. Dissertation), July 1979, $2.00. TR-219 ``Copying Complex Structures in a Distributed System'' by K.R. Sollins (S.M. Thesis), July 1979, AD A072-441, $2.00. TR-218 ``VAL--A Value-Oriented Algorithmic Language, Preliminary Reference Manual'' by W.B. Ackerman and J.B. Dennis, June 1979, AD A072-394, $1.50. TR-217 ``Storage and Access Costs for Implementations of Variable-Length Lists'' by D.J. Brown (Ph.D. Dissertation), June 1979, $3.50. TR-216 ``Analysis of the SIMPLE Code for the Dataflow Computation'' by J.M. Myers, June 1979, $2.50. TR-215 ``Distributed Computer Systems: Structure and Semantics'' by L.Svobodova, B.Liskov and D.Clark, April 1979, AD A070-286, $1.25. This report describes an ongoing project in the area of design of distributed systems. The report presents a conceptual model of distributed computation, and, in the context of this model, discusses our approaches to inter-node communication and cooperation, reliability, and protection. The report concludes with some examples of the language constructs and an outline of the future research under this project. TR-214 ``A Semantic Data Base Model and Its Associated Structured User Interface'' by D. McLeod (Ph.D. Dissertation), March 1979, AD A068-112, $7.00. TR-213 ``Probabilistic Algorithms in Finite Fields'' by M.O. Rabin, March 1979, $1.00. We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial, and factoring a polynomial into its irreducible factors over a finite field. TR-212 ``Digitalized Signatures and Public-Key Functions as Intractable as Factorization'' by M.O. Rabin, March 1979, $1.00. TR-211 ``Synchronization Mechanisms for Modular Programming Languages'' by T. Bloom (S.M. Thesis), April 1979, AD A069-819, $2.00. TR-210 ``Serializability of Concurrent Database Updates'' by C.H. Papadimitriou, March 1979, $1.25. *TR-209 ``A Machine Architecture to Support an Object-Oriented Language'' by A. Snyder (Ph.D. Dissertation), March 1979, AD A068-111. TR-208 ``A Minicomputer Network Simulation System'' by B.C. Krizan (S.B. & S.M. Thesis), Feb. 1979, $2.50. TR-207 ``Robust Concurrency Control for a Distributed Information System'' by W.A. Montgomery (Ph.D. Dissertation), Jan. 1979, AD A066-996, $3.50. TR-206 ``Equivalence Properties of Semantic Data Models for Database Systems'' by S.A.Borkin (Ph.D.Dissertation) Jan.1979, AD A066-386, $5.00. This thesis explores the problems of data model equivalence which arise in shared and distributed database systems. A formal approach is followed. Two semantic data models, the semantic relation data model and the semantic graph data model, are defined and proved equivalent. TR-205 ``Naming and Synchronization in a Decentralized Computer Systems'' by D.P. Reed (Ph.D. Dissertation), Oct. 1978, AD A061-407, $2.50. In this dissertation, a new approach to the synchronization of accesses to shared data objects is developed. In the system developed here, called NAMOS, versions have two component names consisting of the name of an object and a pseudo-time, the name of the system state to which the version belongs. By giving programs control over the pseudo-time in which an access is made, synchronization of accesses to multiple objects is simplified. TR-204 ``Real-Time Control Structures for Block Diagram Schemata'' by T. J. Teixeira (S.M.Thesis) August 1978, AD A061-122, $1.50. This research investigates several strategies for synthesizing control structures to satisfy the external real-time specifications. Some of the issues involved with multiple processor control structures are discussed, although no specific algorithms are investigated. TR-203 ``Synthesis of Synchronization Code for Data Abstractions'' by M. S. Laventhal (Ph.D.Dissertation) July 1978, AD A058-232, $4.00. This thesis explores an approach in which a synchronization property can be specified in a high-level nonprocedural language and an implementation for the specified property can be synthesized algorithmically. *TR-202 ``A Formalization of the State Machine Specification Technique'' by R. N. Principato, Jr. (S.M.& E.E.Thesis) July 1978. TR-201 ``A Denotational Semantics of CLU'' by R. W. Scheifler (S.M.Thesis) June 1978, $2.75. TR-200 ``Logics of Programs: Axiomatics and Descriptive Power'' by D. Harel (Ph.D.Dissertation) May 1978, $2.50. *TR-199 ``The Specification of Code Generation Algorithms'' by C. J. Terman (S.M.Thesis) April 1978, AD A054-301. TR-198 ``Multiple-Processor Implementations of Message-Passing Systems'' by R. H. Halstead, Jr. (S.M.Thesis) April 1978, AD A054-009, $2.75. The goal of this thesis is to develop a methodology for building networks of small computers capable of the same tasks now performed by single larger computers. Such networks promise to be both easier to scale and more economical in many instances. *TR-197 ``Actor Systems for Real-Time Computation'' by H.G. Baker, Jr. (Ph.D. Dissertation), March 1978, AD A053-328. *TR-196 ``Final Report of the Multics Kernel Design Project'' by M. Schroeder, D. Clark, J. Saltzer and D. Wells, March 1978. TR-195 ``On Time-Space Classes and Their Relation to the Theory of Real Addition'' by A. R. Bruss (S.M.Thesis) March 1978, $1.00. *TR-194 ``Actors and Continuous Functionals'' by C. Hewitt and H. Baker, Jr., Feb. 1978, AD A052-266. TR-193 ``A Formal Definition of CLU'' by J. C. Schaffert (S.M.Thesis) Jan. 1978, $3.00. This thesis develops a new language definition methodology that overcomes certain limitations of existing techniques, including the problems arising from shared variables. TR-192 ``Attribute Partitioning in a Self-Adaptive Relational Database System'' by B. Niamir (S.M.Thesis) Jan. 1978, AD A053-292, $2.50. TR-191 ``Specification and Verification Techniques for Parallel Programs Based on Message Passing Semantics'' by A. Yonezawa (Ph.D.Dissertation) Jan. 1978, AD A051-149, $3.75. This thesis presents formal specification and verification techniques for both serial and parallel programs written in SIMULA-like object oriented languages. TR-190 ``Abstract Data Types in Stack Based Languages'' by J. E. B. Moss (S.M.Thesis) Feb. 1978, AD A052-332, $2.50. TR-189 ``Formal Specifications for Packet Communication Systems'' by D. J. Ellis (Ph.D.Dissertation) Nov. 1977, AD A048-380, $2.50. TR-188 ``Simulation of Packet Communication Architecture Computer Systems'' by R. E. Bryant (S.M.Thesis) Nov. 1977, AD A048-290, $2.50. *TR-187 ``A Program Writer'' by W.J. Long (Ph.D. Dissertation), November 1977, AD A047-595. TR-186 ``A Structure Memory for Data Flow Computers'' by W. B. Ackerman (S.M.Thesis) Sept. 1977, AD A047-026, $2.50. TR-185 ``Deadlock Detection in Computer Networks'' by B. Goldman (S.B.& S.M.Thesis) Sept. 1977, AD A047-025, $3.00. In this thesis, two published algorithms dealing with deadlock detection in computer networks are discussed and examples demonstrating the failure of these algorithms are given. *TR-184 ``Facilitating Interprocess Communication in a Heterogeneous Network Environment'' by P.H. Levine (S.B. & S.M. Thesis), July 1977, AD A043-901. TR-183 ``Semilinear Sets and Applications'' by J. M. Jaffe (S.M.Thesis) July 1977, $2.00. TR-182 ``A Framework for Processing Dialogue'' by G. P. Brown, June 1977, AD A042-370, $2.50. TR-181 ``The Complexity of the Finite Containment Problem for Petri Nets'' by E. W. Mayr (S.M.Thesis) June 1977, $2.00. TR-180 ``A Simple and Flexible System Initialization Mechanism'' by A. W. Luniewski (S.M.& E.E.Thesis) May 1977, $2.50. TR-179 ``Non-Discretionary Access Control for Decentralized Computing Systems'' by P. A. Karger (S.M.Thesis) May 1977, AD A040-804, $3.00. *TR-178 ``Computer Systems with a Very Large Address Space and Garbage Collection'' by P. B. Bishop (Ph.D.Dissertation) May 1977, AD A040-601. *TR-177 ``A Layered Virtual Memory Manager'' by A. H. Mason (S.M.& E.E.Thesis) May 1977. TR-176 ``A Digitalis Therapy Advisor with Explanations'' by W. R. Swartout (S.M.Thesis) Feb. 1977, $2.00. TR-175 ``A Robust Environment for Program Development'' by H.J. Goldberg (S.M. Thesis), Feb. 1977, $2.00. This thesis examines the problems of debugging and preservation of the user programming environment and proposes a scheme by which the program development environment can be protected. TR-174 ``A Case Study of Intermodule Dependencies in a Virtual Memory Subsystem'' by D. H. Hunt (S.M.& E.E.Thesis) Dec. 1976, $2.50. TR-173 ``Coordination of Parallel Processes in the Actor Model of Computation'' by N. Goodman (S.M.Thesis) Dec. 1976, $2.00. Two algorithms for the mutual exclusion problem are described and proven to operate correctly. TR-172 ``The Reformulation Model of Expertise'' by W. S. Mark (Ph.D.Dissertation) Dec. 1976, AD A035-397, $4.25. This research develops a methodology for implementing a class of expert problem-solving programs which must create models of the problems they are given before they can apply their expert knowledge to those problems. TR-171 ``A Multi-Process Design of Paging System'' by A. R. Huber (S.M.& E.E.Thesis) Dec. 1976, $2.50. TR-170 ``The Logic of Systems'' by F. C. Furtek (Ph.D.Dissertation) Dec. 1976, $3.25. TR-169 ``Diagnostic Planning and Cancer Management'' by C. Safran, J. F. Desforges and P. N. Tsichlis, Sept. 1976, $2.00. This report describes a computer system for evaluating patients with Hodgkins disease. This system uses decision theoretic techniques to aid in the formulation of a diagnostic plan for the cancer patient. TR-168 ``Semantical Considerations on Floyd-Hoare Logic'' by V. R. Pratt, Sept. 1976, $1.50. This paper deals with logics of programs. The objective is to formalize a notion of program description and to give both plausible (semantic) and effective (syntactic) criteria for the notion of truth of a description. *TR-167 ``Using Type Extension to Organize Virtual Memory Mechanisms'' by P. A. Janson (Ph.D.Dissertation) Sept. 1976. TR-166 ``Index Selection in a Self-Adaptive Relational Data Base Management System'' by A. Y. Chan (S.M.Thesis) Sept. 1976, AD A034-185, $2.00. In this thesis, we attempt to develop a methodology for monitoring the developing pattern of access to a data base and for choosing near-optimal physical data base organizations based on the evidenced mode of use. TR-165 ``High Level Expression of Semantic Integrity Specifications in a Relational Data Base System'' by D. J. McLeod (S.M.Thesis) Sept. 1976, AD A034-184, $2.50. The semantic integrity of a data base is said to be violated when the data base ceases to represent a legitimate configuration of the application environment it is intended to model. In the context of the relational data model, it is possible to identify multiple levels of semantic integrity information. TR-164 ``Processor Multiplexing in a Layered Operating System'' by D. P. Reed (S.M.Thesis) July 1976, $4.00. This thesis presents a simply structured design for the implementation of process in a kernel-structured operating system. The design provides a minimal mechanism for the support of two distinct classes of processes found in the computer system - those which are part of the kernel operating system itself, and those used to execute user-specified computations. *TR-163 ``A Secure and Flexible Model of Process Initiation for a Computer Utility'' by W.A.Montgomery (S.M.& E.E.Thesis) June 1976. TR-162 ``Encryption-Based Protection Protocols for Interactive User-Computer Communication'' by S. T. Kent (S.M.Thesis) June 1976, AD A026-911, $2.50. This thesis develops a complete set of protocols, which utilize a block cipher, e.g., the NBS data encryption standard, for protecting interactive user-computer communication over physically unsecured channels. The thesis presents designs for modules to implement the protocols, both in the terminal and in a host computer system, and discusses the results of a test implementation of the modules on Multics. *TR-161 ``Decidability Questions for Petri Nets'' by M. Hack (Ph.D.Dissertation) June 1976. TR-160 ``A Program for the Design of Procurement Systems'' by M. Bosyj (S.M.Thesis) May 1976, AD A026-688, $3.00. This thesis describes a prototype version of such a system. PROCTOR is a program that assists in the design of a hierarchical planning and control system for a procurement firm. *TR-159 ``Petri Net Languages'' by M. Hack, March 1976. TR-158 ``Some Data-base Applications of Constraint Expressions'' by R. W. Grossman (S.M.Thesis) Feb. 1976, AD A024-149, $3.00. This report presents a novel network-like representation for information, called "constraint expressions" (CE). CE makes use of some of the knowledge-representation techniques developed by A.I. research. *TR-157 ``A Preliminary Study in Computer-Aided Legal Analysis'' by J. A. Meldman (Ph.D.Dissertation) Nov. 1975, AD A018-997. TR-156 ``Minimizing the Naming Facilities Requiring Protection in a Computer Utility'' by R. G. Bratt (S.M.Thesis) Sept. 1975, $2.50. This thesis examines the various mechanisms for naming the information objects stored in a general-purpose computing utility and isolated a basic set of naming facilities that must be protected to assure complete control over user interaction and that allow desired interactions among users to occur in a natural way. *TR-155 ``Mechanization of Temporal Knowledge'' by K. M. Kahn (S.M.Thesis) Sept. 1975. TR-154 ``Semantics of Communicating Parallel Processes'' by I. Greif (Ph.D.Dissertation) Sept. 1975, AD A016-302, $3.00. The thesis of this dissertation is that an understanding of the ordering constraints that are introduced among events of parallel process is essential to the understanding of synchronization and that therefore any language for specifying synchronization of parallel process should be based on a theory of such orderings. TR-153 ``Strategy Selection in Medical Diagnosis'' by P. B. Miller (S.M.Thesis) Sept. 1975, $2.50. TR-152 ``Equivalence Problems for Monadic Schemas'' by J.E. Qualitz (Ph.D. Dissertation), June 1975, AD A012-823, $3.00. *TR-151 ``Automatic Test, Configuration and Repair of Cellular Arrays'' by F.B. Manning (Ph.D. Dissertation), June 1975, AD A012-822. *TR-150 ``A Parallel Asynchronous Computer Architecture for Data Flow Programs'' by J.E. Rumbaugh (Ph.D. Dissertation), May 1975, AD A010-918. *TR-149 ``A Portable Compiler for the Language C'' by A. Snyder (S.B. & S.M. Thesis), May 1975, AD A010-218. TR-148 ``Program Restructuring for Virtual Memory Systems'' by J. Johnson (Ph.D. Dissertation), March 1975, AD A009-218, $3.00. The problem area addressed in this report is program restructuring, a method of reordering the relocatable sectors of a program in its address space to increase the locality of the programs reference behavior, thereby reducing the number of page fetches required for its execution in a virtual memory system. TR-147 ``A Formalization and Correctness Proof of the CGOL Language System'' by M.L. Van De Vanter (S.M. Thesis), March 1975, $2.00. We present an alternative meta-language based on the work of Pratt which retains much of the effective power of BNF but is more convenient for designer, implementer and user alike. TR-146 ``Design Criteria for a Knowledge-Based English Language System for Management: An Experimental Analysis'' by A. Malhotra (Ph.D.Dissertation) Feb. 1975, $6.00. *TR-145 ``The Binding Model: A Semantic Base for Modular Programming Systems'' by D.A. Henderson (Ph.D. Dissertation), Feb. 1975, AD A006-961. TR-144 ``The Computational Complexity of Some Logical Theories'' by C. Rackoff (Ph.D.Dissertation) Feb. 1975, $2.50. The complexity of the theories of pairing functions is discussed and it is shown that no collection of pairing functions has an elementary recursive theory. TR-143 ``A Digitalis Therapy Advisor'' by H. Silverman (S.M.Thesis) Jan. 1975, $2.00. TR-142 ``Some Problems in German to English Machine Translation'' by G.P. Brown (S.M. & E.E. Thesis), Dec. 1974, AD A003-002, $3.00. TR-141 ``The BCPL Reference Manual'' by M. Richards, A. Evans and R. Mabee, Dec. 1974, AD A003-599, $2.00. BCPL is a language which is readable and easy to learn, as well as admitting of an efficient compiler capable of generating efficient code. It is made self consistent and easy to define accurately by an underlying structure based on a simple idealized object machine. TR-140 ``Naming and Protection in Extendible Operating Systems'' by D.D. Redell (Ph.D. Dissertation), Nov. 1974, AD A001-721, $3.00. TR-139 ``Some Upper and Lower Bounds on Decision Procedures in Logic'' by J. Ferrante (Ph.D. Dissertation), Nov. 1974, PB 238-121/AS, $3.00. TR-138 ``The Hensel Lemma in Algebraic Manipulation'' by D.Y.Y. Yun (Ph.D. Dissertation), Nov. 1974, AD A002-737, $3.00. TR-137 ``Nondeterministic Time and Space Complexity Classes'' by J.I. Seiferas (Ph.D. Dissertation), Sept. 1974, PB 236-777/AS, $2.50. TR-136 ``Functional Domains of Applicative Languages'' by S.A. Ward (Ph.D.Dissertation), Sept. 1974, AD 787-796, $2.50. TR-135 ``The Computer Control of Changing Pictures'' by G.F. Pfister (Ph.D. Dissertation), Sept. 1974, AD 787-795, $3.00. This document describes DALI (Display Algorithm Language Interpreter), a special-purpose programming language for the creation and control of changing pictures which exhibit complex static and dynamic interactions among their elements. *TR-134 ``Semantics of Data Structures and References'' by D.J. Ellis (S.M. & E.E. Thesis), August 1974, PB 236-594/AS. *TR-133 ``The Complexity of Decision Problems in Automata Theory and Logic'' by L.J. Stockmeyer (Ph.D. Dissertation), July 1974, PB 235-283/AS. TR-132 ``Removing the Dynamic Linker from the Security Kernel of a Computing Utility'' by P.A. Janson (S.M. Thesis), June 1974, AD 781-305, $2.00. *TR-131 ``Mathematical Logic for Computer Scientists'' by M. Levin, June 1974. TR-130 ``Analysis of Algorithm Implementations'' by C.R. Ruth (Ph.D. Dissertation), May 1974, AD 780-408, $3.00. TR-129 ``Using Interactive Graphics in Simulating the Hospital Emergency Room'' by R.W. Weissberg (S.M. Thesis), May 1974, AD 780-437, $2.00. TR-128 ``The Computer Utility as a Marketplace for Computer Services'' by R.M. Frankston (S.M. & E.E. Thesis), May 1974, AD 780-436, $2.00. TR-127 ``An Experimental Analysis of Program Reference Patterns in the Multics Virtual Memory'' by B.S. Greenberg (S.M. Thesis), May 1974, AD 780-407, $2.00. This thesis reports the design, conducting and the results of an experiment intended to measure the paging rate of a virtual memory computer system as a function of paging memory size. *TR-126 ``A Language Implementation System'' by V.E. Altman (S.B. & S.M. Thesis), May 1974, AD 780-672. TR-125 ``A Model-Debugging System'' by W.S. Mark (S.B. & S.M. Thesis), April 1974, AD 778-688, $2.00. TR-124 ``Verification of Programs Operating on Structured Data'' by M.S. Laventhal (S.B. & S.M. Thesis), March 1974, PB 231-365/AS, $2.00. TR-123 ``Introduction to Multics,'' Feb. 1974, AD 918-562, $2.00. *TR-122 ``Computer and Data Security: A Comprehensive Annotated Bibliography'' by J.A. Scherf (S.M. Thesis), Jan. 1974, AD 775-546. TR-121 ``On Lower Bounds for Selection Problems'' by F.F. Yao (Ph.D. Dissertation), March 1974, PB 230-950/AS, $1.00. *TR-120 ``Analysis of Asynchronous Concurrent Systems by Timed Petri Nets'' by C. Ramchandani (Ph.D. Dissertation), Feb. 1974, AD 775-618. TR-119 ``A New Grammatical Transformation into Deterministic Top-Down Form'' by M.M. Hammer (Ph.D. Dissertation), Feb. 1974, AD 775-545, $3.00. A new transformation procedure is devised which is more powerful than currently available techniques and which preserves the compiling ability of the grammar. TR-118 ``An Abstract Model of a Research Institute: Simple Automatic Programming Approach'' by V. Briabrin, March 1974, PB 231-505/AS, $1.50. TR-117 ``An Input/Output Architecture for Virtual Memory Computer Systems'' by D.D. Clark (Ph.D. Dissertation), Jan. 1974, AD 774-738, $2.00. This thesis presents a design for an I/O subsystem architecture which, in the context of a segmented, paged, time-shared computer system, allows the user direct access to I/O devices. TR-116 ``Backup and Recovery of On-Line Information in a Computer Utility'' by J.A. Stern (S.M. & E.E. Thesis), Jan. 1974, AD 774-141, $2.00. This thesis describes a design for an automatic backup mechanism to be incorporated in a computer utility for the protection of on-line information against accidental or malicious destruction. TR-115 ``Making Computers Keep Secrets'' by L. Rotenberg (Ph.D. Dissertation), Feb. 1974, PB 229-352/AS, $4.00. This dissertation presents a unified design of protection mechanisms for a computer utility. The design includes specifications of both hardware and software protection mechanisms. TR-114 ``Packet Communication'' by R.M. Metcalfe (Ph.D. Dissertation), Dec. 1973, AD 771-430, $3.00. TR-113 ``On Reducibility Among Combinatorial Problems'' by P.P. Herrmann (S.M. Thesis), Dec. 1973, PB 226-157/AS, $1.50. *TR-112 ``Semantics of Data Base Systems'' by I.T. Hawryszkiewycz (Ph.D. Dissertation), Dec. 1973, PB 226-061/AS. *TR-111 ``Productivity in Parallel Computation Schemata'' by J.P. Linderman (Ph.D. Dissertation), Dec. 1973, PB 226-159/AS. TR-110 ``Complexity Classes of Recursive Functions'' by R. Moll (Ph.D. Dissertation), June 1973, AD 767-730, $2.00. TR-109 ``Near-Optimal Bin Packing Algorithms'' by D.S. Johnson (Ph.D. Dissertation), June 1973, PB 222-090, $4.00. TR-108 ``Mathematical Foundations of Formal Language Theory'' by M. Wand (Ph.D. Dissertation), Dec. 1973, $3.00. TR-107 ``Storage Hierarchy Systems'' by S.E. Madnick (Ph.D. Dissertation), April 1973, AD 760-001, $3.50. TR-106 ``The Emptiness and Complementation Problems for Automata on Infinite Trees'' by C.W. Rackoff (S.M. Thesis), Jan. 1973, AD 756-248, $1.00. TR-105 ``An Analysis of Sorting Networks'' by B.J. Smith (Sc.D. Thesis), Oct. 1972, AD 751-614, $3.00. TR-104 ``Cooperation of Mutually Suspicious Subsystems in a Computer Utility'' by M.D. Schroeder (Ph.D. Dissertation), Sept. 1972, AD 750-173, $2.00. *TR-103 ``Performance Evaluation of Multiprogrammed Time-Shared Computer Systems'' by A. Sekino (Ph.D. Dissertation), Sept. 1972, AD 749-949. TR-102 ``Finite Tree Automata and w-Automata'' by R.F. Hossley (S.M. Thesis), Sept. 1972, AD 749-367, $2.00. TR-101 ``On the Design and Specification of a Common Base Language'' by J.B. Dennis, June 1972, AD 744-207, $2.00. TR-100 ``Further Results on Hierarchies of Canonic Systems'' by R. Mandl (S.M.Thesis) June 1972, AD 744-206, $2.00. TR-99 ``Relativization of the Theory of Computational Complexity'' by N.A. Lynch (Ph.D. Dissertation), June 1972, AD 744-032, $2.00. TR-98 ``Bounds on Polynomial Evaluation Algorithms'' by L.J. Stockmeyer (S.M. Thesis), April 1972, AD 740-328, $1.00. TR-97 ``The Complexity of Finite Functions'' by B. Vilfan (Ph.D. Dissertation), March 1972, AD 739-678, $2.00. The topics covered are the length of formulas for finite functions, the order of cyclic perceptrons and pattern counting machines. TR-96 ``Autonomous, Synchronous Counters Constructed only of J-K Flip-Flops'' by F. Manning (S.M. Thesis), May 1972, AD 744-030, $2.00. *TR-95 ``Essays in Algebraic Simplification'' by R.J. Fateman (Ph.D. Dissertation), April 1972, AD 740-132. TR-94 ``Analysis of Production Schemata by Petri Nets'' by M.H. Hack (S.M. Thesis), Feb. 1972, AD 740-320, $2.00. TR-93 ``Induction in Proofs about Programs'' by I.G. Greif (S.M. Thesis), Feb. 1972, AD 737-701, $1.00. *TR-92 ``Evaluation of Definite Integrals by Symbolic Manipulation'' by P.S. Wang (Ph.D. Dissertation), Oct. 1971, AD 732-005. *TR-91 ``A Parallel Processing Model of Musical Structures'' by S.W. Smoliar (Ph.D. Dissertation), Sept. 1971, AD 731-690. TR-90 ``Cost Analysis of Debugging Systems'' by B.P. Lester (S.B. & S.M. Thesis), Sept. 1971, AD 730-521, $2.00. TR-89 ``Primary Access Control in Large-Scale Time-Shared Decision Systems'' by R.C. Owens (S.M. Thesis), July 1971, AD 728-036, $2.00. *TR-88 ``Bounds on Information Retrieval Efficiency in Static File Structures'' by T.A. Welch (Ph.D. Dissertation), June 1971, AD 725-429. TR-87 ``A Model for Process Representation and Synthesis'' by R.H. Thomas (Ph.D. Dissertation), June 1971, AD 726-049, $2.00. *TR-86 ``Dynamic Reconfiguration in a Modular Computer System'' by R.R. Schell (Ph.D. Dissertation), June 1971, AD 725-859. *TR-85 ``Automatic Creation of a Code Generator from a Machine Description'' by P.L. Miller (E.E. Thesis), May 1971, AD 724-730. *TR-84 ``Procedures as a Representation for Data in a Computer Program for Understanding Natural Language'' by T. Winograd (Ph.D. Dissertation), Feb. 1971, AD 721-399. *TR-83 ``In-Process Manufacturing Quality Control'' by D.E. Lewin (Ph.D. Dissertation), Jan. 1971, AD 720-098. *TR-82 ``Computer Analysis of Visual Properties of Curved Objects'' by L.J. Krakauer (Ph.D. Dissertation), May 1971, AD 723-647. *TR-81 ``Information Processing and Transmission in Cellular Automata'' by E.R. Banks (Ph.D. Dissertation), Jan. 1971, AD 717-951. TR-80 ``The Classroom Information and Computing Service'' by D.D. Clark, R.M. Graham, J.H. Saltzer and M.D. Schroeder, Jan. 1971, AD 717-857, $3.00. TR-79 ``Shape from Shading: A Method for Obtaining the Shape of a Smooth Opaque Object from One View'' by B.K. Horn (Ph.D. Dissertation), Nov. 1970, AD 717-336, $2.00. *TR-78 ``Design Strategies for File Systems'' by S.E. Madnick (S.M. Thesis), Oct. 1970, AD 714-269. TR-77 ``Complexity Measures for Language Recognition by Canonic Systems'' by J.P. Haggerty (S.M. Thesis), Oct. 1970, AD 715-134, $1.00. *TR-76 ``Learning Structural Description from Examples'' by P.H. Winston (Ph.D. Dissertation), Sept. 1970, AD 713-988. *TR-75 ``Deadlock-Free Sharing of Resources in Asynchronous Systems'' by P.G. Hebalkar (Sc.D. Thesis), Sept. 1970, AD 713-139. TR-74 ``Integral Convex Polyhedra and an Approach to Integralization'' by M. Edelberg (Ph.D. Dissertation), August 1970, AD 712-070, $2.00. This thesis provides some theoretical results concerning integral convex polyhedra and the process of integralization. *TR-73 ``Computer Recognition of Prismatic Solids'' by A.K. Griffith (Ph.D. Dissertation), August 1970, AD 712-069. *TR-72 ``Coordination of Asynchronous Events'' by S.S. Patil (Sc.D. Thesis), June 1970, AD 711-763. *TR-71 ``A Computer-Controlled Graphical Display Processor'' by J.G. Fiasconaro (S.M. Thesis), June 1970, AD 710-479. *TR-70 ``Generalized Organization of Large Data-Bases: A Set-Theoretic Approach to Relations'' by A.I. Fillat and L.A. Kraning (S.B. & S.M. Thesis), June 1970, AD 711-060. *TR-69 ``Hierarchical Associative Memories for Parallel Computation'' by J.L. Gertz (Ph.D. Dissertation), June 1970, AD 711-091. *TR-68 ``Economics of Scale in Computer Use: Initial Tests and Implications for the Computer Utility'' by L.L. Selwyn (Ph.D. Dissertation), June 1970, AD 710-011. *TR-67 ``Controlled Information Sharing in a Computer Utility'' by D.H. Vanderbilt (Ph.D. Dissertation), Oct. 1969, AD 699-503. *TR-66 ``Recognition of Topological Invariants by Iteractive Arrays'' by W.T. Beyer (Ph.D. Dissertation), Oct. 1969, AD 699-502. *TR-65 ``Practical Translators for LR(k) Languages'' by F.L. DeRemer (Ph.D. Dissertation), Oct. 1969, AD 699-501. *TR-64 ``A Graph Model for Parallel Computations'' by J.E. Rodriguez (Sc.D. Thesis), Sept. 1969, AD 697-759. *TR-63 ``Case Study in Interactive Graphics Programming: A Circuit Drawing and Editing Program for Use with a Storage-Tube Display Terminal'' by J. W. Brackett, M. Hammer and D. Thornhill, Oct. 1969, AD 699-930. *TR-62 ``EPS: An Interactive System for Solving Elliptic Boundary-Value Problems with Facilities for Data Manipulation and General-Purpose Computation'' by C.C. Tillman, June 1969, AD 692-462. *TR-61 ``Interactive Computer-Mediated Animation'' by R.M. Baecker (Ph.D. Dissertation), June 1969, AD 690-887. *TR-60 ``A Formal System for Defining the Syntax and Semantics of Computer Languages'' by H.F. Ledgard (Ph.D. Dissertation), April 1969, AD 689-305. *TR-59 ``Computer Recognition of Three-Dimensional Objects in a Visual Scene'' by A. Guzman (Ph.D. Dissertation), Dec. 1968, AD 692-200. *TR-58 ``A Simulator of Multiple Interactive Users to Drive a Time-Shared Computer System'' by H. J. Greenbaum (S.M.Thesis) Jan. 1969, AD 686-988. *TR-57 ``Lambda-Calculus Models of Programming Languages'' by J.H. Morris, Jr. (Ph.D. Dissertation), Dec. 1968, AD 683-394. *TR-56 ``An Integrated Hardware-Software System for Computer Graphics in Time-Sharing'' by D. E. Thornhill, R. H. Stotz, D. T. Ross and J. E. Ward, Dec. 1968, AD 685-202. *TR-55 ``Implementing Multi-Process Primitives in a Multiplexed Computer System'' by R. L. Rappaport (S.M.Thesis) Nov. 1968, AD 689-469. *TR-54 ``The Graphic Display as an Aid in the Monitoring of a Time-Shared Computer System'' by J.M. Grochow (S.M. Thesis), Oct. 1968, AD 689-468. *TR-53 ``The Flow Graph Schemata Model of Parallel Computation'' by D.R. Slutz (Ph.D. Dissertation), Sept. 1968, AD 683-393. TR-52 ``Absentee Computations in a Multiple-Access Computer System'' by H.M. Deitel (S.M. Thesis), August 1968, AD 684-738, $1.00. *TR-51 ``CARPS, a Program Which Solves Calculus Word Problems'' by E. Charniak (S.M. Thesis), July 1968, AD 673-670. *TR-50 ``Resource Allocation in Multiprocess Computer Systems'' by P.J. Denning (Ph.D. Dissertation), May 1968, AD 675-554. *TR-49 ``Asynchronous Computational Structures'' by F.L. Luconi (Ph.D. Dissertation), Feb. 1968, AD 677-602. *TR-48 ``Incremental Simulation on a Time-Shared Computer'' by M.M. Jones (Ph.D. Dissertation), Jan. 1968, AD 662-225. *TR-47 ``Symbolic Integration'' by J. Moses (Ph.D. Dissertation), Dec. l967, AD 662-666. *TR-46 ``A Canonic Translator'' by J.W. Alsop (S.B. Thesis), Nov. 1967, AD 663-503. *TR-45 ``On the Simulation of Dynamic Systems with Lumped Parameters and Time Delays'' by N. Leal-Cantu (S.M. Thesis), Oct. 1967, AD 663-502. *TR-44 ``A System for Computer-Aided Diagnosis'' by G.A. Gorry (Ph.D. Dissertation), Sept. 1967, AD 662-665. *TR-43 ``Program Analysis by Digital Computer'' by D.U. Wilde (Ph.D. Dissertation), August 1967, AD 662-224. *TR-42 ``Design and Implementation of a Table-Driven Compiler System'' by C.L. Liu, G.D. Chang and R.E. Marks, July 1967, AD 668-960. *TR-41 ``Surfaces for Computer-Aided Design of Space Forms'' by S.A. Coons, June 1967, AD 663-504. *TR-40 ``On-Line Analysis for Social Scientists'' by J.R. Miller, May 1967, AD 668-009. *TR-39 ``Syntax-Based Analytic Reading of Musical Scores'' by A. Forte, April 1967, AD 661-806. *TR-38 ``A Low-Cost Output Terminal for Time-Shared Computers'' by R. C. Rosenberg, D. W. Kennedy and R. A. Humphrey, March 1967, AD 662-027. *TR-37 ``Some Aspects of Pattern Recognition by Computer'' by A. Guzman-Arenas (S.M. Thesis), Feb. 1967, AD 656-041. *TR-36 ``Symbolic Mathematical Laboratory'' by W.A. Martin (Ph.D. Dissertation), Jan. 1967, AD 657-283. *TR-35 ``An On-Line System for Algebraic Manipulation'' by R.R. Fenichel (Ph.D. Dissertation), Dec. 1966, AD 657-282. *TR-34 ``Computer Design for Asynchronously Reproducible Multiprocessing'' by E.C. Van Horn (Ph.D. Dissertation), Nov. 1966, AD 650-407. *TR-33 ``ADEPT - A Heuristic Program for Proving Theorems of Group Theory'' by L.M. Norton (Ph.D. Dissertation), Oct. 1966, AD 645-660. *TR-32 ``PILOT: A Step Toward Man-Computer Symbiosis'' by W. Teitelman (Ph.D. Dissertation), Sept. 1966, AD 638-446. *TR-31 ``Models and Data Structures for Digital Logic Simulation'' by D.L. Smith (S.M. Thesis), August 1966, AD 637-192. TR-30 ``Traffic Control in a Multiplexed Computer'' by J.H. Saltzer (Sc.D. Thesis), July 1966, AD 635-966, $1.00. *TR-29 ``Search Procedures Based on Measures of Relatedness Between Documents'' by E.L. Ivie (Ph.D. Dissertation), June 1966, AD 636-275. *TR-28 ``Input/Output in Time-Shared, Segmented, Multiprocessor Systems'' by A.A. Smith (S.M. Thesis), June 1966, AD 637-215. *TR-27 ``OCAS - On-Line Cryptanalytic Aid System'' by D.J. Edwards (S.M. Thesis), May 1966, AD 633-678. *TR-26 ``Design of a Low-Cost Character Generator for Remote Computer Displays'' by T.B. Cheek (S.M. Thesis), March 1966, AD 631-269. *TR-25 ``Investigation of an Analog Technique to Decrease Pen-Tracking Time in Computer Displays'' by W.D. Stratton (S.M. Thesis), March 1966, AD 631-396. *TR-24 ``MAP: A System for On-Line Mathematical Analysis'' by R. Kaplow, S. Strong and J. Brackett, Jan. 1966, AD 476-443. *TR-23 ``Programming Semantics for Multiprogrammed Computations'' by J.B. Dennis and E.C. Van Horn, Dec. 1965, AD 627-537. *TR-22 ``The Priority Problem'' by M. Greenberger, Nov. 1965, AD 625-728. *TR-21 ``Queueing Models for File Memory Operation'' by P.J. Denning (S.M. Thesis), Oct. 1965, AD 624-943. *TR-20 ``CALCULAID: An On-Line System forAlgebraic Computation and Analysis'' by M.E. Wantman (S.M. Thesis), Sept. 1965, AD 474-019. *TR-19 ``A Heuristic Approach to Alternate Routing in a Job Shop'' by F. J. Russo (S.B. & S.M. Thesis), June 1965, AD 474-018. *TR-18 ``An Analysis of Time-Shared Computer Systems'' by A.L. Scherr (Ph.D. Dissertation) June 1965, AD 470-715. *TR-17 ``Time-Sharing on a Multiconsole Computer'' by A. L. Samuel, March 1965, AD 462-158. *TR-16 ``CTSS Technical Notes'' by J. H. Saltzer, March 1965, AD 612-702. *TR-14 ``Use of CTSS in a Teaching Environment'' by D. Roos, Nov. 1964, AD 661-807. *TR-13 ``A New Methodology for Computer Simulation'' by M. Greenberger, Oct. 1964, AD 609-288. *TR-12 ``The MAC System: A Progress Report'' by R.M. Fano, Oct. 1964, AD 609-296. *TR-11 ``Program Structure in a Multi-Access Computer'' by J.B. Dennis, May 1964, AD 608-500. *TR-8 ``The OPS-1 Manual'' by M. Greenberger, May 1964, AD 604-681. *TR-7 ``OPL-1: An Open Ended Programming System Within CTSS'' by J. Weizenbaum, April 1964, AD 604-680. *TR-6 ``STRESS: A Problem-Oriented Language for Structural Engineering'' by J.M. Biggs and R.D. Logcher, May 1964, AD 604-679. *TR-4 ``Verbal and Graphical Language for the AED System: A Progress Report'' by D.T. Ross and C.G. Feldman, May 1964, AD 604-678. *TR-3 ``System Requirements for Multiple-Access, Time-Shared Computers'' by F. J. Corbato, May 1964, AD 608-501. *TR-2 ``SIR: A Computer Program for Semantic Information Retrieval'' by B. Raphael (Ph.D. Dissertation), June 1964, AD 608-499. *TR-1 ``Natural Language Input for a Computer Problem Solving System'' by D.G. Bobrow (Ph.D. Dissertation), Sept. 1964, AD 604-730.