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
5 papers · 2 filters
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…
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…
Pushdown flow analysis with abstract garbage collection
J. Ian Johnson, Ilya Sergey, Christopher Earl +2
In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection push the boundaries of what we can learn about programs statically. This work…
Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
Alejandro Serrano, Pedro Lopez-Garcia, Manuel V. Hermenegildo
We present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expr…
On Termination, Confluence and Consistent CHR-based Type Inference
Gregory J. Duck, Remy Haemmerle, Martin Sulzmann
We consider the application of Constraint Handling Rules (CHR) for the specification of type inference systems, such as that used by Haskell. Confluence of CHR guarantees that the…