Computer Science Technical Reports
http://hdl.handle.net/1813/5603
20161206T21:46:04Z

A Calculus for FlowLimited Authorization: Technical Report
http://hdl.handle.net/1813/42406
A Calculus for FlowLimited Authorization: Technical Report
Arden, Owen; Myers, Andrew C.
Realworld applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system might be compromised if attackers can improperly influence the authorizing computation. Confidentiality can also be compromised by authorization, since authorization decisions are often based on sensitive data such as membership lists and passwords. Previous formal models for authorization do not fully address the security implications of permitting trust relationships to change, which limits their ability to reason about authority that derives from dynamic computation. Our goal is a way to construct dynamic authorization mechanisms that do not violate confidentiality or integrity.; We introduce the FlowLimited Authorization Calculus (FLAC), which is both a simple, expressive model for reasoning about dynamic authorization and also an information flow control language for securely implementing various authorization mechanisms. FLAC combines the insights of two previous models: it extends the Dependency Core Calculus with features made possible by the FlowLimited Authorization Model. FLAC provides strong endtoend information security guarantees even for programs that incorporate and implement rich dynamic authorization mechanisms. These guarantees include noninterference and robust declassification, which prevent attackers from influencing information disclosures in unauthorized ways. We prove these security properties formally for all FLAC programs and explore the expressiveness of FLAC with several examples.
20160913T00:00:00Z

Blocksafe Information Flow Control
http://hdl.handle.net/1813/44564
Blocksafe Information Flow Control
Kozyri, Elisavet; Desharnais, JosÃ©e; Tawbi, Nadia
Flowsensitive dynamic enforcement mechanisms for information flow labels offer increased permissiveness.
However, these mechanisms may leak sensitive information when deciding to block insecure executions.
When enforcing two labels (e.g., secret and public), sensitive information is leaked from the context in which this decision is taken.
When enforcing arbitrary labels, additional sensitive information is leaked from the labels
involved in the decision to block an execution.
We give examples where, contrary to a common belief, a mechanism designed to enforce
two labels may not be able to enforce arbitrary labels, due to this additional leakage.
In fact, it is not trivial to design
a dynamic enforcement that offers increased permissiveness,
handles multiple labels, and does not introduce information leakage due to blocking insecure executions.
In this paper, we present a dynamic enforcement mechanism of information flow labels
that has all these three attributes.
Our mechanism is not purely dynamic, since it uses a lightweight, onthefly,
static analysis of untaken branches. We prove that the set of all normally terminated
and blocked traces of a program, which is executed under our mechanism, satisfies
noninterference, against principals that make observations throughout execution.
20160809T00:00:00Z

JRIF: Reactive Information Flow Control for Java
http://hdl.handle.net/1813/41194
JRIF: Reactive Information Flow Control for Java
Kozyri, Elisavet; Arden, Owen; Myers, Andrew C.; Schneider, Fred B.
A reactive information flow (RIF) automaton for a value v specifies (i) allowed uses for v and (ii) the RIF automaton for any value that might be directly or indirectly derived from v. RIF automata thus specify how transforming a value alters how the result might be used. Such labels are more expressive than existing approaches for controlling downgrading. We devised a type system around RIF automata and incorporated it into Jif, a dialect of Java that supports a classic form of labels for information flow. By implementing a compiler for the resulting JRIF language, we demonstrate how easy it is to replace a classic informationflow type system by a more expressive RIFbased type system. We programmed two example applications in JRIF, and we discuss insights they provide into the benefits of RIFbased security labels.
20160212T00:00:00Z

FlowLimited Authorization
http://hdl.handle.net/1813/40138
FlowLimited Authorization
Arden, Owen; Liu, Jed; Myers, Andrew
Because information flow control mechanisms often rely on an underlying
authorization mechanism, their security guarantees can be
subverted by weaknesses in authorization. Conversely, the security
of authorization can be subverted by information flows that
leak information or that influence the delegation of authority among
principals.
We argue that interactions between information flow and authorization
create security vulnerabilities that have not been fully identified or
addressed in prior work.
We explore how the security of decentralized information
flow control (DIFC) is affected by
three aspects of its underlying authorization mechanism: first,
delegation of authority between principals; second, revocation of
previously delegated authority; third, information flows created by
the authorization mechanisms themselves. It is no surprise
that revocation poses challenges, but we show that even delegation
is problematic because it enables unauthorized
downgrading. Our solution is a new security model, the FlowLimited
Authorization Model (FLAM), which offers a new, integrated approach to
authorization and information flow control.
FLAM ensures robust authorization, a novel security condition for
authorization queries that ensures attackers cannot influence
authorization decisions or learn confidential trust relationships.
We discuss our prototype implementation and its algorithm for
proof search.
Content file updated at author's request on 20150604.
20150508T00:00:00Z

