Theoretical Computer Science

Here you find general information concerning the organisation of bachelor projects in the TCS group. A separate page lists important formalities.


Available Projects

Inductive Programming: Beat the Best!
Abstract:

Pick the currently best Inductive Functional Programming (IFP) tool (eg. IGOR II), reimplement Qunilan's FOIL (eg. in Haskell) and define a benchmark so that the new FOIL algorithm significantly outperforms the best (unaltered) IFP tool.

Background to the task can be found in Natalie's recent bachelor thesis (see below).

Prerequisites: none

Supervision: Georg Moser

Ongoing Projects

Automated Resource and Termination Analysis of Logic Programs
Abstract:

Within this project a lightweight resource and termination analyser for logic programs (incorporating a significant subset of Prolog) is to be implemented as stand-alone tool or to be incorporated into TcT.

The prover should be able to hande textbook examples in Prolog.

Prerequisites: Logic Programming

Student: Morgan Couapel
Supervision: Georg Moser

Completed Projects

CLARA: Automated Feedback for Programming Assignments
Abstract:

Manually provided feedback to programming assignments is (i) tedious, (ii) time consuming and (iii) error-prone. The bachelor thesis (for the teaching degree) studies recent work to provide feedback automatically. The tool CLARA, developed by Gulwani et al. exploits methods from program repair to provide the smallest repair as feedback. In this thesis, we experimentally validate the prototype for small-scale programming assignments as we typically see in courses at the University of Innsbruck.

Student: Natalie Höpperger

Supervision: Georg Moser

Umsetzungen des 'Bring Your Own Device' an österreichischen Schulen
Abstract:

Die Arbeit wird Fragen rund um die Geräteoffensive "Digitales Lernen" beantworten und findet unter der Mitwirkung von Mag. Rene Braunshier (BRG/BORG Landeck) statt.

Student: Jonas Pfurtscheller

Supervision: Georg Moser

Learning Efficient Programs
Abstract:

What is the state-of-the-art in the field of inductive programming when it comes to complex, efficient, recursive programs. Is it eg. guranteed that sophisticated text-book examples can be learnt by a few examples? Here, we are particular interested in the efficiency of programs.

The aim of the bachelor project is to provide an indepth overview over existing methods in inductive programming independent of the underlying programming paradigmn. For that literature study, theoretical, as well as experimental comparions will be performed.

Student: Natalie Höpperger

Supervision: Georg Moser
Thesis: download
supplementary material

Kindly, also see here for completed bachelor projects.