'Class graph' presentation slideshows

Traversal Strategies

Traversal Strategies. Specification and Efficient Implementation (Graph Theory of OOP/OOD). Introduction. Define subgraphs succinctly Define path sets succinctly Applications writing adaptive programs marshaling objects storing objects, persistent objects.

1.61k views • 159 slides

A Short Introduction to Adaptive Programming (AP) for Java Programmers

1.43k views • 120 slides

Software Development

Software Development. CSU 670 www.ccs.neu.edu/home/lieber/courses/csu670/sp04/sp04.html. Introduction. Software engineering, modeling, design, software architecture, software processes Programming languages Hands-on, practical, useful. Mottos. Two apparently conflicting mottos:

957 views • 72 slides

869 views • 69 slides

Pattern Language for Adaptive Programming (AP)

Pattern Language for Adaptive Programming (AP). Karl Lieberherr Northeastern University. Introduction. Four Patterns Structure-shy Traversal Selective Visitor Structure-shy Object Class Graph. On-line information. $D = www.ccs.neu.edu/research/demeter $D is Demeter Home Page

769 views • 66 slides

Pattern Language for Adaptive Programming (AP)

Pattern Language for Adaptive Programming (AP). Karl Lieberherr Northeastern University. Introduction. Five Patterns Structure-shy Traversal Selective Visitor Structure-shy Object Class Graph Growth Plan. On-line information. $D = www.ccs.neu.edu/research/demeter

678 views • 61 slides

577 views • 54 slides

660 views • 53 slides

Shyness in Programming

DEMETER. DHMHTRA. Shyness in Programming. Karl Lieberherr Demeter Research Group Northeastern University Boston. Coupling Aspect-Oriented and Adaptive Programming: Shyness in Programming. PhD Visitation Weekend 2003. Our Intuition behind AOP.

604 views • 47 slides

Structure and Interpretation of an Aspect Language for Datatype

523 views • 45 slides

Aspectual Collaborations

507 views • 40 slides

AP/DJ

498 views • 39 slides

Navigation in Object Graphs

Navigation in Object Graphs. Mitch Wand and Karl Lieberherr. Searching for Reachable Objects. Task: Given an object o1 of class c1 in an object graph, find all objects of type c2 that are reachable from o1.

393 views • 32 slides

David Evans cs.virginia/evans

Lecture 7: A Tale of Two Graphs (and a tree). David Evans http://www.cs.virginia.edu/evans. CS201J: Engineering Software University of Virginia Computer Science. Graph ADT. public class Graph { // OVERVIEW: // A Graph is a mutable type that

422 views • 30 slides

Graphs

Graphs. Eric Roberts CS 106B February 25, 2013. 1. 3. 4. 5. 2. Examples of graphs. Graph terminology. Designing the graph.h interface. Traversal strategies: depth-first and breadth-first search. Defining a graph in terms of sets. Outline. Examples of Graphs. Examples of Graphs.

373 views • 25 slides

John J. Sung TA Consulting

TraversalJ. John J. Sung TA Consulting. Motivation for TraversalJ. KL Enterprises identified AOP Enter into the AOP market early Add value by adding traversals to Java Contract COM 1205 Inc. TA Consulting Recommendations. High-Level System Overview. traversal.trv. TraversalJ.

329 views • 23 slides

AP Book View of AOP

AP Book View of AOP. AP Book = Adaptive Object-Oriented Software Development, published August 1995 by PWS. AP Book Definition. Definition of AOP: "Adaptive software is specified in terms of complementary, collaborating views, each one addressing a different concern of the application.".

218 views • 21 slides

Problem with Java and

Problem with Java and. how it causes a problem for DJ. Problem with Java and DJ. What is coming is not about a problem of DJ but about a problem with Java: the lack of parameterized classes.

218 views • 16 slides

Textual Visualization Plug-in for Eclipse

Textual Visualization Plug-in for Eclipse. Gong Jun CCIS Northeastern Univ 02/2004. What You Are Given. A detailed project description. An extended DJ Plug-in. Can be used to parse the Selector Language Lab exercises. What You Need to Do.

228 views • 14 slides

Class Graph

A. B. C. U. 0..1. D. X. R. S. E. F. Class Graph. Project Output. from A via X to F = {source:A -> X X ->target:F}. A. B. C. U. 0..1. Problem: Information loss: A B D E F not allowed!. D. X. R. S. E. F. Remember the copies in a traversal graph? Show them with colors.

190 views • 13 slides