98 citations
- Universidad Politécnica de MadridES38 papers
- Madrid Institute for Advanced StudiesES15 papers
- Roskilde UniversityDK11 papers
- University of PennsylvaniaUS11 papers
- Max Planck Institute for Software SystemsDE10 papers
- University at Buffalo, State University of New YorkUS9 papers
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Universidad Complutense de MadridES7 papers
- Consejo Superior de Investigaciones CientíficasES5 papers
- Saarland UniversityDE5 papers
- University College LondonGB5 papers
- Centre National de la Recherche ScientifiqueFR4 papers
12 papers · 1 filter
Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification
Bishoksan Kafle, John P. Gallagher
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the co…
Description and Optimization of Abstract Machines in a Dialect of Prolog
Jose F. Morales, Manuel Carro, Manuel Hermenegildo
In order to achieve competitive performance, abstract machines for Prolog and related languages end up being large and intricate, and incorporate sophisticated optimizations, both…
Modelling MAC-Layer Communications in Wireless Systems
Andrea Cerone, Matthew Hennessy, Massimo Merro
We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions.…
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in…
Proving differential privacy in Hoare logic
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias +3
Differential privacy is a rigorous, worst-case notion of privacy-preserving computation. Informally, a probabilistic program is differentially private if the participation of a sin…
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias +3
Mechanism design is the study of algorithm design in which the inputs to the algorithm are controlled by strategic agents, who must be incentivized to faithfully report them. Unlik…