VLDB 2026 Research / reviewers in the wild / expert
Luciano Zemín
dblp:132/2641
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-8804-7331ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
2 papers |
Debugging and program repair · 73% Software testing · 11% Program verification · 9% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Debugging and program repair
automated program repair |
0.9 | 1 | 2025 | An Empirical Study on the Suitability of Test-based Patch Acceptance Criteria · ACM Trans. Softw. Eng. Methodol. 2025 |
Debugging and program repair › automated program repair › patch correctness assessment
overfitting patch detection |
0.9 | 1 | 2025 | An Empirical Study on the Suitability of Test-based Patch Acceptance Criteria · ACM Trans. Softw. Eng. Methodol. 2025 |
Software testing › fault detection
bug finding tools |
0.3 | 1 | 2025 | An Empirical Study on the Suitability of Test-based Patch Acceptance Criteria · ACM Trans. Softw. Eng. Methodol. 2025 |
Program verification
bounded verification |
0.2 | 1 | 2013 | Parallel bounded analysis in code with rich invariants by refinement of field bounds · ISSTA 2013 |
Program analysis
static analysis |
0.2 | 1 | 2013 | Parallel bounded analysis in code with rich invariants by refinement of field bounds · ISSTA 2013 |
Program verification › constraint-based verification
SAT-based verification |
0.0 | 1 | 2013 | Parallel bounded analysis in code with rich invariants by refinement of field bounds · ISSTA 2013 |
Methods — techniques the papers use, named apart from their topics
bounded-exhaustive testing · 0.9symmetry breaking · 0.2SAT solving · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | An Empirical Study on the Suitability of Test-based Patch Acceptance CriteriaabstractIn this article, we empirically study the suitability of tests as acceptance criteria for automated program fixes, by checking patches produced by automated repair tools using a bug-finding tool, as opposed to previous works that used tests or manual inspections. We develop a number of experiments in which faulty programs from IntroClass , a known benchmark for program repair techniques, are fed to the program repair tools GenProg, Angelix, AutoFix, and Nopol, using test suites of varying quality, including those accompanying the benchmark. We then check the produced patches against formal specifications using a bug-finding tool. Our results show that, in the studied scenarios, automated program repair tools are significantly more likely to accept a spurious program fix than producing an actual one. Using bounded-exhaustive suites larger than the originally given ones (with about 100 and 1,000 tests) we verify that overfitting is reduced but (a) few new correct repairs are generated and (b) some tools see their performance reduced by the larger suites and fewer correct repairs are produced. Finally, by comparing with previous work, we show that overfitting is underestimated in semantics-based tools and that patches not discarded using held-out tests may be discarded using a bug-finding tool. Luciano Zemín, Ariel Godio, César Cornejo, Renzo Degiovanni, Simón Gutiérrez Brida, Germán Regis, Nazareno Aguirre, Marcelo F. Frias |
ACM Trans. Softw. Eng. Methodol. | 1 |
| 2013 | Parallel bounded analysis in code with rich invariants by refinement of field boundsabstractIn this article we present a novel technique for automated parallel bug-finding based on the sequential analysis tool TACO. TACO is a tool based on SAT-solving for efficient bug-finding in Java code with rich class invariants. It prunes the SAT-solver's search space by introducing precise symmetry-breaking predicates and bounding the relational semantics of Java class fields. The bounds computed by TACO generally include a substantial amount of nondeterminism; its reduction allows us to split the original analysis into disjoint subproblems. We discuss the soundness and completeness of the decomposition. Furthermore, we present experimental results showing that MUCHO-TACO, our tool which implements this technique, yields significant speed-ups over TACO on commodity cluster hardware. Nicolás Rosner, Juan P. Galeotti, Santiago Bermúdez, Guido Marucci Blas, Santiago Perez De Rosso, Lucas Pizzagalli, Luciano Zemín, Marcelo F. Frias |
ISSTA | 7 |