Martin Lange

	2009
33		Oliver Friedmann, Martin Lange: Solving Parity Games in Practice. ATVA 2009: 182-196
32		Christian Dax, Felix Klaedtke, Martin Lange: On Regular Temporal Logics with Past, . ICALP (2) 2009: 175-187
31		Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438
30		Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+ CoRR abs/0906.2541: (2009)
	2008
29		Roland Axelsson, Keijo Heljanko, Martin Lange: Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422
28		Martin Lange: A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. Inf. Process. Lett. 108(5): 308-312 (2008)
27		Kai Brünnler, Martin Lange: Cut-free sequent systems for temporal logic. J. Log. Algebr. Program. 76(2): 216-225 (2008)
	2007
26		Martin Lange: Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104
25		Roland Axelsson, Martin Lange: Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR 2007: 62-76
24		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic CoRR abs/0704.3931: (2007)
23		Martin Lange: Three notes on the complexity of model checking fixpoint logic with chop. ITA 41(2): 177-190 (2007)
22		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)
21		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic. Logical Methods in Computer Science 3(2): (2007)
	2006
20		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
19		Christian Dax, Martin Hofmann, Martin Lange: A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284
18		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)
17		Martin Lange: The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput. 204(9): 1346-1367 (2006)
16		Martin Lange, Rafal Somla: Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2): 72-75 (2006)
15		Martin Lange: Model checking propositional dynamic logic with all extras. J. Applied Logic 4(1): 39-49 (2006)
	2005
14		Martin Lange, Rafal Somla: The Complexity of Model Checking Higher Order Fixpoint Logic. MFCS 2005: 640-651
13		Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham: Don't Know in the µ-Calculus. VMCAI 2005: 233-249
12		Martin Lange: Weak Automata for the Linear Time µ-Calculus. VMCAI 2005: 267-281
11		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)
10		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)
9		Martin Lange: A quick axiomatisation of LTL with past. Math. Log. Q. 51(1): 83-88 (2005)
	2004
8		Martin Lange: A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. Advances in Modal Logic 2004: 133-147
7		Martin Lange: Symbolic Model Checking of Non-regular Properties. CAV 2004: 83-95
	2003
6		Jan Johannsen, Martin Lange: CTL+ Is Complete for Double Exponential Time. ICALP 2003: 767-775
	2002
5		Martin Lange: Local Model Checking Games for Fixed Point Logic with Chop. CONCUR 2002: 240-254
4		Martin Lange, Colin Stirling: Model Checking Fixed Point Logic with Chop. FoSSaCS 2002: 250-263
3		Martin Lange: Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. Electr. Notes Theor. Comput. Sci. 68(2): (2002)
2		Martin Lange, Colin Stirling: Model Checking Games for Branching Time Logics. J. Log. Comput. 12(4): 623-639 (2002)
	2001
1		Martin Lange, Colin Stirling: Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365

Coauthor Index

1	Roland Axelsson	[21] [24] [25] [29]
2	Kai Brünnler	[27]
3	Christian Dax	[11] [19] [32]
4	Oliver Friedmann	[33]
5	Orna Grumberg	[13] [22]
6	Keijo Heljanko	[20] [29]
7	Martin Hofmann	[19]
8	Markus Jehle	[18]
9	Jan Johannsen	[6] [18]
10	Tommi A. Junttila	[20]
11	Ahmet Kara	[30] [31]
12	Misa Keinänen	[20]
13	Felix Klaedtke	[32]
14	Timo Latvala	[20]
15	Martin Leucker	[13] [22]
16	Hans-Wolfgang Loidl	[10]
17	Nicolas Rachinsky	[18]
18	Thomas Schwentick	[30] [31]
19	Sharon Shoham	[13] [22]
20	Rafal Somla	[14] [16] [21] [24]
21	Colin Stirling	[1] [2] [4]
22	Volker Weber	[30] [31]

Colors in the list of coauthors