EDBT 2026 Demo / reviewers in the wild / expert
One An
dblp:426/3133
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 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.
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 50% Logic in computer science · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
first-order logic |
0.9 | 1 | 2025 | First-Order Quantified Separator in Alloy Analyzer · ASE 2025 |
Automated reasoning and model checking › synthesis
synthesis from specifications |
0.9 | 1 | 2025 | First-Order Quantified Separator in Alloy Analyzer · ASE 2025 |
Methods — techniques the papers use, named apart from their topics
constraint satisfaction · 0.9alloy analyzer · 0.9MaxSAT · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | First-Order Quantified Separator in Alloy AnalyzerabstractFirst-Order Logic (FOL) is a powerful language for specifying system invariants and properties, yet its formal complexity often hinders its adoption. To address this, we present Folloy, a tool that synthesizes FOL specifications from examples. Our core contribution translates specification learning into a constraint satisfaction problem by declaratively modeling FOL syntax and semantics in the Alloy Analyzer. This method is expressive, allowing synthesis of non-prenex formulas and user-defined syntactic constraints. By leveraging a Max-SAT solver, Folloy also guarantees that the learned formula is minimal in size. We evaluate our tool on benchmark problems and show that while this general approach is slower than a specialized algorithm, it solves a broader class of problems, establishing a trade-off between performance and expressive power. One An |
ASE | 1 |