Browsing LCS Publications by Title
Now showing items 713-732 of 1163
-
Object Models, Heaps and Interpretations
(2001-01)This paper explores the use of object models for specifying verifiable heap invariants. We define a simple language based on sets and relations and illustrate its use through examples. We give formal semantics of the ... -
Observing "True" Concurrency
(1993-09)In concurrent process theory, processors are often modeled by state machines and Petri Nets. Algebraic process theories based on state machines, exemplified by Milner's CCS and Hoare's CSP, have been more fully developed ... -
OCAS - On-line Cryptanalytic Aid System
(1966-05)Deficiencies of various programming languages for dealing with quantities frequently encountered in cryptanalysis of simple cipher systems will be discussed. A programming system is proposed which will permit a cryptanalyst ... -
An Office Analysis and Diagnosis Methodology
(1983-03)With the advent of computer technology designed for use in the office, office analysis, or the process of understanding office work for the purposes of introducing technology, has become increasingly important. The Office ... -
Office Analysis: Methodology and Case Studies
(1983-03)The Office Analysis Methodology (OAM) is a structured methodology for understanding the current operations of an office. OAM provides guidance in interviewing techniques and approaches to establishing a positive atmosphere ... -
Offline Authentication of Untrusted Storage
(2002-08)We extend the offline memory correctness checking scheme presented by Blum et. al [BEG+91], by using incremental cryptography, to detect attacks by an active adversary. We also introduce a hybrid o_ine-online checking ... -
Offline Integrity Checking of Untrusted Storage
(2002-11) -
On Bateson's Logical Levels of Learning Theory
(1975-02) -
On Bisecting Random Graphs
(1983-03)A bisection of a graph with an even number of vertices is a partition of the vertex set into two disjoint sets of equal size. Given a bisection, the number of edges having one end in each of the two subsets of the bisection ... -
On BPP
(1983-12) -
On Building Blocks for Distributed Systems
(1999-12) -
On Choosing a Task Assignment Policy for a Distributed Server System
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve order and the task's service demand is known ... -
On Computing Galois Groups and Its Application To Solvability by Radicals
(1983-03)This thesis presents a polynomial time algorithm for the basic question of Galois theory, checking the solvability by radicals of a monic irreducible polynomial over the integers. It also presents polynomial time algorithms ... -
On Concentration and Connection Networks
(1981-03)This thesis deals with the structural complexity of swicthing networks which realize concentration and connection requests when operated in a rearrangeable or incremental manner. Some of the important results and constructions ... -
On Concurrent Identification Protocols
(1983-12)We consider communication networks in which it is not possible to identify the source of a message which is broadcastes through the network. A natural question is whether it is possible for two users to identify each other ... -
On Consulting a Set of Experts and Searching
(1996-09)Two chapters of this thesis analyze expert consulting problemas via game theoretic models; the first points out a close connectionn between the problem of consulting a set of experts and the problem of searching. The last ... -
On Data Bases with Incomplete Information
(1979-10)Semantic and logical problems arising in an incomplete information data base are investigated. A simple query language is described and its semantics is defined, which refers the queries to the information about reality ... -
On Database Management System Architecture
(1979-10)Despite the many advances that have been made in the field of database management in the last two decades, in many respects the paradigm of database management has not changed much since its inception. Several long-standing ... -
On Linear Characterizations of Combinatorial Optimization Problems
(1980-02)We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP=co-NP -- a very unlikely event. We ...
