research
∙
02/10/2023
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
We introduce the class of tree constraint automata with data values in Z...
share
research
∙
04/27/2021
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?
Adding propositional quantification to the modal logics K, T or S4 is kn...
research
∙
07/16/2020
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)
We investigate the expressivity and computational complexity of two moda...
research
∙
06/09/2020
A Complete Axiomatisation for Quantifier-Free Separation Logic
We present the first complete axiomatisation for quantifier-free separat...
research
∙
10/11/2019
Internal Calculi for Separation Logics
We present a general approach to axiomatise separation logics with heapl...
research
∙
10/12/2018
