Introduction to algorithms
Advances in computers
Component-based software using RESOLVE
ACM SIGSOFT Software Engineering Notes
On the criteria to be used in decomposing systems into modules
Communications of the ACM
Design and Specification of Iterators Using the Swapping Paradigm
IEEE Transactions on Software Engineering
On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations
IEEE Transactions on Software Engineering
A framework for application generator design
Proceedings of the 1997 symposium on Software reusability
WISR8: 8th annual workshop on software reuse: summary and working group reports
ACM SIGSOFT Software Engineering Notes
An Empirical Study of Software Reuse with Special Attention to Ada
IEEE Transactions on Software Engineering
Formal specification of COTS-based software: a case study
SSR '99 Proceedings of the 1999 symposium on Software reusability
IEEE Transactions on Software Engineering
Experience report: using RESOLVE/C++ for commercial software
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
A software engineering perspective on algorithmics
ACM Computing Surveys (CSUR)
A system for predictable component-based software construction
High integrity software
Algorithms and object-oriented programming: bridging the gap
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
A Data Abstraction Alternative to Data Structure/Algorithm Modularization
Selected Papers from the International Seminar on Generic Programming
A Framework for Detecting Interface Violations in Component-Based Software
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Modelling Formal Integrated Component Retrieval
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Multiple implementations for component based software using Java interfaces
Journal of Computing Sciences in Colleges
Issues in performance certification for high-level automotive control software
SEAS '05 Proceedings of the second international workshop on Software engineering for automotive systems
Hi-index | 0.00 |
Instead of viewing algorithms as single large operations, the authors use a machine-oriented view to show how they can be viewed as collections of smaller objects and operations. Their approach promises more flexibility especially in making performance trade-offs, and encourages black-box reuse. They recommend black-box reuse because the real value of reused code lies in its properties, such as correctness with respect to an abstract specification. If you make even small structural or environmental changes, the confidence in these properties tends to evaporate, and with it most of the component's value. They show how to design an entire category of more flexible black-box reusable software components by applying a general design technique that recasts algorithms as objects. To illustrate the technique, they recast a sorting algorithm and a spanning-forest algorithm into objects.