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

Author(s):  
Paul C. Xirouchakis

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.

2003 ◽  
Vol 11 (4) ◽  
pp. 309-320 ◽  
Author(s):  
Douglas Gregor ◽  
Sibylle Schupp ◽  
David R. Musser

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.


1988 ◽  
Vol 11 (1) ◽  
pp. 49-63
Author(s):  
Andrzej Szalas

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.


1987 ◽  
Vol 22 (4) ◽  
pp. 103-110 ◽  
Author(s):  
J D Eckart

2007 ◽  
Vol 17 (3) ◽  
pp. 183-203 ◽  
Author(s):  
Borislav Nikolik ◽  
Dick Hamlet

Sign in / Sign up

Export Citation Format

Share Document