output
20052022
most citedNopol: Automatic Repair of Conditional Statement Bugs in Java Programs

432 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2018Show all

5 papers · 1 filter

cs.DB2018★ 11 cited

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

Antoine Amarilli, Pierre Bourhis, Stefan Mengel +1

We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the…

cs.SE2018★ 432 cited

Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs

Jifeng Xuan, Matias Martinez, Favio Demarco +5

We propose NOPOL, an approach to automatic repair of buggy conditional statements (i.e., if-then-else statements). This approach takes a buggy program as well as a test suite as in…

cs.AI2018★ 15 cited

On Rational Entailment for Propositional Typicality Logic

Richard Booth, Giovanni Casini, Thomas Meyer +1

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias…

cs.CC2018

Knowledge Compilation, Width and Quantification

Florent Capelli, Stefan Mengel

We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start b…

cs.AI2018★ 2 cited

QBF as an Alternative to Courcelle's Theorem

Michael Lampis, Stefan Mengel, Valia Mitsou

We propose reductions to quantified Boolean formulas (QBF) as a new approach to showing fixed-parameter linear algorithms for problems parameterized by treewidth. We demonstrate th…