Symbolic verification method for definite iterations over tuples of altered data structures and its application to pointer programs

Authors:
Valery Nepomniaschy
Affiliations:
A.P. Ershov Institute of Informatics Systems, Russian Academy of Sciences, Novosibirsk, Russia
Venue:
Pillars of computer science
Year:
2008

Citing 16
Cited 0

Problem-oriented verification system and its application to linear algebra programs

Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
A Knowledge-Based Approach to the Analysis of Loops

IEEE Transactions on Software Engineering
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of Array, Record, and Pointer Operations in Pascal

ACM Transactions on Programming Languages and Systems (TOPLAS)
Some ideas on data types in high-level languages

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Structured Programming; Theory and Practice the Systems Programming Series

Structured Programming; Theory and Practice the Systems Programming Series
Verification of Finite Iterations over Tuples of Data Structures

Programming and Computing Software
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
Problem-Oriented Means of Program Specification and Verification in Project SPECTRUM

DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Synthesizing Certified Code

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Proving Pointer Programs in Hoare Logic

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Structured Programming: Retrospect and Prospect

IEEE Software
Towards practical proofs of class correctness

ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

The symbolic method for verifying definite iterations over hierarchical data structures without loop invariants is extended to allow tuples of altered data structures and the termination statement which contains a condition depending on variables modified by the iteration body. Transformations of these generalized iterations to the standard ones are proposed and justified. A technique for generating verification conditions is described. The generalization of the symbolic verification method allows us to apply it to pointer programs. As a case study, programs over doubly-linked lists are considered. A program that merges in-place ordered doubly-linked lists is verified by the symbolic method without loop invariants.