Augmentation of object-oriented programming by concepts of abstract data type theory: the ModPascal experience

This article approaches scientific software architecture from three analytical paths. Each path examines discrete time advancement of multiphysics phenomena governed by coupled differential equations. The new object-oriented Fortran 2003 constructs provide a formal syntax for an abstract data type (ADT) calculus. The first analysis uses traditional object-oriented software design metrics to demonstrate the high cohesion and low coupling associated with the calculus. A second analysis from the viewpoint of computational complexity theory demonstrates that a more representative bug search strategy than that considered by Rouson et al. (ACM Trans. Math. Soft.34(1) (2008)) reduces the number of lines searched in a code with λ total lines from O(λ2) to O(λ log2λ ), which in turn becomes nearly independent of the overall code size in the context of ADT calculus. The third analysis derives from information theory an argument that ADT calculus simplifies developer communications in part by minimizing the growth in interface information content as developers add new physics to a multiphysics package.

Download Full-text

Algebraic specification of abstract data type and transition graphs: formal techniques for object-oriented analysis, specification and design

1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century ◽

10.1109/icsmc.1995.538040 ◽

2002 ◽

Author(s):

R. Guetari ◽

A. Haurat

Keyword(s):

Object Oriented ◽

Data Type ◽

Algebraic Specification ◽

Abstract Data Type ◽

Abstract Data ◽

Transition Graphs ◽

Formal Techniques ◽

Object Oriented Analysis

Download Full-text

Realizes Data Structure and the Algorithm Dynamic Synchronized Visualization

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.130-134.2068 ◽

2011 ◽

Vol 130-134 ◽

pp. 2068-2071 ◽

Cited By ~ 1

Author(s):

Xiao Bo Yang ◽

Bang Ze Chen

Keyword(s):

Data Structure ◽

Dynamic Characteristics ◽

Graphical Representation ◽

Object Oriented ◽

Data Type ◽

Abstract Data Type ◽

Graph Processing ◽

Interactive Simulation ◽

Abstract Data ◽

Computer Graph

Data structure and the algorithm teaching difficulty lies in their abstractness and the dynamic, teaches in the classroom uses the graphical representation to be possible to melt to a certain extent as intuitively, but very difficult to unfold the object the instantaneous dynamic characteristics and the algorithm dynamic implementation. This article utilizes the visualization programming technology, object-oriented technical and the computer graph processing technology carries on the dynamic interactive simulation track to the typical algorithm, has realized the abstract construction of data and the algorithm dynamic synchronization visualization. Each kind of abstract data type (ADT) definition and realization concise clear, vivid direct-viewing show abstract data structure, adequately demonstrate classical algorithm dynamic and execution detail process.

Download Full-text