Constraint D

1
(No Transcript)
2
(No Transcript)
3
(No Transcript)
4
(No Transcript)
5

• Constraint D
• Property D defines set of join points
• mathematical structure choose graph structure.
  D defines subgraph (sets of nodes and edges)
• Base program and graph structure graph is
  abstraction of program.

6

• D defines subgraph for some graph associated with
  program P.
• D restricts with what programs P it may be used.

7
DJ as aspect-oriented example

• constraints, properties