From Logic to Learning: Rethinking Programming for the AI Era
In this talk, I will present approaches that leverage the precision of formal logic and the adaptability of learning-based models to enable intelligent code generation, automated …

In this talk, I will present approaches that leverage the precision of formal logic and the adaptability of learning-based models to enable intelligent code generation, automated …
In this talk I will present a hybrid method to automated repair of C code, using Maximum Satisfiability (MaxSAT)-based fault localization, CFaults, to localize bugs and LLMs to …
In this talk, I will present our evaluation on whether state-of-the-art LLMs with up to 8B parameters can reason about Python programs or are simply guessing.
In my talk, I will present MENTOR, a semantic automated program repair (APR) framework designed to provide Automated Feedback for Introductory Programming Exercises.
Nesta palestra, irei apresentar o sistema MENTOR, uma ferramenta de reparação automática de programas orientada para fornecer feedback automatizado para exercícios introdutórios de …
In this talk I will present our novel approach that combines the strengths of both FM-based fault localization and LLMs, via zero-shot learning, to enhance Automated Program …
In this talk I will present GitSEED, a language-agnostic automated assessment tool designed for Programming Education and Software Engineering (SE) and backed by GitLab.
In this talk I will present a hybrid method to automated repair of C code, using Maximum Satisfiability (MaxSAT)-based fault localization, CFaults, to localize bugs and LLMs to …
In this talk I will introduce a novel fault localization approach for C programs with multiple faults. CFaults leverages Model-Based Diagnosis (MBD) with multiple observations and …
In this talk I will present C-Pack-IPAs, a publicly available benchmark comprising student-program submissions for 25 distinct introductory programming assignments (IPAs).
In this talk I will present a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms.
In this talk I will propose using graph neural networks (GNNs) to map the set of variables between two programs based on both programs' abstract syntax trees (ASTs).
In this talk I will present MultIPAs, a program transformation tool that can augment IPAs benchmarks by (1) applying six syntactic mutations that conserve the program's semantics …
In this talk I propose to learn how to map the set of variables between different small imperative programs based on both programs' abstract syntax trees (ASTs) using graph neural …
In this talk I propose a novel approach for program clustering that uses dynamically generated program invariants to cluster semantically equivalent programming assignments.