events

This event is hosted by the TU Delft Programming Languages Group as part of their seminar. Abstract: This talk presents a tool for genetic program repair utilizing the rich features provided by Haskell and the available frameworks. It covers basics of program repair, genetic search and typed holes. We then look at our novel approach of type-based program repair using properties and present some of the (mixed) results we achieved. In general, the patches are cool but often too fine-grained, but we hope that they can help especially for classroom settings.

Abstract: Code completion is an essential feature of IDEs, yet current autocompleters are restricted to either grammar-based or NLP-based single token completions. Both approaches have significant drawbacks: grammar-based autocompletion is very restricted in dynamically-typed language scenarios, whereas NLP-based autocompletion struggles to understand the semantics of the programming language, giving suggestions that ignore a developer’s context. In this work, we present CodeFill, a language model for autocompletion that combines structure and naming information.

Abstract: all Graphs are a rich data source and built the foundation for advanced static analysis that can, for example, detect security vulnerability or dead code. Call Graph generation is usually considered to be a full program analysis: not just the program, but also all its dependencies are processed together. Unfortunately, this is very expensive and makes it hard to run these static analyses in build systems that are typically limited in resources.

Abstract Code mixes natural language in identifier names, comments, and stylistic choices (ordering and typesetting) with a formal language that defines a computation. The snippets in each language form a communication channel. Developers read both channels; a CPU processes only the formal channel. These two channels interact and constrain each other. The theory of dual channel constraints elucidates these interactions and points to their exploitation. One prominent application is probabilistic type inference.

Ask Maurício for the Zoom link.

Abstract: TBD

Ask Maurício for the Zoom link.

Ask Maurício for the Zoom link.

Ask Maurício for the Zoom link.

For my Go-No-Go I want to share with you what I worked on last year; I show the idea behind my first paper Lampion, my current work with Haskell Program Repair and our concept for a new java bug data-set. You will find the Teams-Invite on Mattermost