Mathematical Theory of Partial Correctness. AIM-139
Abstract/Contents
- Abstract
In this work we show that it is possible to express most properties
regularly observed in algorithms in terms of 'partial correctness'
(i.e., the property that the final results of the algorithm, if any,
satisfy some given input-output relation). This result is of special
interest since 'partial correctness' has already been formulated in
predicate calculus and in partial function logic for many classes of
algorithms.
Description
Type of resource | text |
---|---|
Form | memorandums |
Extent | 1 text file |
Place | Stanford (Calif.) |
Date created | December 1970 |
Language | English |
Digital origin | reformatted digital |
Creators/Contributors
Author | Manna, Zohar |
---|
Subjects
Subject | Stanford Artificial Intelligence Laboratory |
---|---|
Subject | Memo (Stanford Artificial Intelligence Laboratory) |
Subject | Artificial intelligence |
Genre | Memorandums |
Bibliographic information
Finding Aid | |
---|---|
Memo | AIM-139 |
Location | https://purl.stanford.edu/pz755rh3300 |
Location | SC1041 |
Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
- Copyright
- Copyright © The Board of Trustees of the Leland Stanford Junior University. All rights reserved.
Collection
Stanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...