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
9 papers · 1 filter
Decomposition by tree dimension in Horn clause verification
Bishoksan Kafle, John P. Gallagher, Pierre Ganty
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for exam…
Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR
Umer Liqat, Kyriakos Georgiou, Steve Kerrison +4
The static estimation of the energy consumed by program executions is an important challenge, which has applications in program optimization and verification, and is instrumental i…
Relational reasoning via probabilistic coupling
Gilles Barthe, Thomas Espitau, Benjamin Grégoire +3
Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that model…
Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects
Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee +1
Designing scalable concurrent objects, which can be efficiently used on multicore processors, often requires one to abandon standard specification techniques, such as linearizabili…
Practical Run-time Checking via Unobtrusive Property Caching
Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo
The use of annotations, referred to as assertions or contracts, to describe program properties for which run-time tests are to be generated, has become frequent in dynamic programi…
Model Checking Parameterized Asynchronous Shared-Memory Systems
Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty +1
We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes.…