A Linear List Merging Algorithm
http://hdl.handle.net/1813/10810
A Linear List Merging Algorithm
Hopcroft, John E.; Ullman, Jeffrey D.
A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of the list currently containing a given element. If the length of the sequence of requests is bounded by a constant times n, then the execution time of the algorithm on a random access computer is bounded by a constant times n.
20080514T13:42:16Z

On the Modelling Power of Petri Nets
http://hdl.handle.net/1813/7516
On the Modelling Power of Petri Nets
Meiling, Erik
The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples of behaviors that cannot be expressed by languages in these families.
19791201T00:00:00Z

Cand and Cor Before and Then or Else in Ada
http://hdl.handle.net/1813/7515
Cand and Cor Before and Then or Else in Ada
Gries, David
NO ABSTRACT SUPPLIED
19791101T00:00:00Z

A Proof Technique for Communicating Sequential Processes(With an Example)
http://hdl.handle.net/1813/7514
A Proof Technique for Communicating Sequential Processes(With an Example)
Levin, Gary Marc
We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980.
19791101T00:00:00Z

On Linear Natural Deduction
http://hdl.handle.net/1813/7513
On Linear Natural Deduction
Leivant, Daniel
NO ABSTRACT SUPPLIED
19791101T00:00:00Z

The System Architecture for CORE: A Tolerant Program Development Environment
http://hdl.handle.net/1813/7512
The System Architecture for CORE: A Tolerant Program Development Environment
Archer, James E., Jr.; Conway, Richard W.; Shore, Andrew I.; Silver, Leonard S.
CORE is a program development environment intended primarily to explore a highly tolerant useer interface. In some respects the internal architecture is also novel. It permits a highly interactive and supportive user interface to be implemented with processing routines which are essentially oblivious to any user interaction.
19791001T00:00:00Z

A Program Development System Execution Supervisor
http://hdl.handle.net/1813/7511
A Program Development System Execution Supervisor
Archer, James E., Jr.; Shore, Andrew I.
The Cornell Program Development System is an experimental vehicle to explore the applicability of highly cooperative tactics to a contemporary development environment. The CPDS provides significant facilities for modifying and immediately executing programs. The execution supervisor and the internal user program representation it uses to implement these facilities are described.
19791001T00:00:00Z

Quadratic Programming with MMatrices
http://hdl.handle.net/1813/7510
Quadratic Programming with MMatrices
Luk, Franklin T.; Pagano, Marcello
In this paper, we study the problem of quadratic programming with Mmatrices. We describe (1) an effective algorithm for the case where the variables are subject to a lower bound constraint, and (2) an analogous algorithm for the case where the variables are subject to lower and upper bounds constraints. We demonstrate the special monotone behavior of the iterate and gradient vectors. The result on the gradient vector is new. It leads us to consider a simple updating procedure which preserves the monotonicity of both vectors. The procedure uses the fact that an Mmatrix has a nonnegative inverse. Two new algorithms are then constructed by incorporating this updating procedure into the two given algorithms. We give numerical examples which show that the new methods can be more efficient than the original ones.
19791001T00:00:00Z

Ada/CS  An Instructional Subset of the Programming Language Ada
http://hdl.handle.net/1813/7509
Ada/CS  An Instructional Subset of the Programming Language Ada
Archer, James E., Jr.
NO ABSTRACT SUPPLIED
19791001T00:00:00Z

A Unified View of Semantics
http://hdl.handle.net/1813/7508
A Unified View of Semantics
Majster, Mila E.
NO ABSTRACT SUPPLIED
19791001T00:00:00Z

Efficient OnLine Construction and Correction of Position Trees
http://hdl.handle.net/1813/7507
Efficient OnLine Construction and Correction of Position Trees
Majster, Mila E.
This paper presents an online algorithm for the construction of position trees, i.e. an algorithm which constructs the position tree for a given string while reading the string from left to right. In addition, an online correction algorithm is presented which  upon a change in the string  can be used to construct the new position tree. Moreover, special attention is paid to computers with small memory. Compactification of the trees and transport costs between main and secondary storage are discussed.
19791001T00:00:00Z

