7 citations · 10 across the 6 of their papers we have counts for
6 papers · 1 filter
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes
Florian Bruse, David Kronenberger, Martin Lange
Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi…
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
Eric Alsmann, Florian Bruse, Martin Lange
We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynam…
Local Higher-Order Fixpoint Iteration
Florian Bruse, Jörg Kreiker, Martin Lange +1
Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in…
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs
Arno Ehle, Norbert Hundeshagen, Martin Lange
The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Form…
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
Julian Gutierrez, Felix Klaedtke, Martin Lange
It is known that the alternation hierarchy of least and greatest fixpoint operators in the mu-calculus is strict. However, the strictness of the alternation hierarchy does not nece…
Model-Checking Process Equivalences
Martin Lange, Etienne Lozes, Manuel Vargas Guzmán
Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic…