scholarly journals Design Patterns for Library Optimization

2003 ◽  
Vol 11 (4) ◽  
pp. 309-320 ◽  
Author(s):  
Douglas Gregor ◽  
Sibylle Schupp ◽  
David R. Musser
Keyword(s):  
Design Pattern ◽  
Design Patterns ◽  
Object Oriented ◽  
Abstract Data Types ◽  
Data Types ◽  
Software Libraries ◽  
Abstract Data ◽  
High Level ◽  
Very High

We apply the notion of design patterns to optimizations performed by designers of software libraries, focusing especially on object-oriented numerical libraries. We formalize three design patterns that we have abstracted from many existing libraries and discuss the role of these formalizations as a tool for guiding compiler optimizers. These optimizers operate at a very high level that would otherwise be left unoptimized by traditional optimizers. Finally, we discuss the implementation of a design pattern-based compiler optimizer for C++ abstract data types.

scholarly journals Tree-Shaped Formats of Address Programming Language

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.

The Design of Object-Oriented Software for the Representation of Mechanical Parts

1992 ◽  
Author(s):  
Paul C. Xirouchakis
Keyword(s):  
Object Oriented ◽  
Abstract Data Types ◽  
Data Types ◽  
Mechanical Parts ◽  
Mechanical Part ◽  
Construction Techniques ◽  
Software Specifications ◽  
Abstract Data ◽  
Software Construction ◽  
Semantic Properties

Abstract The objective of this paper is to present a design of the software for the representation of a simple mechanical part using object oriented software construction techniques. The object oriented method of software construction is particularly suitable for representing complex mechanical parts, their dimensions and tolerances since modular and reusable software can then be obtained. The focus of this paper is to demonstrate through a simple example the software quality advantages that are obtained when abstract data types are used to describe classes of objects. The notion of inheritance is employed to show how a general software architecture can be designed for mechanical part representation. Finally, the Eiffel language is utilized as a design and specification tool to write the software specifications for the simple example studied. The software specification is developed using the axioms notion of the theory of abstract data types to specify the semantic properties of the object oriented software.

Towards the Temporal Approach to Abstract Data Types

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.

Iteration and abstract data types

1987 ◽  
Vol 22 (4) ◽  
pp. 103-110 ◽  
Author(s):  
J D Eckart
Keyword(s):  
Abstract Data Types ◽  
Data Types ◽  
Abstract Data
Sign in / Sign up

Export Citation Format

Share Document