40.2k citations
- Max Planck SocietyDE68 papers
- University of OxfordGB25 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Saarland UniversityDE17 papers
- University of CambridgeGB12 papers
- ETH ZurichCH11 papers
- IMDEA Software InstituteES10 papers
- Indian Institute of Technology KharagpurIN10 papers
- University of California, Los AngelesUS10 papers
- Max Planck Institute for InformaticsDE9 papers
- National University of SingaporeSG9 papers
- Newcastle UniversityGB9 papers
4 papers · 2 filters
Timed Automata Robustness Analysis via Model Checking
Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol +1
Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whet…
Higher-order probabilistic adversarial computations: Categorical semantics and program logics
Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +3
Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with pri…
The Orbit Problem for Parametric Linear Dynamical Systems
Christel Baier, Florian Funke, Simon Jantsch +7
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical systems. We show decidability in the case of one parameter and Skolem-hardness with two or mor…
Being correct is not enough: efficient verification using robust linear temporal logic
Tzanis Anevlavis, Matthew Philippe, Daniel Neider +1
While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this paper we present and study the logic rLTL which provides a…