A data abstraction alternative to data structure/algorithm modularization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1766, Issue , 2000, Pages 102-113

  Sitaraman, Murali ^a   Weide, Bruce W ^b   Long, Timothy J ^b   Ogden, William F ^b  

^a West Virginia University   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA ENCAPSULATION; MODULAR CONSTRUCTION; OBJECT ORIENTED PROGRAMMING; SOFTWARE ENGINEERING;

COMPUTER SCIENCE RESEARCH; DATA ABSTRACTION; INFORMATION HIDING; MODULARIZATIONS; OBJECT ORIENTED; SOFTWARE DECOMPOSITION; TIGHT COUPLING;

DATA HANDLING;

EID: 0005348565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39953-4_9     Document Type: Conference Paper

References (14)

1. Booch, G.: Software Components With Ada. Benjamin/Cummings, Menlo Park, CA (1987).
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge, MA (1990).
3. Flamig, B.: Practical Algorithms in C++. Coriolis Group Book (1995).
4. Heym, W.D., Long, T.J., Ogden, W.F., Weide, B.W.: Mathematical Foundations and Notation of RESOLVE, Technical Report OSU-CISRC-8/94-TR45, Dept. of Computer and Information Science, The Ohio State University, Columbus, OH, Aug 1994.
5. Meyer, B.: Object-Oriented Software Construction. 2nd edn. Prentice Hall PTR, Upper Saddle River, New Jersey (1997).
6. Mehlhorn, K., Naher, S.: “LEDA: A Library of Efficient Data Structures and Algorithms” Communications of the ACM 38, No. 1, January 1995, 96–102.
7. Musser, D. R., Saini, A.: STLT utorial and Reference Guide. Addison-Wesley Publishing Company (1995).
8. Parnas, D.L.: “On the criteria to be used in decomposing systems into modules.” Communications of the ACM 15, No. 12, December 1972, 1053–1058.
9. Rushby, J., Owre, S., and Shankar, N.: “Subtypes for Specification: Predicate Subtyping in PVS,” IEEE Transactions on Software Engineering 24, No. 9, September 1998, 709-720.
10. Sitaraman, M., Weide, B.W. (eds.): “Special Feature: Component-Based Software Using RESOLVE.” ACM SIGSOFT Software Engineering Notes 19, No. 4, October 1994, 21–67.
11. Sitaraman, M: “Impact of Performance Considerations on Formal Specification Design,” Formal Aspects of Computing 8, 1996, 716–736.
12. Sitaraman, M. Weide, B.W., Ogden, W.F.: “On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations,” IEEE Transactions on Software Engineering 23, No. 3, March 1997, 157–170.
13. Weide, B.W., Ogden, W.F., Sitaraman, M.: “Recasting Algorithms to Encourage Reuse,” IEEE Software 11, No. 5, September 1994, 80–89.
14. Weihe, K.: “Reuse of Algorithms: Still A Challenge to Object- Oriented Programming,” ACM SIGPLAN OOPSLA Proceedings, 1997, 34–46.