activity
20242026
collaborators

10 papers

cs.SE2026

A Universal Textual Merge Strategy Based on Tokens for Version Control Systems

Qiqi Jason Gu, Mikoláš Janota

Merging is a core operation in version control systems such as Git, but traditional line-based algorithms often yield spurious conflicts, particularly in the presence of refactorin…

cs.LO2026

Breaking Symmetries with Involutions

Michael Codish, Mikoláš Janota

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, sta…

cs.LO2026

Breaking Symmetries from a Set-Covering Perspective

Michael Codish, Mikoláš Janota

We formalize symmetry breaking as a set-covering problem. For the case of breaking symmetries on graphs, a permutation covers a graph if applying it to the graph yields a smaller g…

cs.SE2025

Model-Based Diagnosis with Multiple Observations: A Unified Approach for C Software and Boolean Circuits

Pedro Orvalho, Marta Kwiatkowska, Mikoláš Janota +1

Debugging is one of the most time-consuming and expensive tasks in software development and circuit design. Several formula-based fault localisation (FBFL) methods have been propos…

cs.SE2025

CFaults: Model-Based Diagnosis for Fault Localization in C Programs with Multiple Test Cases

Pedro Orvalho, Mikoláš Janota, Vasco Manquinho

Debugging is one of the most time-consuming and expensive tasks in software development. Several formula-based fault localization (FBFL) methods have been proposed, but they fail t…

cs.LO2025

Experimental Results for Vampire on the Equational Theories Project

Mikoláš Janota

Equational Theories Project is a collaborative effort, which explores the validity of certain first-order logic implications of certain kind. The project has been completed but tri…