The Formal Design Models of a Set of Abstract Data Types (ADTs)

Type theories are fundamental for underpinning data object modeling and system architectural design in computing and software engineering. Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. ADTs also play a key role in Object-Oriented (OO) technologies for software system design and implementation. This paper presents a formal modeling methodology for ADTs using the Real-Time Process Algebra (RTPA), which allows both architectural and behavioral models of ADTs and complex data objects. Formal architectures, static behaviors, and dynamic behaviors of a set of ADTs are comparatively studied. The architectural models of the ADTs are created using RTPA architectural modeling methodologies known as the Unified Data Models (UDMs). The static behaviors of the ADTs are specified and refined by a set of Unified Process Models (UPMs) of RTPA. The dynamic behaviors of the ADTs are modeled by process dispatching technologies of RTPA. This work has been applied in a number of real-time and non-real-time system designs such as a Real-Time Operating System (RTOS+), a Cognitive Learning Engine (CLE), and the automatic code generator based on RTPA.

Download Full-text

The Formal Design Models of a Set of Abstract Data Types (ADTs)

Breakthroughs in Software Science and Computational Intelligence ◽

10.4018/978-1-4666-0264-9.ch016 ◽

2012 ◽

pp. 288-315

Author(s):

Yingxu Wang ◽

Xinming Tan ◽

Cyprian F. Ngolah ◽

Philip Sheu

Keyword(s):

Real Time ◽

Cognitive Learning ◽

Process Models ◽

Behavioral Models ◽

Abstract Data Types ◽

Data Types ◽

Dynamic Behaviors ◽

Modeling Methodology ◽

Abstract Data ◽

Data Objects

Download Full-text

Tree-Shaped Formats of Address Programming Language

NaUKMA Research Papers Computer Science ◽

10.18523/2617-3808.2021.4.78-87 ◽

2021 ◽

Vol 4 ◽

pp. 78-87

Author(s):

Yury Yuschenko

Keyword(s):

Programming Languages ◽

Programming Language ◽

Theoretical Research ◽

Direct Access ◽

Complex Data ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data ◽

The One ◽

High Level

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

Download Full-text

The Formal Design Model of Doubly-Linked-Circular Lists (DLC-Lists)

Advances in Abstract Intelligence and Soft Computing ◽

10.4018/978-1-4666-2651-5.ch015 ◽

2013 ◽

pp. 214-230

Author(s):

Yingxu Wang ◽

Cyprian F. Ngolah ◽

Xinming Tan ◽

Phillip C.Y. Sheu

Keyword(s):

Real Time ◽

Code Generation ◽

System Modeling ◽

Finite Sequence ◽

Process Models ◽

Behavioral Models ◽

Data Types ◽

Abstract Data ◽

Automatic Code ◽

Formal Design

Abstract Data Types (ADTs) are a set of highly generic and rigorously modeled data structures in type theory. Lists as a finite sequence of elements are one of the most fundamental and widely used ADTs in system modeling, which provide a standard encapsulation and access interface for manipulating large-volume information and persistent data. This paper develops a comprehensive design pattern of formal lists using a doubly-linked-circular (DLC) list architecture. A rigorous denotational mathematics, Real-Time Process Algebra (RTPA), is adopted, which allows both architectural and behavioral models of lists to be rigorously designed and implemented in a top-down approach. The architectural models of DLC-Lists are created using RTPA architectural modeling methodologies known as the Unified Data Models (UDMs). The behavioral models of DLC-Lists are specified and refined by a set of Unified Process Models (UPMs) in three categories namely the management operations, traversal operations, and node I/O operations. This work has been applied in a number of real-time and nonreal-time system designs such as a real-time operating system (RTOS+), a file management system (FMS), and the ADT library for an RTPA-based automatic code generation tool.

Download Full-text

Specification of abstract data types using real-time process algebra (RTFA)

CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436) ◽

10.1109/ccece.2003.1226136 ◽

2004 ◽

Cited By ~ 1

Author(s):

X. Tan ◽

Yingxu Wang

Keyword(s):

Real Time ◽

Process Algebra ◽

Time Process ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data

Download Full-text

Abstract data types for the logical modeling of complex data

Information Systems ◽

10.1016/0306-4379(91)90020-a ◽

1991 ◽

Vol 16 (6) ◽

pp. 565-583 ◽

Cited By ~ 23

Author(s):

M Gargano ◽

E Nardelli ◽

M Talamo

Keyword(s):

Complex Data ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data ◽

Logical Modeling

Download Full-text

Abstract data types in industrial real time basic

Real Time Control of Large Scale Systems - Lecture Notes in Control and Information Sciences ◽

10.1007/bfb0008325 ◽

2005 ◽

pp. 448-456

Author(s):

G. M. Bull

Keyword(s):

Real Time ◽

Abstract Data Types ◽

Data Types ◽

Abstract Data

Download Full-text

Towards the Temporal Approach to Abstract Data Types

Fundamenta Informaticae ◽

10.3233/fi-1988-11105 ◽

1988 ◽

Vol 11 (1) ◽

pp. 49-63

Author(s):

Andrzej Szalas

Keyword(s):

Temporal Logic ◽

Abstract Data Types ◽

Data Types ◽

First Order ◽

Abstract Data ◽

Order Completeness ◽

General Method

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Download Full-text