Martin Lange

	2012
54		Martin Lange, Étienne Lozes: Model-Checking the Higher-Dimensional Modal mu-Calculus FICS 2012: 39-46
53		Oliver Friedmann, Martin Lange: Ramsey-Based Analysis of Parity Automata. TACAS 2012: 64-78
52		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)
	2011
51		Bahareh Badban, Martin Lange: Exact Incremental Analysis of Timed Automata with an SMT-Solver. FORMATS 2011: 177-192
50		Martin Lange: Size-Change Termination and Satisfiability for Linear-Time Temporal Logics. FroCos 2011: 28-39
49		Roland Axelsson, Martin Lange: Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP 2011: 45-57
48		Oliver Friedmann, Martin Lange: The Modal μ-Calculus Caught Off Guard. TABLEAUX 2011: 149-163
47		Martin Lange: P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. 111(7): 338-341 (2011)
46		Oliver Friedmann, Martin Lange: More on balanced diets. J. Funct. Program. 21(2): 135-157 (2011)
	2010
45		Oliver Friedmann, Martin Lange: Local Strategy Improvement for Parity Game Solving GANDALF 2010: 118-131
44		Oliver Friedmann, Markus Latte, Martin Lange: A Decision Procedure for CTL* Based on Tableaux and Automata. IJCAR 2010: 331-345
43		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81
42		Martin Lange, Markus Latte: A CTL-Based Logic for Program Abstractions. WoLLIC 2010: 19-33
41		Christian Dax, Felix Klaedtke, Martin Lange: On regular temporal logics with past. Acta Inf. 47(4): 251-277 (2010)
40		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic CoRR abs/1006.3709: (2010)
39		Oliver Friedmann, Martin Lange: A Solver for Modal Fixpoint Logics. Electr. Notes Theor. Comput. Sci. 262: 99-111 (2010)
	2009
38		Oliver Friedmann, Martin Lange: Solving Parity Games in Practice. ATVA 2009: 182-196
37		Christian Dax, Felix Klaedtke, Martin Lange: On Regular Temporal Logics with Past, . ICALP (2) 2009: 175-187
36		Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438
35		Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+ CoRR abs/0906.2541: (2009)
34		Martin Lange, Hans Leiß: To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didactica 8: (2009)
33		Anders Søgaard, Martin Lange: Polyadic Dynamic Logics for HPSG Parsing. Journal of Logic, Language and Information 18(2): 159-198 (2009)
32		Martin Lange: Model Checking for Hybrid Logic. Journal of Logic, Language and Information 18(4): 465-491 (2009)
	2008
31		Roland Axelsson, Keijo Heljanko, Martin Lange: Analyzing Context-Free Grammars Using an Incremental SAT Solver. ICALP (2) 2008: 410-422
30		Stephan Kreutzer, Martin Lange: Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456
29		Martin Lange: A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. Inf. Process. Lett. 108(5): 308-312 (2008)
28		Kai Brünnler, Martin Lange: Cut-free sequent systems for temporal logic. J. Log. Algebr. Program. 76(2): 216-225 (2008)
	2007
27		Martin Lange: Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. CONCUR 2007: 90-104
26		Roland Axelsson, Martin Lange: Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR 2007: 62-76
25		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic CoRR abs/0704.3931: (2007)
24		Martin Lange: Three notes on the complexity of model checking fixpoint logic with chop. ITA 41(2): 177-190 (2007)
23		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)
22		Roland Axelsson, Martin Lange, Rafal Somla: The Complexity of Model Checking Higher-Order Fixpoint Logic. Logical Methods in Computer Science 3(2): (2007)
	2006
21		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
20		Christian Dax, Martin Hofmann, Martin Lange: A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284
19		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)
18		Martin Lange: The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput. 204(9): 1346-1367 (2006)
17		Martin Lange, Rafal Somla: Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2): 72-75 (2006)
16		Martin Lange: Model checking propositional dynamic logic with all extras. J. Applied Logic 4(1): 39-49 (2006)
	2005
15		Martin Lange, Rafal Somla: The Complexity of Model Checking Higher Order Fixpoint Logic. MFCS 2005: 640-651
14		Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham: Don't Know in the µ-Calculus. VMCAI 2005: 233-249
13		Martin Lange: Weak Automata for the Linear Time µ-Calculus. VMCAI 2005: 267-281
12		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)
11		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)
10		Martin Lange, Carsten Lutz: 2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symb. Log. 70(4): 1072-1086 (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): 70-86 (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	[22] [25] [26] [31] [40] [43] [49]
2	Bahareh Badban	[51]
3	Kai Brünnler	[28]
4	Christian Dax	[12] [20] [37] [41]
5	Oliver Friedmann	[38] [39] [44] [45] [46] [48] [53]
6	Orna Grumberg	[14] [23]
7	Matthew Hague	[40] [43]
8	Keijo Heljanko	[21] [31] [52]
9	Martin Hofmann	[20]
10	Markus Jehle	[19]
11	Jan Johannsen	[6] [19]
12	Tommi A. Junttila	[21]
13	Ahmet Kara	[35] [36]
14	Misa Keinänen	[21] [52]
15	Felix Klaedtke	[37] [41]
16	Stephan Kreutzer	[30] [40] [43]
17	Markus Latte	[40] [42] [43] [44]
18	Timo Latvala	[21]
19	Hans Leiß	[34]
20	Martin Leucker	[14] [23]
21	Hans-Wolfgang Loidl	[11]
22	Étienne Lozes	[54]
23	Carsten Lutz	[10]
24	Ilkka Niemelä	[52]
25	Nicolas Rachinsky	[19]
26	Thomas Schwentick	[35] [36]
27	Sharon Shoham	[14] [23]
28	Anders Søgaard	[33]
29	Rafal Somla	[15] [17] [22] [25]
30	Colin Stirling	[1] [2] [4]
31	Volker Weber	[35] [36]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page