Ensuring Consistency in a Distributed Database System by Use of Distributed Semaphores
http://hdl.handle.net/1813/7506
Ensuring Consistency in a Distributed Database System by Use of Distributed Semaphores
Schneider, Fred B.
Solutions to the database consistency problem in distributed databases are developed. It is shown how any solution to the consistency problem for a centralized database system that involves locking can be adapted for use in distributed systems. This is done, constructively, in two steps. First, it is shown how locking can be implemented in terms of semaphores. Then, a semaphore implementation that is suitable for use in distributed systems is developed.
19790901T00:00:00Z

Synchronization in Distributed Programs
http://hdl.handle.net/1813/7505
Synchronization in Distributed Programs
Schneider, Fred B.
A technique for solving synchronization problems in distributed programs is described. Use of this technique in environments in which processes may fail is discussed. The technique can be used to solve synchronization problems directly, to implement new synchronization mechanisms (which are presumably well suited for use in distributed programs), and to construct distributed versions of existing synchronization mechanisms. Use of the technique is illustrated with implementations of distributed semaphores and a conditional message passing facility.
19790901T00:00:00Z

On Easily Infinite Sets and On a Statement of R. Lipton
http://hdl.handle.net/1813/7504
On Easily Infinite Sets and On a Statement of R. Lipton
Leivant, Daniel
For a complexity measure $\kappa$, a set is $\kappa$infinite if it contains a $\kappa$decidable infinite subset. For a timebased $\kappa$, we prove that there is a recursive S s.t. both S and its complements, $\bar{S}$, are infinite but not $\kappa$infinite. Lipton [6] states that the existence of a recursive set S s.t. neither S nor $\bar{S}$ os polynomially infinite is not a purely logical consequence of $\prod^{0}_{2}$ theorems of Peano's Arithmetic PA. His proof uses a construction of an algorithm within a nonstandard model of of Arithmetic, in which the existence of infinite descending chains in such models is overlooked. We give a proof of a stronger statement to the effect that the existence of a recursive set S s.t. neither S nor $\bar{S}$ is linearly infinite is not a tautological consequence of all true $\prod^{0}_{2}$ assertions. We comment on other aspects of [6], and show $(\S 2)$ that a tautological consequence of true $\prod^{0}_{2}$ assertions may not be equivalent (in PA, say) to a $\prod^{0}_{2}$ sentence. The three sections of this paper use techniques of Recursion Theory, Proof Theory and Model Theory, respectively.
19790901T00:00:00Z

A Logic For Correct Program Development
http://hdl.handle.net/1813/7503
A Logic For Correct Program Development
Bates, Joseph Louis
19790801T00:00:00Z

The Complexity of Parallel Computations
http://hdl.handle.net/1813/7502
The Complexity of Parallel Computations
Wyllie, James C.
Recent advances in microelectronics have brought closer to feasibility the construction of computers containing thousands (or more) of processing elements. This thesis addresses the question of effective utilization of such processing power. We study the computational complexity of synchronous paarallel computations using a model of computation based on random access machines operating in parallel and sharing a common memory, the PRAM. Two main areas within the field of parallel computational complexity are investigated. First, we explore the power of the PRAM model viewed as an abstract computing device. Later, we study techniques for developing efficient algorithms for parallel computers. We are able to give concise characterizations of the power of deterministic and nondeterministic PRAMS in terms of the more widely known space and time complexity classes for multitape Turing machines. Roughly speaking, timebounded deterministic PRAMS are equivalent in power to (can accept the same sets as) spacebounded Turing machines, where the time and space bounds differ by at most a polynomial. In the context of comparing models of computation, we consider such polynomial differences in resources to be insignificant. Adding the feature of nondeterminism to the timebounded PRAM changes its power to that of a nondeterministic Turing machine with an exponentially higher running time. The later sections of the thesis examine algorithm design techniques for parallel computers. We first develop efficient procedures for some common operations on linked lists and arrays. Given this background, we introduce three techniques that permit the design of parallel algorithms that are efficient in terms of both their time and processor requirements. We illustrate the use of these techniques by presenting time and processor efficient algorithms for three problems, in each case improving upon the best previously known parallel resource bounds. We show how to compute minimum string edit distances, using the technique of pairwise function composition. We describe an algorithm for the offline MIN that organizes its computation in the form of a complete binary tree. Finally, we present an algorithm for undirected graph connectivity that relies on redundancy in its representation of the input graph.
19790801T00:00:00Z

