Browsing LCS Publications by Title
Now showing items 429-448 of 1163
-
A File Transfer Program for a Personal Computer
(1982-04)This thesis explores engineering decisions involved in implementing a network file transfer program on a personal computer in response to criteria of low cost and reasonable efficiency. The issues include choice of hardware, ... -
Final Report of the Multics Kernal Design Project
(1978-03)We describe a plan to create an auditable version of Multics. The engineering experiments of that plan are now complete. Type extension as a design discipline has been demonstrated feasible, even for the internal workings ... -
Finding Isomorph Classes for Combinatorial Structures
(1975-06)A common problem in combinatorial analysis is finding isomorph classes of combinatorial objects. This process is sometimes known as isomorph rejection. In graph theory, it is used to count labelled and unlabelled graphs ... -
Finding Minimum Cutsets in Reducible Graphs
(1977-06)The analysis of many processes modelled by directed graphs requires the selection of a subset of vertices which cut all the cycles in the graph. Reducing the size of such a cutset usually leads to a simpler and more efficient ... -
Finding Minimum-cost Circulations by Canceling Negative Cycles
(1987-07)A classical algorithm for finding a minimum-cost circultaion consists of repeatedly finding a residual cycle of negative cost and canceling it by pushing enough flow around the cycle to saturate an arc. We show that a ... -
Fine-Grain Dynamic Leakage Reduction
(2002-01) -
Fine-Grained Control of Java Applets Using a Simple Constraint Language
(1997-06)The use of the internet has increased extensively with a growing number of inexperienced users surfing the Web. Lurking in Web pages, Java applets are automatically executed on users' machines. As a result, popular Web ... -
Fine-Grained Failover Using Connection Migration
(2000-11)This paper presents a set of techniques for providing fine-grained failover of long-running connections across a distributed collection of replica servers, and is especially useful for fault-tolerant and load-balanced ... -
Finite Tree Automata and W-Automata
(1972-09)Chapter I is a survey of finite automata as acceptors of finite labeled trees. Chapter II is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Among the automata models considered in ... -
First Version of a Data Flow Procedure Language
(1975-05)A language for representing computational procedures based on the concept of data flow is presented in terms of a semantic model that permits concurrent execution of noninterfering program parts. Procedures in the language ... -
Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
(2003-06)Frick and Grohe showed that for each property phi that is definable in first-order logic, and for each class of minor-closed graphs of locally bounded treewidth, there is an O(n^(1+epsilon))-time algorithm deciding whether ... -
Floyd-Hoare Logic Defines Semantics
(1986-05)The first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple ... -
A Formal Model of Non-Determinate Dataflow Computation
(1983-08)Almost ten years ago, Gilles Kahn used the fixed point theory of Dana Scott to define a formal and elegant model of computation for determinate dataflow graphs, networks of determinate processes communicating asynchronously ... -
Formal Properties of Well-formed Data Flow Schemas
(1975-06)This thesis presents some results in comparative schematology and some undecidability results for two models of computer programs: the class of flowchart schemas and the class of well-formed data flow schemas (wfdfs's). ... -
Formal Specification Techniques for Promoting Software Modularity, Enhancing Documentation, and Testing Specifications
(1994-06)This thesis presents three ideas. First, it presents a novel use of formal specification to promote a programming style based on specified interfaces and data abstraction in a programming language that lacks such supports. ... -
Formal Specifications for Packet Communication Systems
(1977-11)One of the most difficult tasks facing computer scientists is that of designing systems and making sure that they perform their intended functions correctly. As computer systems have grown in size and complexity, the ... -
A Formal System for Defining the Syntax and Semantics of Computer Languages
(1969-04)The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the ... -
Formal Verification of Safety-Critical Hybrid Systems
(1997-09)This thesis investigates how the formal modeling and verification techniques of computer science can be used for the analysis of hybrid systems [1,2,3,4]---systems involving both discrete and continuous behavior. The ...
