output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

Showing 2023Show all

7 papers · 1 filter

cs.LO2023★ 3 cited

Efficient Reactive Synthesis Using Mode Decomposition

Matías Brizzio, César Sánchez

Developing critical components, such as mission controllers or embedded systems, is a challenging task. Reactive synthesis is a technique to automatically produce correct controlle…

cs.CR2023

SYSPART: Automated Temporal System Call Filtering for Binaries

Vidya Lakshmi Rajagopalan, Konstantinos Kleftogiorgos, Enes Göktaş +2

Restricting the system calls available to applications reduces the attack surface of the kernel and limits the functionality available to compromised applications. Recent approache…

cs.CR2023★ 10 cited

Cybercrime Bitcoin Revenue Estimations: Quantifying the Impact of Methodology and Coverage

Gibran Gomez, Kevin van Liebergen, Juan Caballero

Multiple works have leveraged the public Bitcoin ledger to estimate the revenue cybercriminals obtain from their victims. Estimations focusing on the same target often do not agree…

cs.PL2023★ 1 cited

Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis

Maximiliano Klemen, Miguel Á. Carreira-Perpiñán, Pedro Lopez-Garcia

Automatic static cost analysis infers information about the resources used by programs without actually running them with concrete data, and presents such information as functions…

cs.PL2023★ 2 cited

Demonstrating (Hybrid) Active Logic Documents and the Ciao Prolog Playground, and an Application to Verification Tutorials

Daniela Ferreiro, José F. Morales, Salvador Abreu +1

Active Logic Documents (ALD) are web pages which incorporate embedded Prolog engines that run locally within the browser. ALD offers both a very easy way to add click-to-run capabi…

cs.LO2023

Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack: Extended Version

Jesús Domínguez, Aleksandar Nanevski

Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points (LP). However, LPs often hinder…