A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem
http://hdl.handle.net/1813/7501
A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem
Dietz, Paul F.; Furst, Merrick; Hopcroft, John E.
THe Generalized Consecutive Retrieval Problem (GCRP) is to find a directed tree on $n$ records in which each of $k$ subsets forms a directed path. The problem arises in organizing information for efficient retrieval. A linear time algorithm for the GCRP is given. Further generalization leads to problems that are complete for NP.
19790701T00:00:00Z

A TimeSpace Tradeoff for InPlace Array Permutation
http://hdl.handle.net/1813/7500
A TimeSpace Tradeoff for InPlace Array Permutation
Melville, Robert C.
NO ABSTRACT SUPPLIED
19790701T00:00:00Z

Convergence Theorems for Least Change Secant Update Methods
http://hdl.handle.net/1813/7499
Convergence Theorems for Least Change Secant Update Methods
Dennis, John E. Jr.; Walker, Homer F.
The purpose of this paper is to present a convergence analysis of the least change secant methods in which part of the derivative matrix being approximated is computed by other means. The theorems and proofs given here can be viewed as generalizations of those given by BroydenDennisMore and by DennisMore. The analysis is done in the orthogonal projection setting of DennisSchnabel and many readers might feel that it is easier to understand. The theorems here readily imply local and qsuperlinear convergence of all the standard methods in addition to proving these results for the first time for the sparse symmetric method of Marwil and Toint and the nonlinear least squares method of DennisGayWelsch.
19790701T00:00:00Z

Local Convergence Theorems for QuasiNewton Methods
http://hdl.handle.net/1813/7498
Local Convergence Theorems for QuasiNewton Methods
Dennis, John E. Jr.; Walker, Homer F.
This paper presents generalizations of the two results which have been useful for analyzing methods of the form $x_{k+1} = x_{k}  B_{k}^{1}F(x_{k})$. The bounded deterioration theorem of BroydenDennisMore is generalized to show that if \{$B_{k}$\} or \{$B_{k}^{1}$\} is of bounded deterioration as a sequence of approximants to some $B_{*}$ or $B_{*}^{1}$ then the iteration above has the same local convergence properties and arbitrarily nearly the same linear rate as would be achieved by the stationary iteration function which uses $B_{k} = B_{*}$. The characterization theorem for superlinear convergence given by DennisMore is then generalized to give conditions under which the rates are the same. In the case when $B_{*} = F'(x_{*})$, these results reduce to those already known.
19790701T00:00:00Z

Efficiency Considerations In Implementing Dijkstra's Guarded Command Constructs
http://hdl.handle.net/1813/7497
Efficiency Considerations In Implementing Dijkstra's Guarded Command Constructs
McGuire, Marguerite Elaine
The guarded command alternative and iterative constructs proposed by E. W. Dijkstra subsume the conventional alternative and iterative constructs. The extra flexibility of these guarded command constructs enables the programmer to express his ideas more directly and clearly. Moreover, Dijkstra has developed a calculus for the derivation of correct programs that utilizes these guarded command constructs. This thesis addresses the problem of efficiently implementing these guarded command constructs. Several new optimizations that are particularly well suited to the guarded command constructs are described. The most useful is the elimination of redundant boolean expressions. This optimization provides a means of implementing the guarded command alternative statement with efficiency comparable to the IFTHENELSE statement. The main contribution of this thesis is a detailed description of an algorithm for eliminating redundant boolean expressions. The algorithm itself is presented in a program written in a PASCAL supplemented with the guarded command constructs. The basis method involves considering individual execution paths through the guarded command construct and applying rules of inference to recognize and avoid evaluation of many boolean expressions. It is shown that the number of execution paths through a guarded command construct remains small enough to make this method practical.
19790701T00:00:00Z

The Cornell Program Synthesizer: A Tutorial Introduction
http://hdl.handle.net/1813/7496
The Cornell Program Synthesizer: A Tutorial Introduction
Teitelbaum, Tim
This tutorial introduces a novice student to the basic facilities of the Cornell Program Synthesizer for developing programs written in the PL/CS dialect of PL/I. No knowledge of programming is assumed or required. It is assumed that you possess a Synthesizer diskette and have access to a TERAK microcomputer.
19790701T00:00:00Z

