976 citations
- Centre National de la Recherche ScientifiqueFR49 papers
- Technical University of DenmarkDK38 papers
- Aarhus UniversityDK29 papers
- University of CopenhagenDK23 papers
- Tokyo Institute of TechnologyJP19 papers
- University of ManchesterGB18 papers
- École Polytechnique Fédérale de LausanneCH17 papers
- University of OxfordGB16 papers
- Centre de Physique ThéoriqueFR14 papers
- East China Normal UniversityCN14 papers
- IMAR - Institutul de Matematică „Simion Stoilow” al Academiei RomâneRO14 papers
- Imperial College LondonGB14 papers
40 papers · 1 filter
The Complexity of Generalized HyperLTL with Stuttering and Contexts
Gaëtan Regaud, Martin Zimmermann
We settle the complexity of satisfiability and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyper…
Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems
Asger Horn Brorholt, Andreas Holck Høeg-Petersen, Peter Gjøl Jensen +4
We present Uppaal Coshy, a tool for automatic synthesis of a safety strategy -- or shield -- for Markov decision processes over continuous state spaces and complex hybrid dynamics.…
A Type System for Data Flow and Alias Analysis in ReScript
Nicky Ask Lund, Hans Hüttel
ReScript is a strongly typed language that targets JavaScript, as an alternative to gradually typed languages, such as TypeScript. In this paper, we present a sound type system for…
Efficient Shield Synthesis via State-Space Transformation
Asger Horn Brorholt, Andreas Holck Høeg-Petersen, Kim Guldstrand Larsen +1
We consider the problem of synthesizing safety strategies for control systems, also known as shields. Since the state space is infinite, shields are typically computed over a finit…
The Complexity of Data-Free Nfer
Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
Nfer is a Runtime Verification language for the analysis of event traces that applies rules to create hierarchies of time intervals. This work examines the complexity of the evalua…
The Complexity of Second-order HyperLTL
Hadar Frenkel, Gaëtan Regaud, Martin Zimmermann
We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. W…