Martin Lange

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
c32		Milka Hutagalung, Martin Lange, Étienne Lozes: Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. LATA 2013: 347-358
	2012
j24		Oliver Friedmann, Martin Lange: Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. 23(3): 669-685 (2012)
j23		Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä: Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78(2): 430-440 (2012)
c31		Markus Latte, Martin Lange: Branching Time? Pruning Time! IJCAR 2012: 393-407
c30		Oliver Friedmann, Martin Lange: Ramsey-Based Analysis of Parity Automata. TACAS 2012: 64-78
c29		Martin Lange, Étienne Lozes: Model-Checking the Higher-Dimensional Modal mu-Calculus. FICS 2012: 39-46
c28		Martin Lange, Étienne Lozes, Manuel Vargas Guzmán: Model-Checking Process Equivalences. GandALF 2012: 43-56
c27		Julian Gutierrez, Felix Klaedtke, Martin Lange: The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity. GandALF 2012: 113-126
	2011
j22		Martin Lange: P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. 111(7): 338-341 (2011)
j21		Oliver Friedmann, Martin Lange: More on balanced diets. J. Funct. Program. 21(2): 135-157 (2011)
c26		Bahareh Badban, Martin Lange: Exact Incremental Analysis of Timed Automata with an SMT-Solver. FORMATS 2011: 177-192
c25		Martin Lange: Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCoS 2011: 28-39
c24		Roland Axelsson, Martin Lange: Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP 2011: 45-57
c23		Oliver Friedmann, Martin Lange: The Modal μ-Calculus Caught Off Guard. TABLEAUX 2011: 149-163
	2010
j20		Christian Dax, Felix Klaedtke, Martin Lange: On regular temporal logics with past. Acta Inf. 47(4): 251-277 (2010)
j19		Oliver Friedmann, Martin Lange: A Solver for Modal Fixpoint Logics. Electr. Notes Theor. Comput. Sci. 262: 99-111 (2010)
c22		Oliver Friedmann, Markus Latte, Martin Lange: A Decision Procedure for CTL^* Based on Tableaux and Automata. IJCAR 2010: 331-345
c21		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81
c20		Martin Lange, Markus Latte: A CTL-Based Logic for Program Abstractions. WoLLIC 2010: 19-33
c19		Oliver Friedmann, Martin Lange: Local Strategy Improvement for Parity Game Solving. GANDALF 2010: 118-131
i3		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. CoRR abs/1006.3709 (2010)
	2009
j18		Martin Lange, Hans Leiß: To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didactica 8 (2009)
j17		Anders Søgaard, Martin Lange: Polyadic Dynamic Logics for HPSG Parsing. Journal of Logic, Language and Information 18(2): 159-198 (2009)
j16		Martin Lange: Model Checking for Hybrid Logic. Journal of Logic, Language and Information 18(4): 465-491 (2009)
c18		Oliver Friedmann, Martin Lange: Solving Parity Games in Practice. ATVA 2009: 182-196
c17		Christian Dax, Felix Klaedtke, Martin Lange: On Regular Temporal Logics with Past, . ICALP (2) 2009: 175-187
c16		Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL⁺. MFCS 2009: 427-438
i2		Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009)
	2008
j15		Martin Lange: A purely model-theoretic proof of the exponential succinctness gap between CTL⁺ and CTL. Inf. Process. Lett. 108(5): 308-312 (2008)
j14		Kai Brünnler, Martin Lange: Cut-free sequent systems for temporal logic. J. Log. Algebr. Program. 76(2): 216-225 (2008)
c15		Stephan Kreutzer, Martin Lange: Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456
c14		Roland Axelsson, Keijo Heljanko, Martin Lange: Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422
	2007
j13		Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham: When not losing is better than winning: Abstraction and refinement for the full mu-calculus. Inf. Comput. 205(8): 1130-1148 (2007)
j12		Martin Lange: Three notes on the complexity of model checking fixpoint logic with chop. ITA 41(2): 177-190 (2007)
j11		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic. Logical Methods in Computer Science 3(2) (2007)
c13		Martin Lange: Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104
c12		Roland Axelsson, Martin Lange: Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR 2007: 62-76
i1		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic. CoRR abs/0704.3931 (2007)
	2006
