Some ideas on data types in high-level languages
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Verifying Definite Iteration Over Data Structures
IEEE Transactions on Software Engineering
Verification of Definite Iteration over Hierarchical Data Structures
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Some classes of naturally provable programs
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Symbolic method of verification of definite iterations over altered data structures
Programming and Computing Software
Verification of finite iterations over collections of variable data structures
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
In order to eliminate loop invariants in the process of program verification, a new language construct called finite iteration over tuples of data structures is introduced. Simulation of such iterations by means of iterations over hierarchical data structures is described. This enables one to apply the symbolic verification method, which was developed earlier, to such iterations. The simulation also applies to the case of iterations over tuples of data structures that include a loop exit statement. A technique for deriving and proving correctness conditions based on the induction principles is described. For finite iterations over files, a problem-oriented technique for proving correctness conditions is proposed. By way of example, the verification of two programs designed for file processing is described.