output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

researchers with a paper here
collaborating institutions
Showing cs.FLShow all

9 papers · 1 filter

cs.FL2024

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction

Paul Eichler, Swen Jacobs, Chana Weil-Kennedy

We introduce a new framework for verifying systems with a parametric number of concurrently running processes. The systems we consider are well-structured with respect to a specifi…

cs.FL2024

A Uniform Framework for Language Inclusion Problems

Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy

We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" l…

cs.FL2022

Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification

Pierre Ganty, Dario Della Monica

This volume contains the proceedings of the 13th International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2022). The aim of GandALF 2022 symposium is to b…

cs.FL2021★ 1 cited

Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification

Pierre Ganty, Davide Bresolin

This volume contains the proceedings of the 12th International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2021). The aim of GandALF 2021 symposium is to b…

cs.FL2016

A Language-theoretic View on Network Protocols

Pierre Ganty, Boris Köpf, Pedro Valero

Input validation is the first line of defense against malformed or malicious inputs. It is therefore critical that the validator (which is often part of the parser) is free of bugs…

cs.FL2016★ 7 cited

Bounded-oscillation Pushdown Automata

Pierre Ganty, Damir Valput

We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In parti…