📄 Paper accepted @ AAAI 2025!! 🎉
I am very happy to share that our paper that combines the strengths of both MaxSAT-based fault localisation and Large Language Models, via zero-shot learning, to enhance automated …
I am very happy to share that our paper that combines the strengths of both MaxSAT-based fault localisation and Large Language Models, via zero-shot learning, to enhance automated …
Delivering valuable and personalised feedback to students remains one of the greatest challenges in programming education, particularly in courses with large enrollments. Providing …
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 …
This paper introduces a novel fault localization approach for C programs with multiple faults. CFaults leverages Model-Based Diagnosis (MBD) with multiple observations and …
The Maximum Satisfiability (MaxSAT) problem is the optimisation variant of the Satisfiability (SAT) problem. Solving MaxSAT efficiently often involves partitioning the set of soft …
In this talk I will present a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms.
This paper proposes a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms. As a result, new partitioning procedures can be …
We propose AlloyMax, an extension of Alloy with a capability to express and analyze problems with optimal solutions. AlloyMax introduces (1) a small addition of language constructs …
In this talk I present SQUARES, an open-source tool that generates SQL and R queries from specifications. The specifications are expressed with input-output tables and some …
In this paper, we present SQUARES, an open-source tool that generates SQL and R queries from specifications. The specifications are expressed with input-output tables and some …
MSc Thesis. We propose a novel Enumeration-Based SQL synthesizer SQUARES, that uses a new line representation where we represent each program line with its own subtree.
In this talk I will present a new compact line-based encoding is proposed that allows a faster enumeration of the program space.
In this paper, a new compact line-based encoding is proposed that allows a faster enumeration of the program space.