Wiki source code of Topics for Student Theses
Version 13.1 by cds on 2012/09/28 15:02
Show last authors
| author | version | line-number | content |
|---|---|---|---|
| 1 | Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we could do together. | ||
| 2 | |||
| 3 | = Bachelor Topics = | ||
| 4 | |||
| 5 | * **Control Flow Graph Exploration / Visualization** | ||
| 6 | Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using Klighd. | ||
| 7 | * **SyncCharts and Actor Model Visualization** | ||
| 8 | Develop an integrated viewer for [[doc:SyncCharts]] and [[KAOM>>doc:Actor Oriented Modeling (KAOM)]] models using [[KLighD>>doc:Lightweight Diagrams (KLighD)]], including view management techniques such as focus & context and structure-based editing. | ||
| 9 | * **Validation Manager for Models** | ||
| 10 | Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts). | ||
| 11 | * **Esterel / SyncCharts Validation** | ||
| 12 | Automate the validation for a (generic) SyncCharts simulator employing the Esterel simulator and the Esterel to SyncCharts transformation. | ||
| 13 | * **Transformation from SyncCharts to Esterel** [possibly also Master Topic] | ||
| 14 | Develop a transformation in Xtend2 to generate Esterel code for SyncCharts. | ||
| 15 | * **Layering Algorithms** | ||
| 16 | Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. | ||
| 17 | * **Heuristics for Side Aware Edge Label Placement** | ||
| 18 | Think about and implement heuristic algorithms for solving the edge aware edge label placement problem for placing edge labels in data flow diagrams. | ||
| 19 | * **Implement Greedy Switch Heuristic for Crossing Minimization** | ||
| 20 | The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for. (See ticket [[KIELER-1871>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-1871||shape="rect"]]) | ||
| 21 | * **Add Support for Self Loops for Polyline / Spline Layouts | ||
| 22 | **Self loops, that is, edges connecting a node with itself, need to be properly routed. This is already implemented for orthogonal edge routing, but is still an open problem for spline and polyline edge routing. (See ticket [[KIELER-2136>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-2136||shape="rect"]].) | ||
| 23 | * **Incremental Update for Klighd** | ||
| 24 | Incremental update of Klighd data structure after editing. | ||
| 25 | * **Visualizing Model Edits/Changes** | ||
| 26 | Develop and implement methods to visualize a model while it is edited. A particular concern here is the preservation of the mental map. | ||
| 27 | |||
| 28 | = Master Topics = | ||
| 29 | |||
| 30 | * **SyncCharts in Yakindu** | ||
| 31 | Develop a SyncChart-Editor based on Yakindu, including basic pragmatics concept (automatic layout, collapse/expand, structure-based editing) and interfacing to host-language. | ||
| 32 | * **FPGA Statecharts** | ||
| 33 | Development of a Statecharts editor, based on .NET, WPF, MS Silverlight. Synthesis onto FPGAs with a data-flow-based intermediate format. | ||
| 34 | * **Diagram Description Language** | ||
| 35 | Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example. | ||
| 36 | * **[Quartz]** | ||
| 37 | Integrate the synchronous Quartz language into KIELER for validation purposes and teaching. |