Caterina Urban
where else to find them
bluesky:caterinaurban.bsky.social
what they talk about
all 7 in the filters
where they keep going back
all 7 in the filters
on a stage with
all 14 in the filters
who talks about the same things
- Mila Dalla Preda5 talks
- Marco Campion5 talks
- Roberto Giacobazzi13 talks
- Sasa Misailovic13 talks
- Tobias Grosser14 talks
- Sharon Shoham13 talks
| title | conference | date |
|---|---|---|
| Termination Resilience Static Analysis | VMCAI 2026 | 2026-01-12 |
Claims an abstract-interpretation framework that proves absence of robust non-termination by computing piecewise ranking functions backward over a… | ||
| 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… | ||
| Relating Distances and Abstractions: An Abstract Interpretation Perspective | SAS 2025 | 2025-10-13 |
Formalizes when a pre-metric induces an upper closure operator (uco) via Galois connections, showing uco-representable prematrices form a strict subset and… | ||
| Hallucination-Resilient LLM-Driven Sound and Tunable Static Analysis | LMPL 2025 | 2025-10-12 |
Claims a sound, LLM-driven static analyzer called LLMAAM that delegates abstract address allocation to an LLM while guaranteeing soundness by construction and… | ||
| Towards a High Level Linter for Data Science | NSAD 2024 | 2024-10-22 |
Prototype static analyzer assigns abstract datatypes to pandas/numpy/matplotlib/scikit‑learn objects and checks library call signatures to flag high‑level data… | ||
| Abstract Domains for Machine Learning Verification | NSAD 2024 | 2024-10-22 |
Advocates abstract domains that actually compute things: encodes semantic perturbations as extra network inputs and checks robustness of explanations (saliency… | ||
| 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… | ||
| 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… | ||
| Reduced Products of Abstract Domains for Fairness Certification of Neural Networks | SPLASH 2022 | 2022-12-05 |
Libra is an open‑source static analyzer that certifies dependency fairness for ReLU feedforward classifiers by combining a cheap forward pre‑analysis over… | ||
| Reduced Products of Abstract Domains for Fairness Certification of Neural Networks | SAS 2021 | 2021-10-17 |
Tool analyzes ReLU feed‑forward classifiers and first runs a forward pre-analysis that splits the input space by counting uncertain ReLUs against configurable… | ||
| Perfectly Parallel Fairness Certification of Neural Networks | OOPSLA 2020 | 2020-11-15 |
A perfectly parallel static analysis certifies dependency fairness for feed‑forward ReLU networks by combining a cheap forward pre-analysis (interval abstract… | ||
| nothing matches | ||