Home > Articles > Programming

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

Mistake 2: Imprecise loops

When you tie both ends of a loop together you can easily miss- specify the constraints that determine which instances are allowed to interconnect. Consider a university that requires Students to choose an advisor among Professors who work in the same Department as the Student's declared major. Does the following model satisfy this requirement?

Model 7.6Model 7.6

As drawn, Model 7.6 places no restriction on the Student's choice of an advising Professor. This is easier to see if we populate our model with some example instances.

Figure 7.1Figure 7.1

In an unconstrained loop instances may be linked across one association without regard to links along other associations. Model 7.6 works for a university where a Student may select an advisor without regard to whether or not the selected Professor is on the staff of the Student's major Department. But that doesn't match the requirement at our university!

We need to constrain the loop to get the following result:

Figure 7.2Figure 7.2

In this constrained loop, an instance of Student may link across R2 to a subset of Professor instances. The subset of allowable Professor instance selections is defined by links along R1. This would also work if Professors do the selecting. In that case an instance of Professor could link along R2 to one or more instances of Student within a subset defined by an existing link across R3.

In fact, you can start anywhere you like in the loop and the constraint holds. Let's consider an unlikely case just to prove the point. Say that an instance of Professor, Phillip, plans to advise a particular Student, Terrance, in the physics department. So we start with an instance of Professor and we want to link to an instance of Department across R1. If Phillip wants to be Terrance's advisor, he must be hired in the Department selected by tracing the opposite way around the loop R2->R1.

How do we express this constraint on the class diagram? First we must define the loop. We can do this with an expression like R1+R2+R3. Secondly, we need to say that the loop is of the constrained variety.

Model 7.6 is annotated below to reflect the constraint on the loop.

Model 7.7Model 7.7

In Model 7.7 we see that the loop has been defined and placed inside {} braces to indicate the constraint. Since there is no obvious place on a loop to hang this constraint, we just hang it on one of the associations in the loop, R2 in this case. It would be perfectly legal and mean the same thing if we had placed the constraint on R1 or R3 instead.

Nonetheless, we choose to put the constraint on R2 because, most likely, that's where potential links will need to validate themselves against the constraint before being created. Professors will be hired by Departments prior to taking on Students. Students may select majors prior to selecting advisors. Students with declared majors will then be restricted when they go looking for potential advisors. Of course, nothing in the class diagram prevents a Student from first selecting an advisor and then a major. If you think this is more likely to happen, then put the loop constraint on R3. The choice of where to hang the constraint is an issue of clarity. As long as you put it on one of the paths in the loop you're okay.

Enforcement of the constraint

The constraint notation on the loop is nothing more than that. Notation. In Executable UML, notation must have a deeper meaning to result in real code. In my project experience so far, we have expressed constraints in the procedure models in proprietary1 action language. The procedure that creates a link along R2 or R3 would have to ensure that only valid instances were linked.

In the near future, we anticipate the use of statements written in OCL (Object Constraint Language). These statements could then be processed to generate the required action language or target code.

Unconstrained loops are not necessarily bad

There is nothing wrong with an unconstrained loop as long as it accommodates the requirements precisely. If our university changes its rules so that a Student may choose any Professor as an advisor, regardless of major, then Model 7.6 becomes the correct model. The analyst must understand the application in enough detail to specify the correct level of constraint on all loops.

Now let's take a look at more examples of loop constraints. We'll examine a simple loop involving only one association and then look at a more complex pattern involving multiple loops.

Single loop

Imagine we model a scripting language where a Script consists of sequentially executing Steps.

Model 7.8Model 7.8

Should the R4 loop be constrained? In the unconstrained case any instance of Step could be linked to execute before or after any other instance of Step. But that wouldn't make sense, since execution order is defined local to each Script. In other words, Steps are ordered within a single Script. We wouldn't want the "Power Laser OFF" step in the "Laser Diagnostic" script to be followed by the "Align Platform" step in the "Scan Wafer" script followed by the "Power Laser ON" step in the "Laser Diagnostic" script.

Figure 7.3Figure 7.3

So the constraint on R4 is this: "An instance of Step may execute after or before another instance of Step in the same Script". Furthermore, an instance of Step must execute after a step other than itself.

The necessary constraints can be illustrated in a set diagram:

We can see from Figure 7.4 that links along R1 partition the set of Steps since every Step belongs to exactly one Script. When a link on R4 is created, it originates from one instance of Step and terminates on another instance of Step in the same R1-partitioned subset.

Figure 7.4Figure 7.4

The notation in Model 7.9 below places the appropriate constraints on R4.

Model 7.9Model 7.9

As a matter of style, when more than one constraint appears on an association, I proceed from the general to the specific. A link along R4 may connect to the subset defined by an existing link on R1 and then only to those instances in that subset that do not include the origin instance.

  • + 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