j10		Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky: Bounded Model Checking for All Regular Properties. Electr. Notes Theor. Comput. Sci. 144(1): 3-18 (2006)
j9		Martin Lange: The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput. 204(9): 1346-1367 (2006)
j8		Martin Lange, Rafal Somla: Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2): 72-75 (2006)
j7		Martin Lange: Model checking propositional dynamic logic with all extras. J. Applied Logic 4(1): 39-49 (2006)
c11		Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala: Bounded Model Checking for Weak Alternating Büchi Automata. CAV 2006: 95-108
c10		Christian Dax, Martin Hofmann, Martin Lange: A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284
	2005
j6		Christian Dax, Martin Lange: Game Over: The Foci Approach to LTL Satisfiability and Model Checking. Electr. Notes Theor. Comput. Sci. 119(1): 33-49 (2005)
j5		Martin Lange, Hans-Wolfgang Loidl: Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. Electr. Notes Theor. Comput. Sci. 128(3): 125-138 (2005)
j4		Martin Lange, Carsten Lutz: 2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symb. Log. 70(4): 1072-1086 (2005)
j3		Martin Lange: A quick axiomatisation of LTL with past. Math. Log. Q. 51(1): 83-88 (2005)
c9		Martin Lange, Rafal Somla: The Complexity of Model Checking Higher Order Fixpoint Logic. MFCS 2005: 640-651
c8		Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham: Don't Know in the µ-Calculus. VMCAI 2005: 233-249
c7		Martin Lange: Weak Automata for the Linear Time µ-Calculus. VMCAI 2005: 267-281
	2004
c6		Martin Lange: A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. Advances in Modal Logic 2004: 133-147
c5		Martin Lange: Symbolic Model Checking of Non-regular Properties. CAV 2004: 83-95
	2003
c4		Jan Johannsen, Martin Lange: CTL⁺ Is Complete for Double Exponential Time. ICALP 2003: 767-775
	2002
j2		Martin Lange: Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. Electr. Notes Theor. Comput. Sci. 68(2): 70-86 (2002)
j1		Martin Lange, Colin Stirling: Model Checking Games for Branching Time Logics. J. Log. Comput. 12(4): 623-639 (2002)
c3		Martin Lange: Local Model Checking Games for Fixed Point Logic with Chop. CONCUR 2002: 240-254
c2		Martin Lange, Colin Stirling: Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263
	2001
c1		Martin Lange, Colin Stirling: Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365

Coauthor Index

1	Roland Axelsson	[c24] [c21] [i3] [c14] [j11] [c12] [i1]
2	Bahareh Badban	[c26]
3	Kai Brünnler	[j14]
4	Christian Dax	[j20] [c17] [c10] [j6]
5	Oliver Friedmann	[j24] [c30] [j21] [c23] [j19] [c22] [c19] [c18]
6	Orna Grumberg	[j13] [c8]
7	Julian Gutierrez	[c27]
8	Manuel Vargas Guzmán	[c28]
9	Matthew Hague	[c21] [i3]
10	Keijo Heljanko	[j23] [c14] [c11]
11	Martin Hofmann	[c10]
12	Milka Hutagalung	[c32]
13	Markus Jehle	[j10]
14	Jan Johannsen	[j10] [c4]
15	Tommi A. Junttila	[c11]
16	Ahmet Kara	[c16] [i2]
17	Misa Keinänen	[j23] [c11]
18	Felix Klaedtke	[c27] [j20] [c17]
19	Stephan Kreutzer	[c21] [i3] [c15]
20	Markus Latte	[c31] [c22] [c21] [c20] [i3]
21	Timo Latvala	[c11]
22	Hans Leiß	[j18]
23	Martin Leucker	[j13] [c8]
24	Hans-Wolfgang Loidl	[j5]
25	Étienne Lozes	[c32] [c29] [c28]
26	Carsten Lutz	[j4]
27	Ilkka Niemelä	[j23]
28	Nicolas Rachinsky	[j10]
29	Thomas Schwentick	[c16] [i2]
30	Sharon Shoham	[j13] [c8]
31	Rafal Somla	[j11] [i1] [j8] [c9]
32	Colin Stirling	[j1] [c2] [c1]
33	Anders Søgaard	[j17]
34	Volker Weber	[c16] [i2]

Colors in the list of coauthors

Last update Fri May 24 10:02:41 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page