Contact Us
Cancel
The History of Artificial Intelligence

Search Constraints

Start Over
You searched for: Topic Stanford University. Computer Science Department Remove constraint Topic: Stanford University. Computer Science Department
| 41 - 50 of 7,694 |
Number of results to display per page
{:heatmaps=>"Map"}
List Gallery Map Masonry Slideshow

Search Results

41. Sorting and Searching - errata and addenda

IIIF Drag-n-drop
Title:
Sorting and Searching - errata and addenda.
Author:
Knuth, Donald E.
Author (no Collectors):
Knuth, Donald E.
Description:
This report lists all the typographical errors, in $underline{The Art of Computer Programming / Volume 3}$, that are presently known to its author. Several recent developments and references to the literature, which will be incorporated in the second printing, are also included in an attempt to keep the book up-to-date. Several dozen corrections to the second (1971) printing of volume two are also included.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
October 01, 1973
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), October 1, 1973
Genre:
technical reports
Identifier:
CS-TR-1973-391
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

42. Stanford Time-Sharing Project Memo : Leo III Time Sharing. Memo 31

IIIF Drag-n-drop
Title:
Stanford Time-Sharing Project Memo : Leo III Time Sharing. Memo 31.
Author:
Lennie, John
Author (no Collectors):
Lennie, John
Topic:
Time-sharing computer systems
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
March 12, 1965
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), March 12, 1965
Genre:
memorandums
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
SC0524

43. A Proposed Definition of a Job and its Constituents Stanford Time-Sharing Project Memo. Memo 11

IIIF Drag-n-drop
Title:
A Proposed Definition of a Job and its Constituents Stanford Time-Sharing Project Memo. Memo 11.
Topic:
Time-sharing computer systems
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
December 03, 1963
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), December 3, 1963
Genre:
memorandums
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
SC0524

44. Correctness of two compilers for a Lisp subset

IIIF Drag-n-drop
Title:
Correctness of two compilers for a Lisp subset.
Author:
London, Ralph L.
Author (no Collectors):
London, Ralph L.
Description:
Using mainly structural induction, proofs of correctness of each of two running Lisp compilers for the PDP-10 computer are given. Included are the rationale for presenting these proofs, a discussion of the proofs, and the changes needed to the second compiler to complete its proof.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
October 01, 1971
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), October 1, 1971
Genre:
technical reports
Identifier:
CS-TR-1971-240
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

45. Automatic program verification V: verification-oriented proof rules for arrays, records and pointers

IIIF Drag-n-drop
Title:
Automatic program verification V: verification-oriented proof rules for arrays, records and pointers.
Author:
Luckham, David C. and Suzuki, Norihisa
Author (no Collectors):
Luckham, David C. and Suzuki, Norihisa
Description:
A practical method is presented for automating in a uniform way the verification of Pascal programs that operate on the standard Pascal data structures ARRAY, RECORD, and POINTER. New assertion language primitives are introduced for describing computational effects of operations on these data structures. Axioms defining the semantics of the new primitives are given. Proof rules for standard Pascal operations on pointer variables are then defined in terms of the extended assertion language. Similar rules for records and arrays are special cases. An extensible axiomatic rule for the Pascal memory allocation operation, NEW, is also given. These rules have been implemented in the Stanford Pascal program verifier. Examples illustrating the verification of programs which operate on list structures implemented with pointers and records are discussed. These include programs with side-effects.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
March 01, 1976
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), March 1, 1976
Genre:
technical reports
Identifier:
CS-TR-1976-549
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

46. Axiomatic approach to total correctness of programs

IIIF Drag-n-drop
Title:
Axiomatic approach to total correctness of programs.
Author:
Manna, Z ohar and Pnueli, Amir
Author (no Collectors):
Manna, Z ohar and Pnueli, Amir
Description:
We present here an axiomatic approach which enables one to prove by formal methods that his program is "totally correct" (i.e., it terminates and is logically correct -- does what it is supposed to do). The approach is similar to Hoare's approach for proving that a program is "partially correct" (i.e., that whenever it terminates it produces correct results). Our extension to Hoare's method lies in the possibility of proving correctness $underline{and}$ termination at once, and in the enlarged scope of properties that can be proved by it.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
July 01, 1973
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), July 1, 1973
Genre:
technical reports
Identifier:
CS-TR-1973-379
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

47. The convergence of functions to fixedpoints of recursive definitions

IIIF Drag-n-drop
Title:
The convergence of functions to fixedpoints of recursive definitions.
Author:
Manna, Z ohar and Shamir, Adi
Author (no Collectors):
Manna, Z ohar and Shamir, Adi
Description:
The classical method for constructing the least fixedpoint of a recursive definition is to generate a sequence of functions whose initial element is the totally undefined function and which converges to the desired least fixedpoint. This method, due to Kleene, cannot be generalized to allow the construction of other fixedpoints. In this paper we present an alternate definition of convergence and a new fixedpoint access method of generating sequences of functions for a given recursive definition. The initial function of the sequence can be an arbitrary function, and the sequence will always converge to a fixedpoint that is "close" to the initial function. This defines a monotonic mapping from the set of partial functions onto the set of all fixedpoints of the given recursive definition.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
May 01, 1977
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), May 1, 1977
Genre:
technical reports
Identifier:
CS-TR-1977-614
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

48. A deductive approach to program synthesis

IIIF Drag-n-drop
Title:
A deductive approach to program synthesis.
Author:
Manna, Zohar and Waldinger, Richard J.
Author (no Collectors):
Manna, Zohar and Waldinger, Richard J.
Description:
Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a single framework.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
November 01, 1978
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), November 1, 1978
Genre:
technical reports
Identifier:
CS-TR-1978-690
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

49. A new approach to recursive programs

IIIF Drag-n-drop
Title:
A new approach to recursive programs.
Author:
Manna, Zohar and Shamir, Adi
Author (no Collectors):
Manna, Zohar and Shamir, Adi
Description:
In this paper we critically evaluate the classical least-fixedpoint approach towards recursive programs. We suggest a new approach which extracts the maximal amount of valuable information embedded in the programs. The presentation is informal, with emphasis on examples.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
December 01, 1975
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), December 1, 1975
Genre:
technical reports
Identifier:
CS-TR-1975-539
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2

50. Fixpoint approach to the theory of computation

IIIF Drag-n-drop
Title:
Fixpoint approach to the theory of computation.
Author:
Manna, Zohar
Author (no Collectors):
Manna, Zohar
Description:
Following the fixpoint theory of Scott, we propose to define the semantics of computer programs in terms of the least fixpoints of recursive programs. This allows one not only to justify all existing verification techniques, but also to extend them to handle various properties of computer programs, including correctness, termination and equivalence, in a uniform manner.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
March 01, 1972
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), March 1, 1972
Genre:
technical reports
Identifier:
CS-TR-1972-272
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2