On the Proof Theory of the Modal Logic G
http://hdl.handle.net/1813/7495
On the Proof Theory of the Modal Logic G
Leivant, Daniel
NO ABSTRACT SUPPLIED
19790701T00:00:00Z

A Procedure Call Proof Rule (With a Simple Explanation)
http://hdl.handle.net/1813/7494
A Procedure Call Proof Rule (With a Simple Explanation)
Gries, David; Levin, Gary Marc
NO ABSTRACT SUPPLIED
19790501T00:00:00Z

Upson's Familiar Quotations
http://hdl.handle.net/1813/7493
Upson's Familiar Quotations
Gaulle, Al
This report is a compilation of several hundred examples of context free language and very irregular expressions. Contributions were submitted over the last five years by numerous computer science graduate students who collected these now immortal words in classes and seminars. We wish to express our gratitude to the faculty, guest lecturers, and students who provided the bulk of this work.
19790501T00:00:00Z

A HamiltonianSchur Decomposition
http://hdl.handle.net/1813/7492
A HamiltonianSchur Decomposition
Paige, Chris; Van Loan, Charles
19790901T00:00:00Z

Computer Science and the Liberal Arts Student
http://hdl.handle.net/1813/7491
Computer Science and the Liberal Arts Student
Van Loan, Charles
The computer science education of nontechnical liberal arts students is a matter of increasing concern. In this paper it is argued that computer scientists should promote and teach their subject more in line with the traditional aims of liberal education when dealing with students of this type. A framework for doing this is presented which involves a broad view of "computer literacy" based upon what other authors have written about "scientific literacy." The structure of a computer science appreciation course is outlined which embodies the ideas of liberal education described. The importance of historical perspective is emphasized. Key Words and Phrases: Computer literacy, liberal arts student, liberal education, history of computation, scientific literacy.
19790501T00:00:00Z

Representation of Almost Constant Vectors
http://hdl.handle.net/1813/7490
Representation of Almost Constant Vectors
SteensgaardMadsen, Jorgen
An example in a recent report on the programming language Russell has illustrated difficulties related to user defined storage management. Here is demonstrated how the dynamic approach to encapsulation earlier proposed by the author provides means to solve the particular storage management problem. The method used is, however, easily generalized to other similar cases. In addition to the example a number of notational conveniences are introduced. One that allows abbreviated references to components of recordlike structures is called controlled coercion. Another allows a functionlike use of classes. Keywords: Classes, abstract data types, storage management, programming languages.
19790401T00:00:00Z

On Restrictions to Ensure Reproducible Behavior in Concurrent Programs
http://hdl.handle.net/1813/7489
On Restrictions to Ensure Reproducible Behavior in Concurrent Programs
Schneider, Fred B.; Bernstein, A. J.
One of the major difficulties encountered when dealing with concurrent programs is that reproducible behavior may not be assumed. As a result, it is difficult to validate and debug such systems. In this paper, structural restrictions are presented that ensure that reproducible behavior will occur in concurrent programs. The application of this to system design is discussed. Keywords: time dependent behavior, concurrency, synchronization, monitors, Concurrent Pascal.
19790301T00:00:00Z

APL and the Grzegorczyk Hierarchy
http://hdl.handle.net/1813/7488
APL and the Grzegorczyk Hierarchy
Breidbart, Seth
We show in this paper that the set of "traditional" APL 1liners (using arithmetic functions only) compute precisely the set of functions in the class E4 of Grzegorczyk hierarchy (the class immediately above the elementary functions). We also show that if we extend the set of 1liners to include either the "execute" operator, or 1 line programs with gotos, then any partial recursive function can be computed.
19790301T00:00:00Z

The Cornell Program Synthesizer: A Microcomputer Implementationof PL/CS
http://hdl.handle.net/1813/7487
The Cornell Program Synthesizer: A Microcomputer Implementationof PL/CS
Teitelbaum, Tim
NO ABSTRACT SUPPLIED
19790301T00:00:00Z

Comments on a Draft Pascal Standard
http://hdl.handle.net/1813/7486
Comments on a Draft Pascal Standard
SteensgaardMadsen, Jorgen
NO ABSTRACT SUPPLIED
19790201T00:00:00Z

