×

zbMATH — the first resource for mathematics

Lange, Martin

Compute Distance To:
Author ID: lange.martin Recent zbMATH articles by "Lange, Martin"
Published as: Lange, M.; Lange, Martin
External Links: MGP
Documents Indexed: 78 Publications since 1999, including 2 Books

Publications by Year

Citations contained in zbMATH Open

50 Publications have been cited 173 times in 128 Documents Cited by Year
Solving parity games in practice. Zbl 1258.68077
Friedmann, Oliver; Lange, Martin
15
2009
Model checking propositional dynamic logic with all extras. Zbl 1095.68053
Lange, Martin
14
2006
A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata. Zbl 1257.03035
Friedmann, Oliver; Latte, Markus; Lange, Martin
10
2010
Cut-free sequent systems for temporal logic. Zbl 1151.03009
Brünnler, Kai; Lange, Martin
10
2008
A proof system for the linear time \(\mu \)-calculus. Zbl 1163.03308
Dax, Christian; Hofmann, Martin; Lange, Martin
10
2006
Don’t know in the \(\mu\)-calculus. Zbl 1112.68090
Grumberg, Orna; Lange, Martin; Leucker, Martin; Shoham, Sharon
9
2005
Temporal logics in computer science. Finite-state systems. Zbl 1380.68003
Demri, Stéphane; Goranko, Valentin; Lange, Martin
8
2016
When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus. Zbl 1306.68100
Grumberg, Orna; Lange, Martin; Leucker, Martin; Shoham, Sharon
7
2007
Linear time logics around PSL: Complexity, expressiveness, and a little bit of succinctness. Zbl 1151.68540
Lange, Martin
6
2007
2-ExpTime lower bounds for propositional dynamic logics with intersection. Zbl 1100.03017
Lange, Martin; Lutz, Carsten
6
2005
CTL\(^{+}\) is complete for double exponential time. Zbl 1039.68073
Johannsen, Jan; Lange, Martin
6
2003
On the hybrid extension of CTL and CTL\(^{ + }\). Zbl 1250.03029
Kara, Ahmet; Weber, Volker; Lange, Martin; Schwentick, Thomas
4
2009
Model checking fixed point logic with chop. Zbl 1077.68690
Lange, Martin; Stirling, Colin
4
2002
On guarded transformation in the modal \(\mu\)-calculus. Zbl 1405.03048
Bruse, Florian; Friedmann, Oliver; Lange, Martin
3
2015
Solving parity games by a reduction to SAT. Zbl 1279.68211
Heljanko, Keijo; Keinänen, Misa; Lange, Martin; Niemelä, Ilkka
3
2012
On regular temporal logics with past. Zbl 1214.68211
Dax, Christian; Klaedtke, Felix; Lange, Martin
3
2010
Model checking for hybrid logic. Zbl 1193.03053
Lange, Martin
3
2009
A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL. Zbl 1191.68412
Lange, Martin
3
2008
Local model checking games for fixed point logic with chop. Zbl 1012.68130
Lange, Martin
3
2002
Model-checking process equivalences. Zbl 1303.68085
Lange, Martin; Lozes, Etienne; Vargas Guzmán, Manuel
2
2014
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity. Zbl 1327.03016
Gutierrez, Julian; Klaedtke, Felix; Lange, Martin
2
2014
Revealing vs. concealing: more simulation games for Büchi inclusion. Zbl 1377.68113
Hutagalung, Milka; Lange, Martin; Lozes, Etienne
2
2013
The modal \(\mu \)-calculus caught off guard. Zbl 1333.03007
Friedmann, Oliver; Lange, Martin
2
2011
Automata theory and logic. Zbl 1257.68003
Hofmann, Martin; Lange, Martin
2
2011
Analyzing context-free grammars using an incremental SAT solver. Zbl 1155.68408
Axelsson, Roland; Heljanko, Keijo; Lange, Martin
2
2008
Model checking the first-order fragment of higher-order fixpoint logic. Zbl 1137.68429
Axelsson, Roland; Lange, Martin
2
2007
The complexity of model checking higher-order fixpoint logic. Zbl 1128.68051
Axelsson, Roland; Lange, Martin; Somla, Rafał
2
2007
Bounded model checking for all regular properties. Zbl 1272.68261
Jehle, Markus; Johannsen, Jan; Lange, Martin; Rachinsky, Nicolas
2
2006
Bounded model checking for weak alternating Büchi automata. Zbl 1188.68189
Heljanko, Keijo; Junttila, Tommi; Keinänen, Misa; Lange, Martin; Latvala, Timo
2
2006
A lower complexity bound for propositional dynamic logic with intersection. Zbl 1102.03035
Lange, Martin
2
2005
Weak automata for the linear time \(\mu\)-calculus. Zbl 1112.68093
Lange, Martin
2
2005
A quick axiomatisation of LTL with past. Zbl 1058.03023
Lange, Martin
2
2005
Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition. Zbl 1270.68147
Lange, Martin
2
2002
Model checking games for branching time logics. Zbl 1001.68077
Lange, Martin; Stirling, Colin
2
2002
Space-efficient fragments of higher-order fixpoint logic. Zbl 06820342
Bruse, Florian; Lange, Martin; Lozes, Etienne
1
2017
Residual bounds for some or all singular values. Zbl 1302.15022
Lange, M.
1
2015
Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic. Zbl 1417.68058
Lange, Martin; Lozes, Etienne
1
2014
Deciding the unguarded modal \(\mu\)-calculus. Zbl 1398.03092
Friedmann, Oliver; Lange, Martin
1
2013
Satisfiability games for branching-time logics. Zbl 1312.03023
Friedmann, Oliver; Lange, Martin; Latte, Markus
1
2013
Ramsey goes visibly pushdown. Zbl 1334.68118
Friedmann, Oliver; Klaedtke, Felix; Lange, Martin
1
2013
Two local strategy iteration schemes for parity game solving. Zbl 1246.91025
Friedmann, Oliver; Lange, Martin
1
2012
Ramsey-based analysis of parity automata. Zbl 1352.68129
Friedmann, Oliver; Lange, Martin
1
2012
P-hardness of the emptiness problem for visibly pushdown languages. Zbl 1260.68181
Lange, Martin
1
2011
Exact incremental analysis of timed automata with an SMT-solver. Zbl 1348.68118
Badban, Bahareh; Lange, Martin
1
2011
Extended computation tree logic. Zbl 1306.68098
Axelsson, Roland; Hague, Matthew; Kreutzer, Stephan; Lange, Martin; Latte, Markus
1
2010
A CTL-based logic for program abstractions. Zbl 1253.03060
Lange, Martin; Latte, Markus
1
2010
Three notes on the complexity of model checking fixpoint logic with Chop. Zbl 1133.68046
Lange, Martin
1
2007
Propositional dynamic logic of context-free programs and fixpoint logic with chop. Zbl 1185.68391
Lange, Martin; Somla, Rafał
1
2006
The complexity of model checking higher order fixpoint logic. Zbl 1156.68472
Lange, Martin; Somla, Rafał
1
2005
Satisfiability and completeness of converse-PDL replayed. Zbl 1274.03055
Lange, Martin
1
2003
Space-efficient fragments of higher-order fixpoint logic. Zbl 06820342
Bruse, Florian; Lange, Martin; Lozes, Etienne
1
2017
Temporal logics in computer science. Finite-state systems. Zbl 1380.68003
Demri, Stéphane; Goranko, Valentin; Lange, Martin
8
2016
On guarded transformation in the modal \(\mu\)-calculus. Zbl 1405.03048
Bruse, Florian; Friedmann, Oliver; Lange, Martin
3
2015
Residual bounds for some or all singular values. Zbl 1302.15022
Lange, M.
1
2015
Model-checking process equivalences. Zbl 1303.68085
Lange, Martin; Lozes, Etienne; Vargas Guzmán, Manuel
2
2014
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity. Zbl 1327.03016
Gutierrez, Julian; Klaedtke, Felix; Lange, Martin
2
2014
Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic. Zbl 1417.68058
Lange, Martin; Lozes, Etienne
1
2014
Revealing vs. concealing: more simulation games for Büchi inclusion. Zbl 1377.68113
Hutagalung, Milka; Lange, Martin; Lozes, Etienne
2
2013
Deciding the unguarded modal \(\mu\)-calculus. Zbl 1398.03092
Friedmann, Oliver; Lange, Martin
1
2013
Satisfiability games for branching-time logics. Zbl 1312.03023
Friedmann, Oliver; Lange, Martin; Latte, Markus
1
2013
Ramsey goes visibly pushdown. Zbl 1334.68118
Friedmann, Oliver; Klaedtke, Felix; Lange, Martin
1
2013
Solving parity games by a reduction to SAT. Zbl 1279.68211
Heljanko, Keijo; Keinänen, Misa; Lange, Martin; Niemelä, Ilkka
3
2012
Two local strategy iteration schemes for parity game solving. Zbl 1246.91025
Friedmann, Oliver; Lange, Martin
1
2012
Ramsey-based analysis of parity automata. Zbl 1352.68129
Friedmann, Oliver; Lange, Martin
1
2012
The modal \(\mu \)-calculus caught off guard. Zbl 1333.03007
Friedmann, Oliver; Lange, Martin
2
2011
Automata theory and logic. Zbl 1257.68003
Hofmann, Martin; Lange, Martin
2
2011
P-hardness of the emptiness problem for visibly pushdown languages. Zbl 1260.68181
Lange, Martin
1
2011
Exact incremental analysis of timed automata with an SMT-solver. Zbl 1348.68118
Badban, Bahareh; Lange, Martin
1
2011
A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata. Zbl 1257.03035
Friedmann, Oliver; Latte, Markus; Lange, Martin
10
2010
On regular temporal logics with past. Zbl 1214.68211
Dax, Christian; Klaedtke, Felix; Lange, Martin
3
2010
Extended computation tree logic. Zbl 1306.68098
Axelsson, Roland; Hague, Matthew; Kreutzer, Stephan; Lange, Martin; Latte, Markus
1
2010
A CTL-based logic for program abstractions. Zbl 1253.03060
Lange, Martin; Latte, Markus
1
2010
Solving parity games in practice. Zbl 1258.68077
Friedmann, Oliver; Lange, Martin
15
2009
On the hybrid extension of CTL and CTL\(^{ + }\). Zbl 1250.03029
Kara, Ahmet; Weber, Volker; Lange, Martin; Schwentick, Thomas
4
2009
Model checking for hybrid logic. Zbl 1193.03053
Lange, Martin
3
2009
Cut-free sequent systems for temporal logic. Zbl 1151.03009
Brünnler, Kai; Lange, Martin
10
2008
A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL. Zbl 1191.68412
Lange, Martin
3
2008
Analyzing context-free grammars using an incremental SAT solver. Zbl 1155.68408
Axelsson, Roland; Heljanko, Keijo; Lange, Martin
2
2008
When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus. Zbl 1306.68100
Grumberg, Orna; Lange, Martin; Leucker, Martin; Shoham, Sharon
7
2007
Linear time logics around PSL: Complexity, expressiveness, and a little bit of succinctness. Zbl 1151.68540
Lange, Martin
6
2007
Model checking the first-order fragment of higher-order fixpoint logic. Zbl 1137.68429
Axelsson, Roland; Lange, Martin
2
2007
The complexity of model checking higher-order fixpoint logic. Zbl 1128.68051
Axelsson, Roland; Lange, Martin; Somla, Rafał
2
2007
Three notes on the complexity of model checking fixpoint logic with Chop. Zbl 1133.68046
Lange, Martin
1
2007
Model checking propositional dynamic logic with all extras. Zbl 1095.68053
Lange, Martin
14
2006
A proof system for the linear time \(\mu \)-calculus. Zbl 1163.03308
Dax, Christian; Hofmann, Martin; Lange, Martin
10
2006
Bounded model checking for all regular properties. Zbl 1272.68261
Jehle, Markus; Johannsen, Jan; Lange, Martin; Rachinsky, Nicolas
2
2006
Bounded model checking for weak alternating Büchi automata. Zbl 1188.68189
Heljanko, Keijo; Junttila, Tommi; Keinänen, Misa; Lange, Martin; Latvala, Timo
2
2006
Propositional dynamic logic of context-free programs and fixpoint logic with chop. Zbl 1185.68391
Lange, Martin; Somla, Rafał
1
2006
Don’t know in the \(\mu\)-calculus. Zbl 1112.68090
Grumberg, Orna; Lange, Martin; Leucker, Martin; Shoham, Sharon
9
2005
2-ExpTime lower bounds for propositional dynamic logics with intersection. Zbl 1100.03017
Lange, Martin; Lutz, Carsten
6
2005
A lower complexity bound for propositional dynamic logic with intersection. Zbl 1102.03035
Lange, Martin
2
2005
Weak automata for the linear time \(\mu\)-calculus. Zbl 1112.68093
Lange, Martin
2
2005
A quick axiomatisation of LTL with past. Zbl 1058.03023
Lange, Martin
2
2005
The complexity of model checking higher order fixpoint logic. Zbl 1156.68472
Lange, Martin; Somla, Rafał
1
2005
CTL\(^{+}\) is complete for double exponential time. Zbl 1039.68073
Johannsen, Jan; Lange, Martin
6
2003
Satisfiability and completeness of converse-PDL replayed. Zbl 1274.03055
Lange, Martin
1
2003
Model checking fixed point logic with chop. Zbl 1077.68690
Lange, Martin; Stirling, Colin
4
2002
Local model checking games for fixed point logic with chop. Zbl 1012.68130
Lange, Martin
3
2002
Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition. Zbl 1270.68147
Lange, Martin
2
2002
Model checking games for branching time logics. Zbl 1001.68077
Lange, Martin; Stirling, Colin
2
2002
all top 5

