Algorithmic data structure algebras and multilevel program design

MaRDI QIDQ1087007zbMATH OpenFDO

Authors G. E. Tsejtlin

Publication date 1986

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

abstract data typealgorithmic algebrasGlushkov's systems

Mathematics Subject Classification ID

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

Review text

We consider data structure algebras obtained as a result of appropriate interpretation of Glushkov's systems of algorithmic algebras and their modifications. The proposed formalism is applied to refine the concept of abstract data type used in modern programming languages.

Recommendations

• Formalization of interrelations between operators and data within the framework of an extended algebra of algorithms
• scientific article; zbMATH DE number 962431
• On algebras of algorithms and specifications over uninterpreted data
• Structural models of algorithms in problems of applied programming. I: Formal algorithmic structures
• Data based algorithmic algebra

Cited in

(15)

• Formalization of interrelations between operators and data within the framework of an extended algebra of algorithms
• Structural models of algorithms in problems of applied programming. I: Formal algorithmic structures
• On algebras of algorithms and specifications over uninterpreted data
• scientific article; zbMATH DE number 3870580 (Why is no real title available?)
• Reduction definition of problems of matrix algebra
• scientific article; zbMATH DE number 3896277 (Why is no real title available?)
• Data based algorithmic algebra
• scientific article; zbMATH DE number 2169228 (Why is no real title available?)
• Hybrid Data Structures Defined by Indirection
• scientific article; zbMATH DE number 3894455 (Why is no real title available?)
• Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
• scientific article; zbMATH DE number 962431 (Why is no real title available?)
• Use of the method of formalized technical assignments for the program designs for processing data structures
• A formal model of data structures and abstract algorithms for multiprocessor computer systems
• The formalism underlying EASYMAP: A precompiler for refinement-based exploration of hierarchical data organizations

This page was built for publication: Algorithmic data structure algebras and multilevel program design

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