Home > Articles > Software Development & Management

  • Print
  • + Share This
This chapter is from the book

Further Reading

In this chapter we discussed pattern composition approaches that we believe could belong to the behavioral composition or the structural composition categories. We selected some sample techniques, and presented a surface discussion about the concepts and models used by each technique.

Dong, Alencar, and Cowan of the University of Waterloo, Ontario, Canada, developed an approach for behavioral analysis to pattern-based composition [Dong et al. 2001]. They rely upon Prolog and model-checking techniques to analyze the composition and integration of design components. They discuss how to represent, instantiate, and integrate design components and how to find design composition errors. The approach is based on a structural and behavioral specification of the design components based on UML class diagrams and collaborations diagrams, respectively. The class diagrams are used to represent structural evolution of design components that are transformed into Prolog representation. Thus, the design components and their compositions are represented as a logic model. The behavioral specifications are transformed into process algebra representations in which case the behavioral properties of these components are represented as logic formulas. A model checker is then used to verify the properties of the design—that is, to verify that the logic formulas hold in the design model. This approach can be useful when the transformation activity can be automated, which is possible when formal descriptions of patterns are available.

Alencar and his group led a thorough research on the formal specification of pattern behavior, discussed in their latest work [Dong et al. 2001]. Formal specification of pattern behavior as well as pattern relationships are not considered composition mechanisms; however, they can provide assistance in analyzing a pattern composition approach.

A study by Motoshi Saeki of the Tokyo Institute of Technology, Japan, provides a technique to define the behavior of design patterns based on the formal description technique LOTOS (Language of Temporal Ordering Specification). The LOTOS simulation facility is used to check the behavioral consistency of combined patterns. The technique again is dependent on transforming patterns behavioral specifications into LOTOS, which is also related to formal models of patterns [Saeki 2000].

The above studies clearly show the importance of reasoning about the behavior of individual patterns and the behavior of pattern compositions using a formal technique. Although such techniques are useful in analyzing pattern participants and their interactions and to possibly detect inconsistencies, they do not provide a practical easy-to-use approach to compose patterns that can be used by an OO software designer.

The OOram approach is illustrated in the book by Reenskaug [Reenskaug 1996] with examples from real-world applications. The role models are incorporated in the collaboration diagrams of UML and in the metamodel as classifierRole [UML 2002]. For updates on the integration of role modeling approach into UML refer to Reenskaug's homepage, http://heim.ifi.uio.no/~trygver/

The notions of role and architectural fragment and their corresponding role and architecture language construct in LayOM that allow for reusable first-class specification of architectural fragments is discussed in Bosch's Specifying Frameworks and Design Patterns as Architecture Fragments (1998c). The LayOM language by itself is discussed in Bosch's Design Patterns as Language Constructs (1998b). The application of the architecture fragment technique and superimposition to the domain of measurement systems in production lines is discussed in Bosch's An Object-Oriented Framework for Measurement Systems (1998a). The superimposition mechanism is discussed in Bosch's Superimposition: A Component Adaptation Technique (1999).

For more discussion on modeling patterns using role diagrams and examples from the GoF patterns, refer to Riehle's Describing and Composing Patterns Using Role Diagrams (1996). Composite design patterns, their relationships to design frameworks, and details about the process of driving them from concrete applications are discussed in Riehle and Züllighoven's Understanding and Using Patterns in Software Development (1996) and Riehle's Composite Design Patterns (1997).

In summary, Reenskaug (1996) recognizes roles as analysis mechanisms helpful in developing application designs. Riehle (1997) recognizes roles as composition mechanisms to derive composite design patterns. Kristensen and Osterbye (1996) use roles as first-class conceptual modeling elements from which objects can be derived and therefore classes can be deduced. In their roots, most of the behavior composition approaches stem from the basic concepts of a role, role models, and role diagrams.

Helm and colleagues (1990) describe an approach that uses contracts to compose objects based on their behavior. Contracts provide a formal semantics to describe the mutual obligations between classes of objects. Design by Contract was introduced by Meyer (1992) as an approach to construct software applications. In this approach, the designer focuses on describing the responsibilities of each design class by formally defining the conditions that should be met prior to using any function or service provided by that class. In addition, a class will provide a formal description of the output of each function or service and how the service changes the application state.

A contract is used to link the function caller (or client) with the function implementation (the contractor). A common way to define a software contract is through the use of preconditions, postconditions, and invariants. Boolean assertions can then be made to determine if a precondition is met before invoking a service, a postcondition is satisfied after the service is invoked (and hence the service is successful), or a class invariant has not changed during the operation. In this case, a contract between the requester and the provider will define the mutual obligations. A client can use a particular service only if the preconditions for the service are met and the class invariants are respected. The provider promises to provide the service and the work defined in the postconditions; in addition, the class invariants will be respected.

Contracts are useful means to formally define the relationship between classes, since they capture all the possible interactions between instances of those classes as well as the runtime conditions required to perform an interaction. They can also be used as means to validate the runtime interactions between objects and discover any violations (interactions not defined in the contract, or pre-condition and post-condition violations).

Jezequel and colleagues (2000) describe how to use contracts to specify the set of design patterns defined in the GoF book. They use the notion of contracts to explicitly describe the intention behind a design pattern in terms of formally capturing the participating objects, their collaborations, and the distribution of responsibilities. They use the Eiffel language to specify a contract for each of the GoF patterns. Although this work mainly focuses on specifying a contract for each pattern that formally defines the responsibilities between pattern participants, the ideas are extensible and useful in pattern composition. For instance, if each pattern is captured by a contract between its participants, can we combine two or more contracts to define a composition of two patterns? Is there a way to present a contract that defines the composition? The answers to these questions can possibly be used to define a behavioral composition technique to compose design patterns. Whereas gluing objects (classes) together using patterns has received thorough investigation in the last decade, gluing patterns together using contracts is still a research topic that has not been exhaustively studied.

In this chapter we also discussed pattern composition approaches that we believe could belong to the structural composition category. We selected some sample techniques and presented a surface discussion about the concepts and models used by each technique.

For more information about the Catalysis approach, refer to D'Souza and Wills's Objects, Components, and Frameworks With UML: The Catalysis Approach (1998), which contains a complete guide to the process and the detailed models and steps. For aspect-oriented design and programming, the latest works by Clarke and colleagues (2000; 2001) provide pointers to its techniques and tools.

The two approaches that we consider closely relevant to POAD are the work by Keller and Schauer, Design Components: Towards Software Composition at the Design Level (1998), and by Larsen in Designing Component-Based Frameworks Using Patterns in the UML(1999). Keller introduces the concept of software design using design components, which are quite different from the well-known concepts of implementation and physical components. The patterns used in POAD are in fact design components, as discussed in Chapter 4. Larsen introduces the concept of interfaces for design patterns and using those interfaces to develop interfaces for a design framework. The concept of interfaces for design patterns is an important technique that POAD uses to glue design patterns together.

Xavier Castellani and Stephan Y. Liao (1998) propose an application development process that focuses on the reuse of OO application design. Their work presents a process that allows the system designer to create generic applications and reuse them in other application designs in the same problem domain. The approach starts with an existing application, then abstracts design macrocomponents through the abstraction of application-specific design components. The authors use a general definition of macrocomponents (frameworks or patterns) that allows any group of related classes to be considered a pattern.

  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020