ScholarLens Back to search
2020•2020 International Conference on Information Science and Communications Technologies (ICISCT)Requires access

Formalization of Data Derivative Structures

Rustam Vosilovich kabulov, Ortik Bakhtiyorovich Ruzibaev, Kuchkorov Temur Ataxanovich, Sanjar Saidqulovich Muminov

Open publisher page 0 citations

Abstract

The paper considers the topical issue of formal description of data structures. Data structures are widely used in modern object-oriented programming to solve various practical problems. The paper introduces functions for performing operations with such data structures as stack, queue, and priority queue. The conditions that these functions must satisfy are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and programmatic approaches were used.

About this research paper

What this paper is about

The paper considers the topical issue of formal description of data structures. Data structures are widely used in modern object-oriented programming to solve various practical problems. The paper introduces functions for performing operations with such data structures as stack, queue, and priority queue. The conditions that these functions must satisfy are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and programmatic approaches were used.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The paper considers the topical issue of formal description of data structures. Data structures are widely used in modern object-oriented programming to solve various practical problems. The paper introduces functions for performing operations with such data structures as stack, queue, and priority queue. The conditions that these functions must satisfy are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and programmatic approaches were used.

Key concepts: Axiom, Computer science, Abstract data type, Data structure, Data type, Queue, Theoretical computer science, Priority queue

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Formalization of Data Derivative Structures — Research Paper | ScholarLens