A system for classifying program verification methods: Assigning meanings to program verification methods

Authors:
Ali Mili;Jules Desharnais
Affiliations:
-;-
Venue:
ICSE '84 Proceedings of the 7th international conference on Software engineering
Year:
1984

Citing 13
Cited 1

Program verification using Ada

Program verification using Ada
Formalization of Properties of Functional Programs

Journal of the ACM (JACM)
An Introduction to Proving the Correctness of Programs

ACM Computing Surveys (CSUR)
Is Sometimes Ever Better Than Always?

ACM Transactions on Programming Languages and Systems (TOPLAS)
Is “sometime” sometimes better than “always”?: intermittent assertions in proving program correctness

Communications of the ACM
Symbolic execution and program testing

Communications of the ACM
The new math of computer programming

Communications of the ACM
Another recursion induction principle

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Princples of Computer Programming

Princples of Computer Programming
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Structured Programming; Theory and Practice the Systems Programming Series

Structured Programming; Theory and Practice the Systems Programming Series
Recursive definitions of partial functions and their computations

Recursive definitions of partial functions and their computations

Guaranteeing the Correctness of an Adaptive Tutoring System

AH '08 Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many program verification methods are known nowadays: Inductive Assertion Method, Invariant Assertion Method, Intermittent Assertion Method, Symbolic Execution Method, Subgoal Induction Method, Computational Induction Method, Structural Induction Method, Fixpoint Theory of Programs. This paper presents a simple classification of them.