Now showing items 37-56 of 59

• A Linear Sieve Algorithm for Finding Prime Numbers ﻿

(Cornell University, 1977-06)
NO ABSTRACT SUPPLIED
• McLaren's Masterpiece ﻿

(Cornell University, 1986-01)
Abstract not available
• A Model and Temporal proof system for Networks of Processes ﻿

(Cornell University, 1985-06)
An approach is presented for modeling networks of processes that communicate exclusively through message passing. A process (or a network) is defined by its set of possible behaviors, where each behavior is an abstraction ...
• A Model and Temporal Proof System for Networks of Processes ﻿

(Cornell University, 1984-11)
A model and a sound and complete proof system for networks of processes in which component processes communicate exclusively through messages is given. The model, an extension of the trace model, can desribe both synchronous ...
• A New Approach to Teaching Mathematics ﻿

(Cornell University, 1994-02)
We propose a new approach to teaching discrete math: First, teach logic as a powerful and versatile tool for discovering and communicating truths; then use this tool in all other topics of the course. We spend 6 weeks ...
• A Note on Iteration ﻿

(Cornell University, 1977-09)
NO ABSTRACT SUPPLIED
• A Note on Program Development ﻿

(Cornell University, 1974-03)
NO ABSTRACT SUPPLIED
• A Note on the Standard Strategy for Developing Loop Invariants and Loops ﻿

(Cornell University, 1982-10)
The by-now-standard strategy for developing a loop invariant and loop was developed in [1] and explained [2]. Nevertheless, its use still poses problems for some. The purpose of this note is to provide further explanation. ...
• On Presenting Monotonicity and On EA=>AE ﻿

(Cornell University, 1995-04)
Two independent topics are treated. First, the problem of weakening/strengthening steps in calculational proofs is discussed and a form of substantiating such steps is proposed. Second, a simple proof of (Ex| R.x: (Ay| ...
• Presenting an Algorithm to Find the Minimum Edit Distance ﻿

(Cornell University, 1988-03)
ABSTRACT UNAVAILABLE
• A Procedure Call Proof Rule (With a Simple Explanation) ﻿

(Cornell University, 1979-05)
NO ABSTRACT SUPPLIED
• Program Schemes with Pushdown Stores ﻿

(Cornell University, 1972-04)
We attempt to characterize classes of schemes allowing pushdown stores, building on an earlier work by Constable and Gries [1]. We study the effect (on the computational power) of aloowing one, two, or more pushdown stores, ...
• Programming by Induction ﻿

(Cornell University, 1971-09)
A technique for creating programs, called programming by induction, is described. The term is used because of the similarity between programming by induction and proving a theorem by induction.
• Proving Properties of Parallel Programs: An Axiomatic Approach ﻿

(Cornell University, 1975-05)
This paper presents an axiomatic technique for proving a number of properties of parallel programs. Hoare has given a set of axioms for partial correctness of parallel programs, but they are not strong enough in most ...
• Recursion as a Programming Tool ﻿

(Cornell University, 1975-04)
NO ABSTRACT SUPPLIED
• The Seven-Eleven Problem ﻿

(Cornell University, 1983-09)
NO ABSTRACT SUPPLIED
• Some Ideas on Data Types in High Level Languages ﻿

(Cornell University, 1975-05)
WE explore some new and old ideas concerning data types; what a data type is, overloading operators, when and how implicit conversions between programmer data types should be allowed and so forth. The current notion that ...
• Sorting and Searching Using Controlled Density Arrays ﻿

(Cornell University, 1978-12)
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 ...
• Swapping Sections ﻿

(Cornell University, 1981-01)
NO ABSTRACT SUPPLIED
• Teaching Math More Effectively, Through the Design of Calculational Proofs ﻿

(Cornell University, 1994-03)
Lower-level college math courses usually avoid using formalism, in both definitions and proofs. Later, when students have mastered definitions and proofs written largely in English, they may be shown how informal reasoning ...