Summary

• Page properties (1 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Content

...	...	@@ -12,7 +12,7 @@
12	12
13	13	= Automatic Graph Layout =
14	14
15		-**Advisors:** Christoph Daniel Schulze, Reinhard von Hanxleden.
	15	+**Advisors:** Sören Domrös, Reinhard von Hanxleden.
16	16
17	17	Ein sehr wichtiges Gebiet für uns ist das automatische Layout von Diagrammen. Hierfür gibt es bereits Werkzeuge, die gute Algorithmen enthalten, so dass viele Diagramme bereits jetzt übersichtlich und automatisiert angeordnet werden können (siehe z.B. [[Graphviz>>url:http://www.graphviz.org/||shape="rect" class="external-link"]]). Für einige besondere Arten von Diagrammen sind diese allgemeinen Algorithmen jedoch nicht geeignet, da zusätzliche Anforderungen an das Layout erfüllt werden müssen. Außerdem ist häufig die technische Anbindung vorhandener Algorithmen umständlich. Nutzer müssen sich mit der Funktionsweise der Algorithmen beschäftigen, um sie für ihre Anwendung optimal konfigurieren zu können.
18	18
...	...	@@ -26,7 +26,7 @@
26	26
27	27	= Modeling Pragmatics =
28	28
29		-**Advisors:** Christoph Daniel Schulze, Reinhard von Hanxleden
	29	+**Advisors:** Sören Domrös, Niklas Rentz, Reinhard von Hanxleden
30	30
31	31	* **Post-Processing Label Placement with Label Management** (Bachelor, Master)
32	32	This is about implementing a stand-alone label placement algorithm that can place node and edge labels after everything else has already been placed. Since there might not be enough space to place all labels, the algorithm should provide different options of coping with such situations. One would be to hide such labels, another one would be to apply label management to them.
...	...	@@ -46,7 +46,7 @@
46	46
47	47	= Semantics, Synchronous Languages and Model-based Design =
48	48
49		-**Advisors:** Steven Smyth, Alexander Schulz-Rosengarten, Lena Grimm, Reinhard v. Hanxleden
	49	+**Advisors:** Alexander Schulz-Rosengarten, Reinhard v. Hanxleden
50	50
51	51	Synchronous languages are well-established for the design of embedded, in particular safety-critical systems. One of our research areas concerns the further development of such languages and their efficient compilation. Specifically, we explore the paradigm of "sequential constructiveness" for reconciling familiar, imperative programming concepts with the sound grounding of synchronous languages. One language we have developed to try out and validate our concepts is the [[SCCharts>>doc:KIELER.SCCharts||shape="rect"]] language, which keeps evolving and thus offers many opportunities for student theses.
52	52
...	...	@@ -54,8 +54,6 @@
54	54
55	55	* **Optimization of the SCCharts compiler/transformations **(Bachelor/Master)
56	56	Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation.
57		-* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
58		-Implement analyses for data dependencies and scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler.
59	59	* **Javascript code generation** (Bachelor/Master)
60	60	Implement a javascript code generation for SCCharts. Integrate with simulation and (environment) visualization to deploy a complete example as standalone web page. Compare with [[HipHop.js >>url:https://dl.acm.org/ft_gateway.cfm?id=3167440&type=pdf||shape="rect"]]based on Esterel.
61	61
...	...	@@ -65,24 +65,9 @@
65	65	Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
66	66	* **Core SCCharts Interpreter** **with dynamic Scheduling** (Master/Bachelor)
67	67	Implement an Interpreter for Core SCCharts that supports SC Policies.
68		-* **Microstep-Simulation of Statecharts** (Master/Bachelor)
69		-Implement a method to do microstep simulation with SCCharts.
70		-* **Improve the Live Debugging of Statecharts** (Bachelor)
71		-Implement a dedicated debugging view for SCCharts.
72	72
73		-//Model-based C Code Compilation//
	67	+\\
74	74
75		-* **Execution of Recursive Dataflow Code** (Master/Bachelor)
76		-* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
77		-Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
78		-For Master students: Implement both.
79		-
80		-//Blech//
81		-
82		-* Extraction of mode diagrams from Blech\\
83		-
84		-{{view-file att--filename="Extraction of mode diagrams.pdf" height="250"/}}
85		-
86	86	\\
87	87
88	88	\\

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-78676049
	1	+126418957

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/78676049/Topics for Student Theses
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/126418957/Topics for Student Theses