Verification of finite iterations over collections of variable data structures

Authors:
V. A. Nepomniaschy
Affiliations:
A. P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Science, Novosibirsk, Russia
Venue:
Cybernetics and Systems Analysis
Year:
2007

Citing 12
Cited 0

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)
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
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
Symbolic method of verification of definite iterations over altered data structures

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

To extend the application domain of the symbolic verification method, finite iterations over collections of variable data structures are introduced and reduced to standard finite iterations. This reduction is extended to finite iterations including the break statement. The generalization of the symbolic method allows applying it to pointer program verification.