Verification of a finite iteration over data structures

DOI10.1007/BF02733424zbMath0956.68085OpenAlexW1999371320MaRDI QIDQ1974308

V. A. Nepomnyashchij

Publication date: 7 May 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02733424

zbMATH Keywords

symbolic method of verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Verification of file manipulation programs in the language PASCAL
• Problem-oriented knowledge bases and their application in the program verification system SPEKTR
• Verification of linear algebra programs in the SPEKTR system
• Some ideas on data types in high-level languages
• Generalizing specifications for uniformly implemented loops
• An axiomatic basis for computer programming
• A note on the for statement

This page was built for publication: Verification of a finite iteration over data structures