Reasoning about arrays

DOI10.1145/359104.359110zbMATH Open0394.68009OpenAlexW2037247941MaRDI QIDQ4176940FDOQ4176940

Authors: John C. Reynolds 

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359104.359110

zbMATH Keywords

PartitionsArraysMergingBinary SearchProgram Proving

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (8)

• Decision procedures for extensions of the theory of arrays
• Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
• Symbolic verification method for definite iteration over data structures
• Relation-algebraic verification of disjoint-set forests
• Heuristics for the dynamic facility layout problem with unequal-area departments
• An algebraic approach to the syntax and semantics of languages with subscripted variables
• Problem-oriented verification system and its application to linear algebra programs
• A note on Presburger arithmetic with array segments, permutation and equality

This page was built for publication: Reasoning about arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4176940)