Tips & Tricks for TUE students doing Architecture Reconstruction with Rascal

Maat: px

Weergave met pagina beginnen:

Download "Tips & Tricks for TUE students doing Architecture Reconstruction with Rascal"

Siebe van der Pol
9 jaren geleden
Aantal bezoeken:

1 SWAT - Software Analysis and Transformation Tips & Tricks for TUE students doing Architecture Reconstruction with Rascal Jurgen Vinju Davy Landman See peach assignment 0 for install instruction And assignment 2 and Tonella & Potrich

2 Rascal PL meer gereedschap mogelijk maken experiment (validatie) valorisatie (toepassing) Gereedschap SE Research kennisuitwisseling Industrie 2

3 Vacatures PhD supersnelle code genereren voor hele grote printers bij OCÉ Accurate modellen extraheren uit C en C++ code bij Philips Healthcare 3

4 Transformation Rascal is a DSL for meta programming Execution Code Extraction Analysis Generation Model Formalization Visualization Picture Rendering Conversion (Brueghel, Tower of Babel)

5 Extract Analyze SYnthesize Java project Eclipse JDT Rascal M3 Your Rascal code Source Code Projects Parser Name resolver Type AST Model loc comprehensions visitors functions patterns relational operators string templates Image in Eclipse View Rascal Eclipse Lib Figure Editors GraphViz DOT

6 UML & Object Flow Source Code extract Rascal M3 AST Model loc abstract Flow Program not executable but flow is the same as the original - only handful of constructs Your code queries the flow program and the M3 model. filter & propagate generate Flow graph rel[loc,loc] Your code UML Diagrams render builds basic UML diagram & uses flow graph to add/filter edges

7 Identifying code Source code locations: loc type project://myproj/src/org/myproj/fruit.java Structured names: loc type java+class://java/util/list java+class://java/util/list + this == java+class://java/util/list/this Back to code hyperlinks (if you extracted a full M3 model) IO::readFile(loc) produces a str with the contents

8 Getting facts First have a compileable Eclipse project elib import lang::java::jdt::m3::core; import lang::java::jdt::m3::ast; m = createm3fromeclipseproject( project://elib ); import lang::java::flow::javatoobjectflow; import analysis::flow::objectflow; p = createofg( project://elib ); Now you have: an M3 model in m a flow program in p hyperlinks

9 src m3??? flow program

10 src m3??? flow program

11 Initial flow graph a relation as a graph uses generators and matching to project out of program uses + on locs to build new implicit identifiers uses index from List to pair formal/actual parameters

12 Flow propagation sketch use solve for fixed point projection g[n] is succ, revert and project g<to,from>[n] i pred comprehensions for next solution

13 Faster flow propagation Use more builtin primitives: invert eagerly compose instead of comprehension

14 veilig overschatten: geen gemiste edges, maar wel teveel edges échte oplossing gevonden goed gevonden vals alarm goed genegeerd gemiste bugs 14

15 efficiënt onderschatten: nooit te veel edges, maar je mist wel veel edges échte oplossing gevonden goed gevonden vals alarm goed genegeerd gemiste bugs 15

16 Onder- en overschatten tegelijkertijd: lijkt haast onvermijdbaar maar creëert verwarring échte oplossing gevonden goed gevonden vals alarm goed genegeerd gemiste bugs 16

17 Debugging IO::println, iprintln, util::valueui::text,tree,graph interactive debugger (just put a breakpoint) online manual?! also in Eclipse Tutor View online questions?! Issue tracker at github.org

18 Caveats No type checker (coming soon) No incremental parsing (one error at a time) Slowness (compiler coming soon) But: consider doing this from scratch :-)

19 Demo Inheritance diagram from Eclipse Java project Get code into an Eclipse Java project Start a Rascal project Start a Rascal console Browse library code and tutorial Script the tool

Vergelijkbare documenten

Find Neighbor Polygons in a Layer

Find Neighbor Polygons in a Layer QGIS Tutorials and Tips Author Ujaval Gandhi http://google.com/+ujavalgandhi Translations by Dick Groskamp This work is licensed under a Creative Commons Attribution 4.0