The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Lange: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Lange
    A Lower Complexity Bound for Propositional Dynamic Logic with Intersection. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2004, pp:133-147 [Conf]
  2. Keijo Heljanko, Tommi A. Junttila, Misa Keinänen, Martin Lange, Timo Latvala
    Bounded Model Checking for Weak Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:95-108 [Conf]
  3. Martin Lange
    Symbolic Model Checking of Non-regular Properties. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:83-95 [Conf]
  4. Martin Lange
    Local Model Checking Games for Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:240-254 [Conf]
  5. Martin Lange, Colin Stirling
    Model Checking Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:250-263 [Conf]
  6. Christian Dax, Martin Hofmann, Martin Lange
    A Proof System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:273-284 [Conf]
  7. Jan Johannsen, Martin Lange
    CTL+ Is Complete for Double Exponential Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:767-775 [Conf]
  8. Martin Lange, Colin Stirling
    Focus Games for Satisfiability and Completeness of Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:357-365 [Conf]
  9. Martin Lange, Rafal Somla
    The Complexity of Model Checking Higher Order Fixpoint Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:640-651 [Conf]
  10. Martin Lange
    Weak Automata for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:267-281 [Conf]
  11. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
    Don't Know in the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:233-249 [Conf]
  12. Christian Dax, Martin Lange
    Game Over: The Foci Approach to LTL Satisfiability and Model Checking. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:1, pp:33-49 [Journal]
  13. Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky
    Bounded Model Checking for All Regular Properties. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:1, pp:3-18 [Journal]
  14. Martin Lange
    Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  15. Martin Lange, Hans-Wolfgang Loidl
    Parallel and Symbolic Model Checking for Fixpoint Logic with Chop. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:3, pp:125-138 [Journal]
  16. Martin Lange
    The alternation hierarchy in fixpoint logic with chop is strict too. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:9, pp:1346-1367 [Journal]
  17. Martin Lange, Rafal Somla
    Propositional dynamic logic of context-free programs and fixpoint logic with chop. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:2, pp:72-75 [Journal]
  18. Martin Lange
    Model checking propositional dynamic logic with all extras. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2006, v:4, n:1, pp:39-49 [Journal]
  19. Martin Lange, Colin Stirling
    Model Checking Games for Branching Time Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:4, pp:623-639 [Journal]
  20. Martin Lange
    A quick axiomatisation of LTL with past. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:1, pp:83-88 [Journal]
  21. Martin Lange
    Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:90-104 [Conf]
  22. Roland Axelsson, Martin Lange
    Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:62-76 [Conf]
  23. Roland Axelsson, Martin Lange, Rafal Somla
    The Complexity of Model Checking Higher-Order Fixpoint Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  24. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
    When not losing is better than winning: Abstraction and refinement for the full mu-calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1130-1148 [Journal]

  25. Solving Parity Games in Practice. [Citation Graph (, )][DBLP]


  26. A Decision Procedure for CTL* Based on Tableaux and Automata. [Citation Graph (, )][DBLP]


  27. Analyzing Context-Free Grammars Using an Incremental SAT Solver. [Citation Graph (, )][DBLP]


  28. On Regular Temporal Logics with Past, . [Citation Graph (, )][DBLP]


  29. On the Hybrid Extension of CTL and CTL+. [Citation Graph (, )][DBLP]


  30. A CTL-Based Logic for Program Abstractions. [Citation Graph (, )][DBLP]


  31. On the Hybrid Extension of CTL and CTL+ [Citation Graph (, )][DBLP]


  32. Local Strategy Improvement for Parity Game Solving [Citation Graph (, )][DBLP]


  33. Extended Computation Tree Logic [Citation Graph (, )][DBLP]


  34. A Solver for Modal Fixpoint Logics. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002