Martin Lange - RankMe

143 papers A* 6A 8B 13C 15Misc 1Journal 52Unranked 43

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes. CoRR Florian Bruse, Martin Lange
2026	J	`jnl`	On the Expressiveness of State Space Models via Temporal Logics. CoRR Eric Alsmann, Lowejatan Noori, Martin Lange
2026	J	`jnl`	Verifying and interpreting neural networks using finite automata. Inf. Comput. Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange
2025	—	`conf`	A Finite Abstraction of Real-Valued Functions for Complete Reasoning About Influence. FroCoS Sören Möller, Florian Bruse, Martin Lange
2025	C	`conf`	An Earley-Based Universal Error-Correcting Parser. CIAA Maurice Herwig, Norbert Hundeshagen, Martin Lange
2025	C	`conf`	Metric Linear-Time Temporal Logic with Strict First-Time Semantics. TIME Eric Alsmann, Martin Lange
2025	—	`conf`	On the Complexity of Formal Reasoning in State Space Models (Extended Abstract). SAIV Eric Alsmann, Martin Lange
2025	A	`conf`	The Computational Complexity of Satisfiability in State Space Models. ECAI Eric Alsmann, Martin Lange
2025	J	`jnl`	The Computational Complexity of Satisfiability in State Space Models. CoRR Eric Alsmann, Martin Lange
2025	J	`jnl`	The Logical Expressiveness of Temporal GNNs via Two-Dimensional Product Logics. CoRR Marco Sälzer, Przemyslaw Andrzej Walega, Martin Lange
2025	A*	`conf`	Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning. ICLR Marco Sälzer, Eric Alsmann, Martin Lange
2024	—	`conf`	Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints. FICS@CSL Florian Bruse, David Kronenberger, Martin Lange
2024	—	`conf`	Computing All Minimal Ways to Reach a Context-Free Language. RP Florian Bruse, Martin Lange
2024	J	`jnl`	Model checking timed recursive CTL. Inf. Comput. Florian Bruse, Martin Lange
2024	—	`conf`	Problem-Specific Visual Feedback in Discrete Modelling. DeLFI Maurice Herwig, Norbert Hundeshagen, John Hundhausen, Stefan Kablowski, Martin Lange
2024	J	`jnl`	The Computational Complexity of Formal Reasoning for Encoder-Only Transformers. CoRR Marco Sälzer, Eric Alsmann, Martin Lange
2024	C	`conf`	Verifying and Interpreting Neural Networks Using Finite Automata. DLT Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange
2024	J	`jnl`	Weights of formal languages based on geometric series with an application to automatic grading. Theor. Comput. Sci. Florian Bruse, Maurice Herwig, Martin Lange
2023	A	`conf`	Formal Reasoning About Influence in Natural Sciences Experiments. CADE Florian Bruse, Martin Lange, Sören Möller
2023	A*	`conf`	Fundamental Limits in Formal Verification of Message-Passing Neural Networks. ICLR Marco Sälzer, Martin Lange
2023	—	`conf`	On Challenges and Opportunities in the Translation of Deep Neural Networks into Finite Automata. OVERLAY@AI*IA Marco Sälzer, Eric Alsmann, Martin Lange
2023	C	`conf`	The Calculus of Temporal Influence. TIME Florian Bruse, Marit Kastaun, Martin Lange, Sören Möller
2023	J	`jnl`	The tail-recursive fragment of timed recursive CTL. Inf. Comput. Florian Bruse, Martin Lange
2022	C	`conf`	A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA Florian Bruse, Maurice Herwig, Martin Lange
2022	—	`conf`	Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF Florian Bruse, David Kronenberger, Martin Lange
2022	J	`jnl`	Local higher-order fixpoint iteration. Inf. Comput. Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer
2022	J	`jnl`	Reachability In Simple Neural Networks. CoRR Marco Sälzer, Martin Lange
2022	J	`jnl`	Reachability in Simple Neural Networks. Fundam. Informaticae Marco Sälzer, Martin Lange
2022	C	`conf`	The Tail-Recursive Fragment of Timed Recursive CTL. TIME Florian Bruse, Martin Lange, Étienne Lozes
2022	J	`jnl`	Verifying And Interpreting Neural Networks using Finite Automata. CoRR Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange
2022	J	`jnl`	We Cannot Guarantee Safety: The Undecidability of Graph Neural Network Verification. CoRR Marco Sälzer, Martin Lange
2021	B	`conf`	A Decidable Non-Regular Modal Fixpoint Logic. CONCUR Florian Bruse, Martin Lange
2021	—	`conf`	A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper). FMTea Norbert Hundeshagen, Martin Lange
2021	A	`conf`	DiMo - Discrete Modelling Using Propositional Logic. SAT Norbert Hundeshagen, Martin Lange, Georg Siebert
2021	B	`conf`	Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. MFCS Florian Bruse, Marco Sälzer, Martin Lange
2021	C	`conf`	Model Checking Timed Recursive CTL. TIME Florian Bruse, Martin Lange
2021	J	`jnl`	Reachability Is NP-Complete Even for the Simplest Neural Networks. CoRR Marco Sälzer, Martin Lange
2021	—	`conf`	Reachability is NP-Complete Even for the Simplest Neural Networks. RP Marco Sälzer, Martin Lange
2021	—	`conf`	Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS Eric Alsmann, Florian Bruse, Martin Lange
2021	J	`jnl`	Temporal logic with recursion. Inf. Comput. Florian Bruse, Martin Lange
2021	J	`jnl`	The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundam. Informaticae Florian Bruse, Martin Lange, Étienne Lozes
2020	A	`conf`	Existential Length Universality. STACS Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula
2020	—	`conf`	Local Higher-Order Fixpoint Iteration. GandALF Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer
2020	J	`jnl`	Model checking for hybrid branching-time logics. J. Log. Algebraic Methods Program. Daniel Kernberger, Martin Lange
2020	J	`jnl`	On the expressive power of hybrid branching-time logics. Theor. Comput. Sci. Daniel Kernberger, Martin Lange
2020	C	`conf`	Temporal Logic with Recursion. TIME Florian Bruse, Martin Lange
2019	—	`ed.`	49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, INFORMATIK 2019 - Workshops, Kassel, Germany, September 23-26, 2019 GI-Jahrestagung (Workshops) Claude Draude, Martin Lange, Bernhard Sick
2019	—	`ed.`	49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, INFORMATIK 2019, Kassel, Germany, September 23-26, 2019 GI-Jahrestagung Klaus David, Kurt Geihs, Martin Lange, Gerd Stumme
2019	C	`conf`	EMFeR: Model Checking for Object Oriented (EMF) Models. MODELSWARD Christoph Eickhoff, Martin Lange, Simon-Lennert Raesch, Albert Zündorf
2019	—	`conf`	Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results. ICLA Martin Lange
2018	J	`jnl`	22nd International Symposium on Temporal Representation and Reasoning (TIME 2015). Inf. Comput. Fabio Grandi, Martin Lange, Alessio Lomuscio
2018	J	`jnl`	Multi-buffer simulations: Decidability and complexity. Inf. Comput. Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2018	C	`conf`	On the Expressive Power of Hybrid Branching-Time Logics. TIME Daniel Kernberger, Martin Lange
2017	—	`conf`	Model Checking CTL over Restricted Classes of Automatic Structures. RP Norbert Hundeshagen, Martin Lange
2017	—	`conf`	Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP Florian Bruse, Martin Lange, Étienne Lozes
2017	C	`conf`	The Fully Hybrid mu-Calculus. TIME Daniel Kernberger, Martin Lange
2017	—	`conf`	The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs. ThEdu@CADE Arno Ehle, Norbert Hundeshagen, Martin Lange
2016	—	`conf`	A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF Florian Bruse, Daniel Kernberger, Martin Lange
2016	C	`conf`	Model Checking for the Full Hybrid Computation Tree Logic. TIME Daniel Kernberger, Martin Lange
2016	—	`conf`	Multi-Buffer Simulations for Trace Language Inclusion. GandALF Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2016	—	`book`	Temporal Logics in Computer Science: Finite-State Systems Stéphane Demri, Valentin Goranko, Martin Lange
2016	—	`conf`	Two-Buffer Simulation Games. Cassting/SynCoP Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2015	C	`ed.`	22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015 TIME Fabio Grandi, Martin Lange, Alessio Lomuscio
2015	B	`conf`	Conjunctive Visibly-Pushdown Path Queries. FCT Martin Lange, Étienne Lozes
2015	J	`jnl`	On guarded transformation in the modal μ-calculus. Log. J. IGPL Florian Bruse, Oliver Friedmann, Martin Lange
2015	J	`jnl`	Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. Oliver Friedmann, Felix Klaedtke, Martin Lange
2015	—	`conf`	The Arity Hierarchy in the Polyadic μ-Calculus. FICS Martin Lange
2015	J	`jnl`	The Sequent Calculus Trainer - Helping Students to Correctly Construct Proofs. CoRR Arno Ehle, Norbert Hundeshagen, Martin Lange
2014	A	`conf`	A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic. IJCAR Rüdiger Ehlers, Martin Lange
2014	J	`jnl`	Branching-time logics with path relativisation. J. Comput. Syst. Sci. Markus Latte, Martin Lange
2014	—	`conf`	Buffered Simulation Games for Büchi Automata. AFL Milka Hutagalung, Martin Lange, Étienne Lozes
2014	—	`conf`	Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. IFIP TCS Martin Lange, Étienne Lozes
2014	Misc	`conf`	Model Checking for String Problems. CSR Milka Hutagalung, Martin Lange
2014	J	`jnl`	Model-checking process equivalences. Theor. Comput. Sci. Martin Lange, Étienne Lozes, Manuel Vargas Guzmán
2014	—	`conf`	The Fixpoint-Iteration Algorithm for Parity Games. GandALF Florian Bruse, Michael Falk, Martin Lange
2014	J	`jnl`	The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. Theor. Comput. Sci. Julian Gutierrez, Felix Klaedtke, Martin Lange
2013	J	`jnl`	Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics Oliver Friedmann, Martin Lange
2013	J	`jnl`	Guarded Transformation for the Modal mu-Calculus CoRR Florian Bruse, Oliver Friedmann, Martin Lange
2013	—	`conf`	Ramsey Goes Visibly Pushdown. ICALP (2) Oliver Friedmann, Felix Klaedtke, Martin Lange
2013	C	`conf`	Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA Milka Hutagalung, Martin Lange, Étienne Lozes
2013	J	`jnl`	Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. Oliver Friedmann, Markus Latte, Martin Lange
2012	A	`conf`	Branching Time? Pruning Time! IJCAR Markus Latte, Martin Lange
2012	—	`conf`	Model-Checking Process Equivalences GandALF Martin Lange, Étienne Lozes, Manuel Vargas Guzmán
2012	—	`conf`	Model-Checking the Higher-Dimensional Modal mu-Calculus FICS Martin Lange, Étienne Lozes
2012	A	`conf`	Ramsey-Based Analysis of Parity Automata. TACAS Oliver Friedmann, Martin Lange
2012	J	`jnl`	Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä
2012	—	`conf`	The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity GandALF Julian Gutierrez, Felix Klaedtke, Martin Lange
2012	J	`jnl`	Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. Oliver Friedmann, Martin Lange
2011	—	`book`	Automatentheorie und Logik. Martin Hofmann, Martin Lange
2011	—	`conf`	Exact Incremental Analysis of Timed Automata with an SMT-Solver. FORMATS Bahareh Badban, Martin Lange
2011	—	`conf`	Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP Roland Axelsson, Martin Lange
2011	J	`jnl`	More on balanced diets. J. Funct. Program. Oliver Friedmann, Martin Lange
2011	J	`jnl`	P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. Martin Lange
2011	—	`conf`	Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCoS Martin Lange
2011	—	`conf`	Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics. TABLEAUX (Workshops, Tutorials, and Short Papers) Martin Lange
2011	B	`conf`	The Modal TABLEAUX Oliver Friedmann, Martin Lange
2010	C	`conf`	A CTL-Based Logic for Program Abstractions. WoLLIC Martin Lange, Markus Latte
2010	A	`conf`	A Decision Procedure for CTL IJCAR Oliver Friedmann, Markus Latte, Martin Lange
2010	J	`jnl`	Extended Computation Tree Logic CoRR Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
2010	—	`conf`	Extended Computation Tree Logic. LPAR (Yogyakarta) Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
2010	—	`conf`	Local Strategy Improvement for Parity Game Solving GANDALF Oliver Friedmann, Martin Lange
2010	J	`jnl`	On regular temporal logics with past. Acta Informatica Christian Dax, Felix Klaedtke, Martin Lange
2009	—	`conf`	A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order. FICS Stephan Kreutzer, Martin Lange
2009	—	`conf`	A Solver for Modal Fixpoint Logics. M4M Oliver Friedmann, Martin Lange
2009	J	`jnl`	Model Checking for Hybrid Logic. J. Log. Lang. Inf. Martin Lange
2009	—	`conf`	On Regular Temporal Logics with Past, . ICALP (2) Christian Dax, Felix Klaedtke, Martin Lange
2009	B	`conf`	On the Hybrid Extension of CTL and CTL MFCS Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
2009	J	`jnl`	On the Hybrid Extension of CTL and CTL+ CoRR Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber
2009	J	`jnl`	Polyadic Dynamic Logics for HPSG Parsing. J. Log. Lang. Inf. Anders Søgaard, Martin Lange
2009	B	`conf`	Solving Parity Games in Practice. ATVA Oliver Friedmann, Martin Lange
2009	J	`jnl`	To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didact. Martin Lange, Hans Leiß
2008	J	`jnl`	A purely model-theoretic proof of the exponential succinctness gap between CTL Inf. Process. Lett. Martin Lange
2008	—	`conf`	Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) Roland Axelsson, Keijo Heljanko, Martin Lange
2008	J	`jnl`	Cut-free sequent systems for temporal logic. J. Log. Algebraic Methods Program. Kai Brünnler, Martin Lange
2008	—	`conf`	Non-regular fixed-point logics and games. Logic and Automata Stephan Kreutzer, Martin Lange
2007	B	`conf`	Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR Martin Lange
2007	B	`conf`	Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR Roland Axelsson, Martin Lange
2007	J	`jnl`	The Complexity of Model Checking Higher-Order Fixpoint Logic CoRR Roland Axelsson, Martin Lange, Rafal Somla
2007	J	`jnl`	The Complexity of Model Checking Higher-Order Fixpoint Logic. Log. Methods Comput. Sci. Roland Axelsson, Martin Lange, Rafal Somla
2007	J	`jnl`	Three notes on the complexity of model checking fixpoint logic with chop. RAIRO Theor. Informatics Appl. Martin Lange
2007	J	`jnl`	When not losing is better than winning: Abstraction and refinement for the full mu-calculus. Inf. Comput. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
2006	—	`conf`	A Proof System for the Linear Time µ-Calculus. FSTTCS Christian Dax, Martin Hofmann, Martin Lange
2006	A*	`conf`	Bounded Model Checking for Weak Alternating Büchi Automata. CAV Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala
2006	J	`jnl`	Model checking propositional dynamic logic with all extras. J. Appl. Log. Martin Lange
2006	J	`jnl`	Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. Martin Lange, Rafal Somla
2006	J	`jnl`	The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput. Martin Lange
2005	J	`jnl`	2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symb. Log. Martin Lange, Carsten Lutz
2005	J	`jnl`	A quick axiomatisation of LTL with past. Math. Log. Q. Martin Lange
2005	—	`conf`	Bounded Model Checking for All Regular Properties. BMC@CAV Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky
2005	B	`conf`	The Complexity of Model Checking Higher Order Fixpoint Logic. MFCS Martin Lange, Rafal Somla
2005	B	`conf`	Weak Automata for the Linear Time µ-Calculus. VMCAI Martin Lange
2004	B	`conf`	A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. Advances in Modal Logic Martin Lange
2004	—	`conf`	Game Over: The Foci Approach to LTL Satisfiability and Model Checking. GDV@CAV Christian Dax, Martin Lange
2004	—	`conf`	Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. PDMC Martin Lange, Hans-Wolfgang Loidl
2004	A*	`conf`	Symbolic Model Checking of Non-regular Properties. CAV Martin Lange
2003	A*	`conf`	CTL ICALP Jan Johannsen, Martin Lange
2003	—	`—`	Games for modal and temporal logics. Martin Lange
2002	—	`conf`	Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. EXPRESS Martin Lange
2002	B	`conf`	Local Model Checking Games for Fixed Point Logic with Chop. CONCUR Martin Lange
2002	B	`conf`	Model Checking Fixed Point Logic with Chop. FoSSaCS Martin Lange, Colin Stirling
2002	J	`jnl`	Model Checking Games for Branching Time Logics. J. Log. Comput. Martin Lange, Colin Stirling
2001	A*	`conf`	Focus Games for Satisfiability and Completeness of Temporal Logic. LICS Martin Lange, Colin Stirling
1998	—	`conf`	Truth - A verification platform for concurrent systems. Tool Support for System Specification, Development and Verification Martin Lange, Martin Leucker, Thomas Noll, Stephan Tobies