Verification of finite iterations over collections of variable data structures
From MaRDI portal
Recommendations
- Symbolic method of verification of definite iterations over altered data structures
- Verification of a finite iteration over data structures
- Synthesis of the programmed functions offor loops on data structures
- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs
- Symbolic verification method for definite iterations over tuples of altered data structures
Cites work
- scientific article; zbMATH DE number 1612488 (Why is no real title available?)
- scientific article; zbMATH DE number 3833275 (Why is no real title available?)
- scientific article; zbMATH DE number 1534590 (Why is no real title available?)
- scientific article; zbMATH DE number 1841809 (Why is no real title available?)
- scientific article; zbMATH DE number 2090151 (Why is no real title available?)
- An axiomatic basis for computer programming
- Symbolic method of verification of definite iterations over altered data structures
- Symbolic verification method for definite iteration over data structures
- Verification of Array, Record, and Pointer Operations in Pascal
Cited in
(4)- Symbolic verification method for definite iterations over tuples of altered data structures
- Verification of finite iterations over tuples of data structures
- Verification of mutable linear data structures and iterator-based algorithms in Dafny
- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs
This page was built for publication: Verification of finite iterations over collections of variable data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467973)