Proving Properties of Complex Data Structures

DOI10.1145/321941.321957zbMATH Open0326.68019OpenAlexW1967455278MaRDI QIDQ4091436FDOQ4091436

Authors: Ben Wegbreit, Jay Spitzen 

Publication date: 1976

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

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

Recommendations

• Data abstraction: a general framework to handle program verification of data structures
• Proving properties of programs on hierarchical nominative data
• scientific article; zbMATH DE number 4070286
• Constructing a theory of a data structure as an aid to program development
• Correctness proofs for abstract implementations

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (1)

• A view of computability on term algebras

This page was built for publication: Proving Properties of Complex Data Structures

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