A Progress Report on Automatic Information Retrieval
http://hdl.handle.net/1813/7485
A Progress Report on Automatic Information Retrieval
Salton, Gerard
This study is a stateoftheart report of work in automatic information retrieval. Various enhancements of operational online retrieval systems are described such as the utilization of special frontend devices providing compatibility among different search services, the introduction of fast backend search devices, and the use of local clustering and query reformulation operations designed to improve retrieval output. Certain new algorithms for fast text matching and for optimum term weighting are also mentioned, as are advances in the construction of theoretical retrieval models.
19790201T00:00:00Z

Implementation of an Unrestricted File Organization for MicroPL/CS
http://hdl.handle.net/1813/7484
Implementation of an Unrestricted File Organization for MicroPL/CS
Archer, James E. Jr.
Micro PL/CS is a version of PL/CS developed for a singleuser, interactive environment. A file system extension makes PL/CS selfsufficient for standalone file processing and secondary storage management. The basis of the file system extension is the Unrestricted File Organization which provides a free mixture of sequential, indexed and random file operations. The structure, operation, and systeminterfaced procedures of the UFO are presented and explained. The MicroPL/CS file extension implementation is then sketched in terms of the UFO primitives.
19790201T00:00:00Z

A File System Extension to MicroPL/CS
http://hdl.handle.net/1813/7483
A File System Extension to MicroPL/CS
Archer, James E., Jr.
MicroPL/CS is a version of PL/CS developed for interactive use with a dedicated microprocessor. A file system extension is proposed to give PL/CS a simple, but extremely powerful file system capability. The system allows for the creation and manipulation of files for sequential, random, or keyed access (or any combination) in an unrestricted manner. Essential to the capability is a set of builtin functions and pseudovariables which allow file manipulation without syntactic complication.
19790201T00:00:00Z

Mechanisms for Specifying Scheduling Policies
http://hdl.handle.net/1813/7482
Mechanisms for Specifying Scheduling Policies
Schneider, Fred B.; Bernstein, A. J.
Extensions to concurrent programming languages are presented which allow control of scheduling policies previously defined by the runtime support system. It is shown that the use of these mechanisms simplifies the solutions of concurrent programming problems. In addition, the proposed extensions allow easy identification of those aspects of a program concerned with performance, thereby making programs easier to read and understand. Keywords: concurrent pascal, monitors, communicating sequential processes, operating systems, scheduling algorithms.
19790201T00:00:00Z

A Citation Study of the Computer Science Literature
http://hdl.handle.net/1813/7481
A Citation Study of the Computer Science Literature
Salton, Gerard; Bergmark, D.
The bibliographic references and citations which exist between documents in a given collection environment can be used to study the history and scope of particular subject areas and to assess the importance of individual authors, documents, and journals. A clustering study of the computer science literature is described using bibliographic citations as a clustering criterion, and conclusions are drawn regarding the scope of computer science, and the characteristics of individual documents in the area.
19790101T00:00:00Z

Suggestions for a Uniform Representation of Query and Record Content in Data Base and Document Retrieval
http://hdl.handle.net/1813/7480
Suggestions for a Uniform Representation of Query and Record Content in Data Base and Document Retrieval
Salton, Gerard
A standard approach is introduced for the representation of information content in data base and document retrieval environments. The use of composite concept vectors representing individual information items leads to a uniform system in different retrieval situations for the identification of answers in response to incoming information requests.
19790101T00:00:00Z

Sorting and Searching Using Controlled Density Arrays
http://hdl.handle.net/1813/7479
Sorting and Searching Using Controlled Density Arrays
Melville, Robert C.; Gries, David
Algorithms like insertion sort run slowly because of costly shifting of array elements when a value is inserted or deleted. The amount of shifting, however, can be reduced by leaving gaps  unused array locations into which new values can be inserted  at regular intervals in the array. The proper arrangement of gaps is maintained by periodic adjustment. We demonstrate this technique with a stable comparison sort algorithm with expected time $O(N \log N)$, worst case time $O(N \sqrt{N})$, and space requirements 2N. We conjecture that, by using an interpolation search, the expected time can be reduced to $O(N \log \log N)$. By comparison, Quicksort takes expected time $O(N \log N)$, worst case time $O(N^{2})$ and space $N + \log N$. Second, we show that for any fixed $d \geq 2$ a table management algorithm can be constructed that can process a sequence of $N$ instructions chosen from among INSERT, DELETE, SEARCH, and, MIN in worst case time $O(N^{1+1/d})$. Experiments with a version of the algorithms using $d=2$ show a marked improvement over balanced tree schemes for $N$ as large as several thousand.
19781201T00:00:00Z

