Dependent Types and Conversion Checking: A literature survey on implementation techniques for type systems

While dependent types can allow programmers to verify properties of their programs, implementing a type checker for a dependent type theory is often difficult. This is due to the fact that, in the presence of dependent types, deciding the equality of types - conversion checking - becomes non-trivial. Due to an identified gap in literature...

Motivating PhD candidates with depression symptoms to complete thoughts-strengthening exercises via a conversational agent

PhD students are usually more susceptible than other people to depression-inducing situations, which are not adequately addressed in eHealth systems. Cognitive behavioral therapy (CBT) is a well-established depression treatment, and one of its therapeutic methods is to change negative thought patterns into positive ones. The new positive...

Automated crash fault localization

Debugging application crashes is an expensive and time-taking process, relying on the developer’s expertise, and requiring knowledge about the system. Over the years, the research community has developed several automated approaches to ease debugging. Among those approaches, search-based crash reproduction, which tries to generate a test case...

Unit test generation for common and uncommon behaviors

Various search-based test generation techniques have been proposed to automate the process of test generation to fulfill different criteria (e.g., line coverage, branch coverage, mutation score, etc.). Despite these techniques' undeniable accomplishments, they still suffer from a lack of guidance coming from the data gathered from the production...

Fit2Crash: Specialising Fitness Functions for Crash Reproduction

Software applications inevitably crash, and it is time-consuming to recreate the crash conditions for debugging. Recently, researchers have developed frameworks relying on genetic algorithms, e.g. Botsing, for automated crash reproduction. However, the existing approaches process exceptions of different types as if they were the same. In this...

Performance Evaluation of Vehicle Routing Heuristics

This thesis has researched the automation of performance evaluation of vehicle routing heuristics. The trade-off between solution quality, which is composed of multiple variables, and runtime make performance evaluation challenging. Therefore, it is often done by human experts. The research question of this thesis is: “How can we determine a...

Encoding OAS: Solving order acceptance and scheduling with modified black box approaches

In many real world scheduling problems there exist hard deadlines after which tasks can no longer be performed. Conversely, not all tasks are necessarily required to be scheduled. Furthermore, the problem investigated in this thesis includes sequence dependent setup times, an aspect reminiscent of the Travelling Salesperson problem. These...

AuTA: Automatic teaching assistant

Due to the dramatic increase in enrollments in the TU Delft Bachelor of Computer<br/>Science, the workload for teaching assistants and instructors has skyrocketed. To<br/>reduce this workload, automated tools can be used to make the grading process easier. This paper describes the development of AuTA (Automatic Teaching Assistant), a tool that...

Abstract Interpretation of Program Transformations using Regular Tree Grammars

Many program transformation languages simplify the implementation of program transformations. However, they give only weak static guarantees about the generated code such as well-sortedness. Well-sortedness guarantees that a program transformation does not generate syntactically ill-formed code, but it is too imprecise for many other scenarios....