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 · 1 filter
A mathematical model of vaccine hesitancy: Analysing the impact of political trends and the interaction across age and education groups in the USA
Wajid Ali, Javad Mohamadichamgavi, Juan Ramirez +3
Vaccination against the SARS-CoV-2 disease has significantly reduced its mortality rate and spread. However, despite its availability, a considerable proportion of the public has e…
Hiord#: An Approach to the Specification and Verification of Higher-Order (C)LP Programs
Marco Ciccalè, Daniel Jurjo-Rivas, Jose F. Morales +2
Higher-order constructs enable more expressive and concise code by allowing procedures to be parameterized by other procedures. Assertions allow expressing partial program specific…
Monitoring Robustness and Individual Fairness
Ashutosh Gupta, Thomas A. Henzinger, Konstantin Kueffner +2
Input-output robustness appears in various different forms in the literature, such as robustness of AI models to adversarial or semantic perturbations and individual fairness of AI…
Supermartingale Certificates for Quantitative Omega-regular Verification and Control
Thomas A. Henzinger, Kaushik Mallik, Pouya Sadeghi +1
We present the first supermartingale certificate for quantitative -regular properties of discrete-time infinite-state stochastic systems. Our certificate is defined on the produ…
Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach (Extended Version)
Marcos Grandury, Aleksandar Nanevski, Alexander Gryzlov
Verifying graph algorithms has long been considered challenging in separation logic, mainly due to structural sharing between graph subcomponents. We show that these challenges can…