Inductive methods for proving properties of programs

Authors:
Zohar Manna;Stephen Ness;Jean Vuillemin
Affiliations:
Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA
Venue:
Communications of the ACM
Year:
1973

Citing 8
Cited 33

Formalization of Properties of Functional Programs

Journal of the ACM (JACM)
Fixpoint approach to the theory of computation

Communications of the ACM
Another recursion induction principle

Communications of the ACM
Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
Logic for Computable Functions: description of a machine implementation.

Logic for Computable Functions: description of a machine implementation.
Recursive definitions of partial functions and their computations

Recursive definitions of partial functions and their computations
Proof-techniques for recursive programs.

Proof-techniques for recursive programs.
Computation: finite and infinite machines

Computation: finite and infinite machines

ACE: an automatic complexity evaluator

ACM Transactions on Programming Languages and Systems (TOPLAS)
Determining path feasibility for commercial programs

ACM SIGPLAN Notices
On the productivity of recursive list definitions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Completeness of rewrite rules and rewrite strategies for FP

Journal of the ACM (JACM)
Projecting functional models of imperative programs

ACM SIGPLAN Notices
Proving Properties of Complex Data Structures

Journal of the ACM (JACM)
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

Journal of the ACM (JACM)
Some Techniques for Recursion Removal from Recursive Functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Development of the Algebra of Functional Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Subgoal induction

Communications of the ACM
Test data as an aid in proving program correctness

Communications of the ACM
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
An example of hierarchical design and proof

Communications of the ACM
Design of Multi-Invariant Data Structures for Robust Shared Accesses in Multiprocessor Systems

IEEE Transactions on Software Engineering
First order programming logic

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Semantics and axiomatics of a simple recursive language.

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Function level programs as mathematical objects

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Programming as an evolutionary process

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Specification techniques for data abstractions

Proceedings of the international conference on Reliable software
A view of program verification

Proceedings of the international conference on Reliable software
Test data as an aid in proving program correctness

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Structured programming, programming teaching and the language Pascal

ACM SIGPLAN Notices
Proof Methods for Corecursive Programs

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
A case against the GOTO

Classics in software engineering
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

ACM Turing award lectures
A Coinduction Rule for Entailment of Recursively Defined Properties

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Semantic networks as abstract data types

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
How to facilitate the proof of theories by using the induction matching, and by generalization

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
On the completeness of the inductive assertion method

Journal of Computer and System Sciences
Program equivalence and context-free grammars

Journal of Computer and System Sciences
Completeness results for the equivalence of recursive schemas

Journal of Computer and System Sciences
Proof Methods for Corecursive Programs

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1

Quantified Score

Hi-index	48.28

Visualization

Abstract

There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference between the theoretical and practical approaches; second, presentation and examination of various known methods for proving properties of recursive programs. Discussed in detail are two powerful inductive methods, computational induction and structural induction, including examples of their applications.