Cited by 222 Authors

23 Lange, Martin
7 Reynolds, Mark Alexander
6 McCabe-Dansted, John Christopher
5 Grumberg, Orna
4 Friedmann, Oliver
4 Gutierrez, Julian
4 Perelli, Giuseppe
4 Shoham, Sharon
3 Alechina, Natasha
3 Benerecetti, Massimo
3 Bollig, Benedikt
3 Dell’Erba, Daniele
3 Gastin, Paul
3 Klaedtke, Felix
3 Leucker, Martin
3 Lozes, Etienne
3 Mogavero, Fabio
3 Murano, Aniello
3 Smolka, Gert
3 Studer, Thomas
3 Willemse, Tim A. C.
3 Wooldridge, Michael J.
2 Ågotnes, Thomas
2 Boudou, Joseph
2 Demri, Stéphane P.
2 Doczkal, Christian
2 Eisner, Cindy
2 Fisman, Dana
2 French, Tim
2 Goranko, Valentin F.
2 Haeusler, Edward Hermann
2 Harrenstein, Paul
2 Hermo, Montserrat
2 Honsell, Furio
2 Hutagalung, Milka
2 Kernberger, Daniel
2 Křetínský, Jan
2 Kupferman, Orna
2 Legay, Axel
2 Lenisa, Marina
2 Lopes, Bruno Domeniciano
2 Lucio, Paqui
2 Meggendorfer, Tobias
2 Montanari, Angelo
2 Rybakov, Vladimir Vladimirovich
2 Weber, Volker
1 Aiswarya, Cyriac
1 Alonderis, Romas
1 Aminof, Benjamin
1 Avni, Guy
1 Balbiani, Philippe
1 Barbosa, Luís Soares
1 Basin, David A.
1 Basten, H. J. S.
1 Benevides, Mario R. F.
1 Bersani, Marcello Maria
1 Bhatt, Bhargav Nagaraja
1 Biere, Armin
1 Bogaerts, Bart
1 Bolotov, Alexander
1 Bozzelli, Laura
1 Bradfield, Julian Charles
1 Bresolin, Davide
1 Brünnler, Kai
1 Bruse, Florian
1 Bucheli, Samuel
1 Bulling, Nils
1 Cerrito, Serenella
1 Chebotarev, Anatoli N.
1 Cini, Clare
1 Cranen, Sjoerd
1 Cui, Bin
1 Cyriac, Aiswarya
1 D’Agostino, Giovanna
1 Dams, Dennis René
1 Das, Anupam
1 David, Amélie
1 Dax, Christian
1 Deters, Morgan
1 Di Stasio, Antonio
1 Dimovski, Aleksandar S.
1 Dittmann, Christoph
1 Dixon, Clare
1 Dong, Wei
1 Dowek, Gilles
1 Duan, Zhenhua
1 Dyckhoff, Roy
1 Fahrenberg, Uli
1 Faria, José M.
1 Fecher, Harald
1 Fontaine, Gaëlle
1 Fortin, Marie-Josée
1 Francalanza, Adrian
1 Furber, Robert W. J.
1 Gaintzarain, Jose
1 Gange, Graeme
1 Gate, James
1 Gazda, Maciej W.
1 Geatti, Luca
1 Genevès, Pierre
...and 122 more Authors

Citations by Year