2002 · 32 citations · 14 references
ComputingComputer ScienceFormal MethodsInformation RetrievalSystems ArchitectureComponent-based Software EngineeringLibrary ConstructionSoftware ReuseSpecification LanguagesTechnical SpecificationsComponent ReuseComponent SpecificationsMatchingModule ReuseReusable Software ArchitectureSoftware Component Reuse
Formal specifications have been proposed as a basis for accessing reusable components from libraries, and various fine-grained specification-matching approaches have been developed to assist in searching libraries. Typically, however, the granularity of matching has been too fine for reuse to be effective. Compounding the problem is the fact that coarse-grained items usually require adaptation before reuse. The paper explains some of the problems and presents a generic solution to a key problem: adaptation of modules through parameter instantiation and subsetting. It shows how unit-matching strategies can be lifted to module level in a generic fashion.
14
A theory of type polymorphism in programming
Robin Milner · Journal of Computer and System Sciences · 1978 · 2.2K citations · Full text
The B-book: assigning programs to meanings
Choice Reviews Online · 1997 · 2.1K citations
The Z notation: A reference manual
Jan Madey · Science of Computer Programming · 1990 · 561 citations