The following pages link to Martin Lange (Q386036):
Displaying 50 items.
- Branching-time logics with path relativisation (Q386037) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
- Model-checking process equivalences (Q477208) (← links)
- Propositional dynamic logic of context-free programs and fixpoint logic with chop (Q845832) (← links)
- Cut-free sequent systems for temporal logic (Q941433) (← links)
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
- On regular temporal logics with past (Q977176) (← links)
- Polyadic dynamic logics for HPSG parsing (Q1016030) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- Space-efficient fragments of higher-order fixpoint logic (Q1685775) (← links)
- Model checking CTL over restricted classes of automatic structures (Q1685784) (← links)
- Multi-buffer simulations: decidability and complexity (Q1784963) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- DiMo -- discrete modelling using propositional logic (Q2118304) (← links)
- A similarity measure for formal languages based on convergent geometric series (Q2164738) (← links)
- Specifying program properties using modal fixpoint logics: a survey of results (Q2284176) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Reachability is NP-complete even for the simplest neural networks (Q2695495) (← links)
- Temporal Logics in Computer Science (Q2805273) (← links)
- Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition (Q2842604) (← links)
- (Q2848153) (← links)
- (Q2848673) (← links)
- (Q2849561) (← links)
- Satisfiability Games for Branching-Time Logics (Q2851673) (← links)
- Ramsey-Based Analysis of Parity Automata (Q2894266) (← links)
- Branching Time? Pruning Time! (Q2908510) (← links)
- TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING (Q2909223) (← links)
- Conjunctive Visibly-Pushdown Path Queries (Q2947891) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- More on balanced diets (Q3021419) (← links)
- Automatentheorie und Logik (Q3083622) (← links)
- (Q3086929) (← links)
- Model Checking Games for Branching Time Logics (Q3146304) (← links)
- A quick axiomatisation of LTL with past (Q3159405) (← links)
- Exact Incremental Analysis of Timed Automata with an SMT-Solver (Q3172851) (← links)
- Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics (Q3172863) (← links)
- Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic (Q3190153) (← links)
- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (Q3192206) (← links)
- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic (Q3498457) (← links)
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (Q3519518) (← links)
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness (Q3525631) (← links)
