article

The correctness of programs

Author:

Zohar MannaAuthors Info & Claims

Journal of Computer and System Sciences, Volume 3, Issue 2

Pages 119 - 127

https://doi.org/10.1016/S0022-0000(69)80009-7

Published: 01 May 1969 Publication History

Abstract

This paper is concerned with the relationship between the correctness of programs and the satisfiability (or unsatisfiability) of certain formulas of the first-order predicate calculus. Results on the equivalence of programs are also included.

References

[1]

Program Scheme Equivalences and Second Order Logic. In: Presented at Fourth Annual Machine Intelligence Workshop,

Google Scholar

[2]

Assigning Meaning to Programs. In: Proceedings of Symposia in Applied Mathematics, American Mathematical Society, Vol. 19. pp. 19-32.

Google Scholar

[3]

The Verifying Compiler. In: Computer Science Research Review, Carnegie-Mellon University.

Google Scholar

[4]

Termination of Algorithms. In: Ph.D. Thesis, Computer Science Department, Carnegie-Mellon University.

Google Scholar

[5]

Properties of Programs and the First-Order Predicate Calculus.

Google Scholar

[6]

In: Introduction to Mathematical Logic, Van Nostrand Company, Princeton.

Google Scholar

Cited By

View all

Lucas SGutiérrez R(2018)Automatic Synthesis of Logical Models for Order-Sorted First-Order TheoriesJournal of Automated Reasoning10.1007/s10817-017-9419-360:4(465-501)Online publication date: 1-Apr-2018
(2014)Readings in Artificial IntelligenceundefinedOnline publication date: 12-May-2014
Sangiorgi D(2009)On the origins of bisimulation and coinductionACM Transactions on Programming Languages and Systems10.1145/1516507.151651031:4(1-41)Online publication date: 26-May-2009
Show More Cited By

Recommendations

On Correctness of Normal Logic Programs
Logic-Based Program Synthesis and Transformation
Abstract
We present sufficient conditions for correctness of logic programs with negation (normal programs). We focus on the Kunen semantics, this declarative semantics is a closest one to what is implemented in Prolog (negation by finite failure) when ...
Correctness and Completeness of Logic Programs

We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method that should be well known but is often neglected. Also, we show how to ...
Substructural logic and partial correctness

We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and ...

Comments

Information & Contributors

Information

Published In

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 May 1969

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lucas SGutiérrez R(2018)Automatic Synthesis of Logical Models for Order-Sorted First-Order TheoriesJournal of Automated Reasoning10.1007/s10817-017-9419-360:4(465-501)Online publication date: 1-Apr-2018
(2014)Readings in Artificial IntelligenceundefinedOnline publication date: 12-May-2014
Sangiorgi D(2009)On the origins of bisimulation and coinductionACM Transactions on Programming Languages and Systems10.1145/1516507.151651031:4(1-41)Online publication date: 26-May-2009
Ray SHunt WMatthews JMoore J(2008)A Mechanical Analysis of Program Verification StrategiesJournal of Automated Reasoning10.1007/s10817-008-9098-140:4(245-269)Online publication date: 1-May-2008
Matthews JMoore JRay SVroon D(2006)Verification condition generation via theorem provingProceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning10.1007/11916277_25(362-376)Online publication date: 13-Nov-2006
Shriver BLandry SSrini VSrini V(2003)DataflowEncyclopedia of Computer Science10.5555/1074100.1074319(520-523)Online publication date: 1-Jan-2003
Reynolds J(1998)Definitional Interpreters for Higher-Order Programming LanguagesHigher-Order and Symbolic Computation10.1023/A:101002740422311:4(363-397)Online publication date: 1-Dec-1998
McNerney T(1991)Verifying the correctness of compiler transformations on basic blocks using abstract interpretationACM SIGPLAN Notices10.1145/115866.11587726:9(106-115)Online publication date: 1-May-1991
McNerney TConsel CDanvy O(1991)Verifying the correctness of compiler transformations on basic blocks using abstract interpretationProceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/115865.115877(106-115)Online publication date: 1-May-1991
Bergstra JTucker J(1984)The axiomatic semantics of programs based on Hoare's logicActa Informatica10.1007/BF0026425221:3(293-320)Online publication date: 1-Oct-1984
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

On Correctness of Normal Logic Programs

Correctness and Completeness of Logic Programs

Substructural logic and partial correctness

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations