activity
20102020
most citedNopol: Automatic Repair of Conditional Statement Bugs in Java Programs

432 citations · 625 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2020

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

Danel Le Berre, Pierre Marquis, Stefan Mengel +1

Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning sol…

cs.AI2020

On Weakening Strategies for PB Solvers

Daniel Le Berre, Pierre Marquis, Romain Wallon

Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generaliz…

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.AI2014★ 3 cited

On the Complexity of Optimization Problems based on Compiled NNF Representations

Daniel Le Berre, Emmanuel Lonca, Pierre Marquis

Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set…

cs.AI2014

Some thoughts about benchmarks for NMR

Daniel Le Berre

The NMR community would like to build a repository of benchmarks to push forward the design of systems implementing NMR as it has been the case for many other areas in AI. There ar…

cs.SE2014★ 144 cited

Automatic Repair of Buggy If Conditions and Missing Preconditions with SMT

Favio Demarco, Jifeng Xuan, Daniel Le Berre +1

We present Nopol, an approach for automatically repairing buggy if conditions and missing preconditions. As input, it takes a program and a test suite which contains passing test c…

cs.LO2010★ 46 cited

Solving Linux Upgradeability Problems Using Boolean Optimization

Josep Argelich, Daniel Le Berre, Inês Lynce +2

Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and s…