Browsing LCS Publications by Title
Now showing items 452-471 of 1163
-
Formulation of Tradeoffs in Planning Under Uncertainty
(1987-06)Planning under uncertainty with multiple, competing objectives is impossible when goals are represented as predicates and the effects of actions are modeled as deterministic functions of situations. Decision-theoretic ... -
Forward and Backward Simulations for Timing-based Systems
(1991-11)A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. As a first step, a comprehensive overview of simulation ... -
Forward and Backward Simulations Part I: Untimed Systems (Replaces TM-486)
(1993-03)A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2) forward and backward ... -
Forward and Backward Simulations Part II: Timing-based Systems
(1993-03)A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinments, (2) forward and ... -
Forward-Secure Signatures with Optimal Signing and Verifying
(2001-04)Ordinary digital signatures have an inherent weakness: if the secret key is leaked, then all signatures, even the ones generated before the leak, are no longer trustworthy. Forward-secure digital signatures were recently ... -
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 ... -
Foundations of a Theory of Specification for Distributed Systems
(1984-08)This thesis investigates a particular approach, called state-transition specification, to the problem of describing the behavior of modules in a distributed or concurrent computer system. A state-transition specification ... -
A Framework for Incorporating Abstraction Mechanisms into the Logic Programming Paradigm
(1987-08)To help make logic programming more suitable for writing large systems, we develop linguistic mechanisms that permit the organization of logic programs around abstractions. In particular, we present the design of Danali, ... -
A Framework for Processing Dialogue
(1977-06)This report describes a framework for handling mixed-initiative English dialogue in a console session environment, with emphasis on recognition. Within this framework, both linguistic and non-linguistic activities are ... -
A Framework for Solving VSLI Graph Layout Problems
(1983-10)This paper introduces a new divide-and-conquer framework for VLSI graph layout. Universally close upper and lower bounds are obtained for important cost functions such as layout area and propagation delay. The framework ... -
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: An Overview
(1983-10)The advantages of denotational over operational semantics are argued. A denotational semantics is provided for an ALGOL-like language with finite-model procedures, blocks with local storage, and sharing (aliasing). Procedure ... -
Frustum Casting for Progressive, Interactive Rendering
(1998-01)Efficient visible surface determination algorithms have long been a fundamental goal of computer graphics. We discuss the well-known ray casting problem: given a geometric scene description, a synthetic camera, and a ... -
FUGU: Implementing Translation and Protection in a Multiuser, Multimodel Multiprocessor
(1994-10)Multimodel multiprocessors provide both shared memory and message passing primitives to the user for efficient communication. In a multiuser machine, translation permits machine resource to be virtualized and protection ... -
Full Abstraction and the Context Lemma 1
(1991-12)It is impossible to add a combinator to PCF to achieve full abstraction for models such as Berry's stable domains in a way analogous to the addition of the "parallel-or" combinator that achieves full abstraction for the ... -
Function-Based Indexing for Object-Oriented Databases
(1994-02)Object-oriented databases should support queries over user-defined sets based on properties computed using user-defined functions. This dissertation presents a new function-based indexing scheme to make these queries run ... -
Functional Domains of Applicative Languages
(1974-09)The expressive power of a particular applicative language may be characterized by the set of abstract functions directly representable in that language. The common FUNARG and applicative order problems are scrutinized in ... -
Fundamental Design Problems of Distributed Systems for the Hard-real-time Environment
(1983-06)Software designed to function in a hard-real-time environment where strict timing constraints must be met often entails implicit assumptions about a programming language and the underlying system which supports it. Programs ... -
Further Results on Hierarchies of Canonic Systems
(1972-06)This thesis outlines a new way of presenting the theory of canonic systems, including a distinction (for mathodic reasons) between simple canonic systems and general canonic systems, and proves a series of results on ... -
FX-87 Performance Measurements: Dataflow Implementation
(1988-09)We analyze how much the FX-87 static effect system can improve the execution times of five benchmark programs on a parallel graph interpreter. Three of our benchmark programs do not use side-effects (factorial, fibonacci, ...
