M.Sc. Sascha Rechenberger

I'm mainly interested in the theory of (mostly) declarative, especially functional, programming languages like Haskell, Lisp, or Prolog, as well as languages influence by this paradigm, like Kotlin. This also includes various topics of compiler construction, like program analysis or program transformation.

Besides that, I'm interested in algorithm theory, including complexity theory and computability theory, especially concerning boolean satisfiability (SAT), as well as cryptography and machine learning.

Publications

2019

3.
Rechenberger, Sascha
Informationstheoretische Analyse von SLS-Solvern
Masterarbeit
Universität Ulm
Institut für Theoretische Informatik
2019

2018

2.
Kögel, Stefan; Tichy, Matthias; Groner, Raffaela; Stegmaier, Michael; Götz, Stefan; Rechenberger, Sascha
Developing an Optimizing Compiler for the Game Boy as a Software Engineering Project
Software Engineering Education and Training Track of the 40th International Conference on Software Engineering (ICSE SEET 2018), Gothenburg, Sweden
Mai 2018
DOI:10.1145/3183377.3183388
Datei:https://www.icse2018.org/event/icse-2018-software-engineering-education-and-training-developing-an-optimizing-compiler-for-the-game-boy-as-a-software-engineering-project

2015

1.
Rechenberger, Sascha
Monadische Interpretation multiparadigmatischer Sprachkonstrukte
Bachelorarbeit
Universität Ulm
Januar 2015

Teaching

Winter Term 2020/21

  • Lab: Rule Based Programming
  • Proseminar: Logic Based Programming Languages
  • Seminar: Rule Based and Constraint Programming
  • Project: Rule Based and Constraint Programming

Summer Term 2020

  • Proseminar: Rule Based Models of Computation