<slideshow style="bitplan" headingmark="⌘⌘" incmark="…" scaled="true" font="Comic Sans MS, Calibri, cursive" >

title

Graph Approaches for Software Engineering
author
Wolfgang Fahl Wolfgang Fahl info@bitplan.com
footer
Applying the OpenSource Project SimpleGraph and it's modules to Software Engineering
subfooter
sebis Oberseminar TUM

</slideshow>

⌘⌘ Wolfgang Fahl

Peugeot Ion
Peugeot Ion 		Giant Explore
Giant Explore

⌘⌘ Touchable Software Engineering

https://www.flanschen-fitting-shop.de/1030-tm_large_default/schraube-m10x35.jpg

⌘⌘ The World as a Graph

If the world is represented as a Graph it would be nice to have a Simple Graph Navigation Language

see SMWCon Fall 2018

⌘⌘ Why I am here

⌘⌘ Prehistory

see also PreHistory (clickable)

⌘⌘ Graph Kernels for Model Driven Software Engineering

5 Steps

  1. Decide how the model should be encoded into a graph
  2. Translate each of the models into a labeled graph
  3. Select the graph kernel algorithm to be used
  4. Load all the graphs and compute the graph kernel
  5. Exploit the information in the kernel matrix

⌘⌘ Use SimpleGraph for the 5 Steps


⌘⌘ Step 1: Decide how the model should be encoded into a graph

Each SimpleGraph Module transforms data from some API to a Graph representation. The transformation is usually as "straight-forward" or "natural" as possible.

⌘⌘ Step 2: Translate each of the models into a labeled graph

Each SimpleGraph Module uses the following steps to translate from an API to the graph

  1. connect()
  2. moveTo()

⌘⌘ Step 3: Select the graph kernel algorithm to be used

SimpleGraph is based on Apache Gremlin/Tinkerpop so all the algorithm and libraries around this graph environment are directly available. If a different graph kernel and or algorithm is needed than the graph can be translated / imported via standard graph import/export formats and or import/export adapters and utilities.

BITPlan e.g. often uses Semantic MediaWiki as a suitable environment.

⌘⌘ Step 4: Load all the graphs and compute the graph kernel

Simplegraph is based on the Hub&Spoke approach. Any combination of modules/API can be applied. Currently there are some 20 different modules to choose from.

⌘⌘ Step 5: Exploit the information in the kernel matrix

There are two modes for exploiting the information:

  1. OLAP - Online Analytical Processing / Graph Query
  2. OLTP - Online Transaction Processing / Graph Traversal

⌘⌘ What is SimpleGraph?

Simplegraph allows to work with "graphized" information source from a combination of APIs that are made available as modules.

Module System wrapped API exposed Description
File:Folder.svg FileSystem FileSystem java.io.File makes your FileSystem accessible via the Java FileSystem API
GitHub GitHub GitHub GraphQL Api v4 makes GitHub content accessible to Graph processing.
Java Java javaparser makes Java code parse results accessible to Graph processing.
File:Email Icon.svg Mail Mail E-Mail access for rfc822 and MIME formatted Mailbox files (e.g. Thunderbird) makes Mail data available via Apache Mime4J
SMW SMW SemanticMedia Wiki API makes Semantic MediaWiki accessible via the SMW API
File:Xml logo.svg XML XML org.w3c.dom makes XML dom parse results accessible to Graph processing.

⌘⌘ What is Apache TinkerPop/Gremlin?

Apache Tinkerpop is an Open Source project. Gremlin is the GraphTraversal Language for it.

⌘⌘ SimpleGraph Dragtop

The Dragtop Open Source Software makes the SimpleGraph modules available for direct access from your Desktop. By simple drag and drop of the input onto the dragtop and then dropping a "tool" onto the dragtop you can combine the module functionality as you see fit.

⌘⌘ Example: The 5 Steps in SimpleGraph

⌘⌘ Step 1: Decide how the model should be encoded into a graph

⌘⌘ Step 2: Translate each of the models into a labeled graph

⌘⌘ Step 3: Select the graph kernel algorithm to be used

FileSystem fs=new FileSystem();
FileNode start = (FileNode) fs.connect("").moveTo(aroot.getPath());
start.recursiveOut("files",Integer.MAX_VALUE);
List<Vertex> javaFileNodes=start.g().V().has("ext", "java").toList();
List<Vertex> classFileNodes=start.g().V().has("ext", "class").toList()

⌘⌘ Step 4: Load all the graphs and compute the graph kernel

<HTML5video width="960" height="600" controls autoplay="false" loop="false">JavaAnalyzerDragAndDrop2019-02-18</HTML5video>

⌘⌘ Step 5: Exploit the information in the kernel matrix

  1. Visualize
  2. Store
  3. Mix and match with other sources

⌘⌘ How to benefit and participate

⌘⌘ Ideas for SimpleGraph future Progress

⌘⌘ Questions/Discussion