An Axiomatic Approach to Information Flow in Parallel Programs
http://hdl.handle.net/1813/7478
An Axiomatic Approach to Information Flow in Parallel Programs
Andrews, Gregory R.; Reitman, Richard P.
This paper presents a new, axiomatic approach to information flow in sequential and parallel programs. Flow axioms that capture the information flow semantics of a variety of statements are given and used to construct program flow proofs. The method is illustrated by a variety of examples. The applications of flow proofs to certifying information flow policies and solving the confinement problem are considered. It is also shown that flow axioms and correctness axioms can be combined to form an even more powerful proof system. Keywords and Phrases: information flow, information security, security certification, parallel programs, axiomatic logic, proof rules.
19781201T00:00:00Z

Synchronizing Resources
http://hdl.handle.net/1813/7477
Synchronizing Resources
Andrews, Gregory R.
A new proposal for synchronization and communication in parallel programs is presented. The proposal, called synchronization resources, combines and extends aspects of procedures, coroutines, monitors, communicating sequential processes, and distributed processes. It provides a single notation for parallel programming with or without shared variables and is suited for either shared or distributed memory architectures. The essential new concepts are operations, input statements, multiple processes and resources. The proposal is illustrated by solving a variety of parallel programming problems. Key Words and Phrases: parallel programming, processes, synchronization, process communication, monitors, distributed processing, programming languages, operating systems, data bases. CR Categories: 4.20, 4.22, 4.32, 4.35
19781201T00:00:00Z

The Logic of Aliasing
http://hdl.handle.net/1813/7476
The Logic of Aliasing
Cartwright, Robert; Oppen, Derek
We give a new version of Hoare's logic which correctly handles programs with aliased variables. The central proof rules of the logic (procedure call and assignment) are proved sound and complete.
19781101T00:00:00Z

A Survey of Graduate Programs in Computer Science
http://hdl.handle.net/1813/7475
A Survey of Graduate Programs in Computer Science
Conway, Richard W.
NO ABSTRACT SUPPLIED
19781101T00:00:00Z

Classes and Objects  A Dynamic Approach
http://hdl.handle.net/1813/7474
Classes and Objects  A Dynamic Approach
SteensgaardMadsen, Jorgen
Data encapsulation, abstract data types and classes are terms associated with a concept not fully clarified or accepted. This paper presents a class concept that differs slightly from previous definitions by the associated dynamics. This allows us to interpret nested and recursive classes as well as class parameters. We will distinguish between types and classes and permit types as parameters in a way that allows simple implementation. A number of examples will be given to illustrate the class concept itself and its application to access control problems for concurrent programs. Synchronization primitives will be viewed as classes and the need for explicit highlevel constructs like monitors is questioned. Keywords: Programming language, encapsulation, abstract data type, class, object, synchronization, monitor.
19781101T00:00:00Z

A Note on the Sparse Complete Sets
http://hdl.handle.net/1813/7473
A Note on the Sparse Complete Sets
Fortune, Steven
Hartmanis and Berman have conjectured that all NPcomplete sets are polynomial time isomorphic. A consequence of the conjecture is that there are no sparse NPcomplete sets. We show that the existence of an NPcomplete set whose complement is sparse implies P = NP. We also show that if there is a polynomial time reduction with sparse range to a PTAPEcomplete set, then P=PTAPE. Keywords: reduction, polynomial time, nondeterministic polynomial time, complete sets, sparsity.
19781001T00:00:00Z

A HessenbergSchur Method for the Problem AX + XB = C
http://hdl.handle.net/1813/7472
A HessenbergSchur Method for the Problem AX + XB = C
Golub, Gene H.; Nash, Stephen; Van Loan, Charles
ONe of the most effective methods for solving the matrix equation AX + XB = C is the BartelsStewart algorithm. Key to this technique is the orthogonal reduction of A and B to triangular form using the QR algorithm for eigenvalues. A new method is proposed which differs from the BartelsStewart algorithm in that A is only reduced to Hessenberg form. The resulting algorithm is between 30 and 70 percent faster depending upon the dimensions of the matrices A and B. The stability of the new method is demonstrated through a roundoff error analysis and supported by numerical tests. Fianlly, it is shown how the techniques described can be applied and generalized to other matrix equation problems.
19781001T00:00:00Z