output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

researchers with a paper here
collaborating institutions
Showing 2012Show all

6 papers · 1 filter

cs.PL2012★ 13 cited

Lightweight compilation of (C)LP to JavaScript

Jose F. Morales, Rémy Haemmerlé, Manuel Carro +1

We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applic…

cs.PL2012★ 7 cited

Underapproximation of Procedure Summaries for Integer Programs

Pierre Ganty, Radu Iosif, Filip Konecny

We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approac…

cs.LO2012★ 10 cited

Denotation of syntax and metaprogramming in contextual modal type theory (CMTT)

Murdoch Gabbay, Aleksandar Nanevski

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculu…

cs.FL2012★ 22 cited

A Perfect Model for Bounded Verification

Javier Esparza, Pierre Ganty, Rupak Majumdar

A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic…

cs.PL2012★ 1 cited

Abstracting Runtime Heaps for Program Understanding

Mark Marron, Cesar Sanchez, Zhendong Su +1

Modern programming environments provide extensive support for inspecting, analyzing, and testing programs based on the algorithmic structure of a program. Unfortunately, support fo…

cs.PL2012★ 3 cited

Structural Analysis: Shape Information via Points-To Computation

Mark Marron

This paper introduces a new hybrid memory analysis, Structural Analysis, which combines an expressive shape analysis style abstract domain with efficient and simple points-to style…