Difference between revisions of "Graph Approaches for Software Engineeering"

From BITPlan Wiki
Jump to navigation Jump to search
 
(19 intermediate revisions by the same user not shown)
Line 4: Line 4:
 
;author: <span style='font-size:50%'>[http://www.bitplan.com/index.php/Wolfgang_Fahl Wolfgang Fahl Wolfgang Fahl] [mailto:info@bitplan.com info@bitplan.com]</span>
 
;author: <span style='font-size:50%'>[http://www.bitplan.com/index.php/Wolfgang_Fahl Wolfgang Fahl Wolfgang Fahl] [mailto:info@bitplan.com info@bitplan.com]</span>
 
;footer: Applying the OpenSource Project SimpleGraph and it's modules to Software Engineering
 
;footer: Applying the OpenSource Project SimpleGraph and it's modules to Software Engineering
−
;subfooter: [https://wwwmatthes.in.tum.de/pages/rwzby1tlqhn9/Advanced-Seminar sebis Oberseminar Technische Universität München]
+
;subfooter: [https://wwwmatthes.in.tum.de/pages/rwzby1tlqhn9/Advanced-Seminar sebis Oberseminar TUM]
 
</slideshow>
 
</slideshow>
 
=== ⌘⌘ Wolfgang Fahl ===
 
=== ⌘⌘ Wolfgang Fahl ===
Line 19: Line 19:
 
| [[File:Explore2018-06Portobello.png|link=http://ebike.bitplan.com|250px|Giant Explore]]<br>Giant Explore
 
| [[File:Explore2018-06Portobello.png|link=http://ebike.bitplan.com|250px|Giant Explore]]<br>Giant Explore
 
|}
 
|}
 +
== ⌘⌘ Touchable Software Engineering ==
 +
https://www.flanschen-fitting-shop.de/1030-tm_large_default/schraube-m10x35.jpg
 +
 
=== ⌘⌘ The World as a Graph  ===
 
=== ⌘⌘ The World as a Graph  ===
 
If the world is represented as a Graph it would be nice to have a {{Link|target=SiGNaL|title=Simple Graph Navigation Language}}
 
If the world is represented as a Graph it would be nice to have a {{Link|target=SiGNaL|title=Simple Graph Navigation Language}}
Line 31: Line 34:
 
see [http://ebike.bitplan.com/index.php?title=SimpleGraph_Semantic_Media_Wiki_Module&action=slide SMWCon Fall 2018]
 
see [http://ebike.bitplan.com/index.php?title=SimpleGraph_Semantic_Media_Wiki_Module&action=slide SMWCon Fall 2018]
  
−
=== ⌘⌘ Vorgeschichte ===
+
=== ⌘⌘ Why I am here ===
 
[[File:twitter2018-08-26.png|400px|link=https://twitter.com/seppl2009/status/1033787770819497985]]
 
[[File:twitter2018-08-26.png|400px|link=https://twitter.com/seppl2009/status/1033787770819497985]]
  
−
=== ⌘⌘ Why I am here ===
+
=== ⌘⌘ Prehistory ===
 +
see also {{Link|target=Workdocumentation 2019-02-18#PreHistory|title=PreHistory (clickable)}}
 
<graphviz>
 
<graphviz>
  
−
digraph history {
+
digraph prehistory {
 
rankdir=LR;
 
rankdir=LR;
 
ranksep=2.0;
 
ranksep=2.0;
Line 120: Line 124:
 
== ⌘⌘ Step 3: Select the graph kernel algorithm to be used ==
 
== ⌘⌘ Step 3: Select the graph kernel algorithm to be used ==
 
[[File:Gremlin programming language.png|400px|left|link=Gremlin]] 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.
 
[[File:Gremlin programming language.png|400px|left|link=Gremlin]] 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 [[File:SemanticMediaWiki Logo.png|120px]] as a suitable environment.
+
BITPlan e.g. often uses {{Link|target=Semantic MediaWiki}} [[File:SemanticMediaWiki Logo.png|120px|link=Semantic MediaWiki]] as a suitable environment.
  
 
== ⌘⌘ Step 4: Load all the graphs and compute the graph kernel ==
 
== ⌘⌘ Step 4: Load all the graphs and compute the graph kernel ==
Line 129: Line 133:
 
== ⌘⌘ Step 5: Exploit the information in the kernel matrix ==
 
== ⌘⌘ Step 5: Exploit the information in the kernel matrix ==
 
There are two modes for exploiting the information:
 
There are two modes for exploiting the information:
−
# OLAP - Online Analytical Processing
+
# [https://en.wikipedia.org/wiki/Online_analytical_processing OLAP - Online Analytical Processing] / Graph Query
−
# OLTP - Online  
+
# [https://en.wikipedia.org/wiki/Online_transaction_processing OLTP - Online Transaction Processing] / Graph Traversal
 
[[File:GremlinOltp-and-olap.png|400px|link=https://tinkerpop.apache.org/gremlin.html]]
 
[[File:GremlinOltp-and-olap.png|400px|link=https://tinkerpop.apache.org/gremlin.html]]
  
 
== ⌘⌘ What is SimpleGraph? ==
 
== ⌘⌘ What is SimpleGraph? ==
 
Simplegraph allows to work with "graphized" information source from a combination of APIs that are made available as modules.
 
Simplegraph allows to work with "graphized" information source from a combination of APIs that are made available as modules.
−
{{SimpleGraphModuleMarkup|userparam=intro}}
+
{{SimpleGraphModuleMarkup|#userparam=intro}}
 
{{#ask: [[Module_for_SE::true]]
 
{{#ask: [[Module_for_SE::true]]
 
| mainlabel=SimpleGraphModule
 
| mainlabel=SimpleGraphModule
Line 153: Line 157:
 
| template=SimpleGraphModuleMarkup
 
| template=SimpleGraphModuleMarkup
 
}}
 
}}
−
{{SimpleGraphModuleMarkup|userparam=outro}}
+
{{SimpleGraphModuleMarkup|#userparam=outro}}
  
 
== ⌘⌘ What is Apache TinkerPop/Gremlin? ==
 
== ⌘⌘ What is Apache TinkerPop/Gremlin? ==
Line 195: Line 199:
 
</graphviz>
 
</graphviz>
 
== ⌘⌘ Step 3: Select the graph kernel algorithm to be used ==
 
== ⌘⌘ Step 3: Select the graph kernel algorithm to be used ==
−
[[File:Gremlin programming language.png|400px]]
+
[[File:Gremlin programming language.png|300px]]
 +
<source lang='java'>
 +
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()
 +
</source>
 +
[[File:SemanticMediaWiki Logo.png|120px|link=Semantic MediaWiki]]
 +
== ⌘⌘ 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 ==
 +
# Visualize
 +
# Store
 +
# Mix and match with other sources
 +
 
 +
== ⌘⌘ How to benefit and participate ==
 +
* Stay in touch with {{Link|target=Wolfgang Fahl}}
 +
* Ask [https://stackoverflow.com/questions/tagged/simplegraph StackOverFlow questions on SimpleGraph]
 +
* Participate in the [https://github.com/BITPlan/com.bitplan.simplegraph GitHub SimpleGraph Open Source Project]
 +
* Join the [https://groups.google.com/forum/#!forum/simplegraph SimpleGraph Mailinglist]
 +
* Collaborate on Projects with [http://www.bitplan.com BITPlan]
 +
* Write papers related to {{Link|target=SimpleGraph}}
 +
 
 +
== ⌘⌘ Ideas for SimpleGraph future Progress ==
 +
<graphviz>
 +
digraph Objects9000 {
 +
  RQ [ label="Requirements" ]
 +
  AC [ label="Acceptance Criteria" ]
 +
  OQ [ label="Open Questions" ]
 +
  SH [ label="StakeHolders" ]
 +
  Test [ label="Unit Tests" ]
 +
  Model [ label="Models" ]
 +
  Impl [ label="Implementation" ]
 +
  SH -> RQ
 +
  RQ -> Model -> Source -> Test -> Impl
 +
  RQ -> AC
 +
  RQ -> OQ
 +
  SH -> OQ
 +
  AC -> OQ
 +
}
 +
</graphviz>
 +
* more Software-Engineering related modules e.g. for Modelling,Requirements Engineering
 +
* more Visualization options e.g. like/with [http://prefuse.org/ prefuse]
 +
* Visualized Editor e.g. like/with [https://developers.google.com/blockly/ blockly]
 +
* better integration with other programming languages
  
 
== ⌘⌘ Questions/Discussion ==
 
== ⌘⌘ Questions/Discussion ==
 
[[File:Bitplanpartner.png]]
 
[[File:Bitplanpartner.png]]
 
<youtube>PiNJZ4vg5ts</youtube>
 
<youtube>PiNJZ4vg5ts</youtube>
 +
[[Category:Talk]]

Latest revision as of 12:03, 7 March 2021

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

title

Graph Approaches for Software EngineeringProfiwikiicon.png
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

Wfjuggling.png
Peugeot Ion
Peugeot Ion 		Giant Explore
Giant Explore

⌘⌘ Touchable Software Engineering

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

Twitter2018-08-26.png

⌘⌘ 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

Toskana2019planning.png


⌘⌘ 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

Gremlin programming language.png

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 SemanticMediaWiki Logo.png as a suitable environment.

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

HubAndSpoke.gif

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

GremlinOltp-and-olap.png

⌘⌘ 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
Folder.svg FileSystem FileSystem java.io.File makes your FileSystem accessible via the Java FileSystem API
Octocat.png GitHub GitHub GitHub GraphQL Api v4 makes GitHub content accessible to Graph processing.
Java-Logo.svg Java Java javaparser makes Java code parse results accessible to Graph processing.
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
SemanticMediaWiki Logo.png SMW SMW SemanticMedia Wiki API makes Semantic MediaWiki accessible via the SMW API
Xml logo.svg XML XML org.w3c.dom makes XML dom parse results accessible to Graph processing.

⌘⌘ What is Apache TinkerPop/Gremlin?

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

⌘⌘ SimpleGraph Dragtop

DragTopExample1.png

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

  • .java Source Files: FileSystem module
  • Java Classes: JavaSystem
  • .class Files: Filesystem module (Bytecode parser?)

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

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

Gremlin programming language.png 

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()

SemanticMediaWiki Logo.png

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

⌘⌘ 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

  • more Software-Engineering related modules e.g. for Modelling,Requirements Engineering
  • more Visualization options e.g. like/with prefuse
  • Visualized Editor e.g. like/with blockly
  • better integration with other programming languages

⌘⌘ Questions/Discussion

Bitplanpartner.png

Retrieved from "https://wiki.bitplan.com/index.php?title=Graph_Approaches_for_Software_Engineeering&oldid=13926"