Formalization of Properties of Functional Programs
Journal of the ACM (JACM)
Proving Theorems about LISP Functions
Journal of the ACM (JACM)
The new math of computer programming
Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
An interactive program verification system
Proceedings of the international conference on Reliable software
Automatic program verification I: a logical basis and its implementation.
Automatic program verification I: a logical basis and its implementation.
Generalizing specifications for uniformly implemented loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
ICS '95 Proceedings of the 9th international conference on Supercomputing
Constraint systems for useless variable elimination
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
A Comparative Analysis of Functional Correctness
ACM Computing Surveys (CSUR)
Derivation of Invariant Assertions During Program Development by Transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deriving Target Code as a Representation of Continuation Semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Compiler optimizations for scalable parallel systems
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Recursion in logics of programs
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Invariant inference for static checking:
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Invariant inference for static checking: an empirical evaluation
ACM SIGSOFT Software Engineering Notes
Partial Completeness of Abstract Fixpoint Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Applicative programming and digital design
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inference rules for program annotation
ICSE '78 Proceedings of the 3rd international conference on Software engineering
An approach to loop programs debugging
ACM SIGPLAN Notices
On readability of programs with loops
ACM SIGPLAN Notices
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
A method for automatically analyzing programs
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Mechanical inference of invariants for FOR-loops
Journal of Symbolic Computation
An abstract interpretation framework for termination
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 48.23 |
A proof method, subgoal induction, is presented as an alternative or supplement to the commonly used inductive assertion method. Its major virtue is that it can often be used to prove a loop's correctness directly from its input-output specification without the use of an invariant. The relation between subgoal induction and other commonly used induction rules is explored and, in particular, it is shown that subgoal induction can be viewed as a specialized form of computation induction. A set of sufficient conditions are presented which guarantee that an input-output specification is strong enough for the induction step of a proof by subgoal induction to be valid.