Roberto Giacobazzi
where else to find them
what they talk about
all 5 in the filters
where they keep going back
all 5 in the filters
on a stage with
all 16 in the filters
who talks about the same things
- Marco Campion5 talks
- Mila Dalla Preda5 talks
- Caterina Urban14 talks
- Marco Gaboardi18 talks
- Roberta Gori4 talks
- Roberto Bruni5 talks
| title | conference | date |
|---|---|---|
| A Logic for the Imprecision of Abstract Interpretations | POPL 2026 | 2026-01-11 |
Introduces a program logic, Error Propagation Logic, that produces an explicit bounding function mapping concrete-input imprecision to an upper bound on… | ||
| The Best of Abstract Interpretations | POPL 2025 | 2025-01-19 |
Characterizes when an inductive abstract interpretation equals the abstraction of the concrete semantics, proves that for any non‑trivial abstract domain the… | ||
| Adversities in Abstract Interpretation - Accommodating Robustness by Abstract(…) | POPL 2025 | 2025-01-19 |
Presents a formal framework that defines four concrete notions of classifier robustness via abstract interpretation—concrete, abstract robustness… | ||
| Short talks: Past, Present and Future of AI | N40AI 2024 | 2024-01-20 |
A rapid history of abstract interpretation that traces concrete claims and engineering outcomes: presents the formal method used to analyze Airbus C code with… | ||
| Monotonicity and the Precision of Program Analysis | POPL 2024 | 2024-01-14 |
Paper proves that if a program is monotone (non‑decreasing or non‑increasing) on a bounded input space and yields a convex numeric output over a non‑relational… | ||
| How fitting is your abstract domain? | SAS 2023 | 2023-10-22 |
Presents a sound, language- and domain-agnostic proof system that decides whether an abstract domain can produce answers strictly better than a chosen… | ||
| A Formal Framework to Measure the Incompleteness of Abstract Interpretations | SAS 2023 | 2023-10-22 |
Defines a weaker distance notion called pre-metric that relaxes quasi-metric axioms so distances work on pre-ordered abstract and concrete domains, shows how… | ||
| Abstract Interpretation Repair | PLDI 2022 | 2022-06-13 |
This work gives an algorithmic way to repair abstract interpreters by add one point u into the abstract domain along a program trace, producing the minimal… | ||
| Partial (In)Completeness in Abstract Interpretation: Limiting the Imprecision in | POPL 2022 | 2022-01-16 |
Defines a quasi-metric a-compatible on abstract domains (examples: weighted path length for sign and interval domains) and formalizes epsilon-partial… | ||
| qKleene: Verification of Quantum RAM Made Easy | PLanQC 2021 | 2021-06-22 |
qKleene is a small language that encodes control flow as regular-expression-like programs combining unbounded classical integers and bounded quantum registers… | ||
| Formal framework for reasoning about the precision of dynamic analysis | SAS 2020 | 2020-11-18 |
Provides a formal framework that models dynamic-analysis precision by treating trace properties as equivalence relations and defining obfuscation as… | ||
| nothing matches | ||