A Knowledge-Based Approach to the Analysis of Loops
IEEE Transactions on Software Engineering
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
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
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
Verification of finite iterations over collections of variable data structures
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
To extend the application domain of the symbolic verification method, definite iterations over altered data structures, which are found to reduce to standard finite iterations, are introduced. The suggested reduction is applicable to definite iterations over altered data structures that contain an exit statement by a condition depending on the variables modified by the loop body. The suggested generalization of the symbolic method makes it applicable to verifying programs over pointers. To illustrate the discussion, the verification of two programs designed for processing linear lists-searching for an element with reordering and elimination of zero elements--is described.