Travelled to:1 × Austria
1 × Estonia
1 × Greece
1 × Hungary
1 × Iceland
1 × Latvia
1 × Spain
1 × The Netherlands
2 × France
2 × United Kingdom
3 × USA
Collaborated with:O.Friedmann ∅ C.Stirling M.Latte M.Hutagalung É.Lozes F.Klaedtke K.Heljanko R.Ehlers J.Johannsen C.Dax R.Axelsson O.Grumberg M.Leucker S.Shoham T.A.Junttila M.Keinänen T.Latvala
Talks about:automata (5) logic (4) time (4) tempor (3) model (3) check (3) büchi (3) game (3) increment (2) calculus (2)
Person: Martin Lange
DBLP: Lange:Martin
Contributed to:
2014
2014
2013
20132012
2012201020092008
2006
200520042003
2002
2001Wrote 16 papers:
- AFL-2014-HutagalungLL #automaton #game studies #simulation
- Buffered Simulation Games for Büchi Automata (MH, ML, ÉL), pp. 286–300.
- IJCAR-2014-EhlersL #approximate #finite #incremental #logic #satisfiability
- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
- ICALP-v2-2013-FriedmannKL #automaton
- Ramsey Goes Visibly Pushdown (OF, FK, ML), pp. 224–237.
- LATA-2013-HutagalungLL #automaton #game studies #simulation
- Revealing vs. Concealing: More Simulation Games for Büchi Inclusion (MH, ML, ÉL), pp. 347–358.
- IJCAR-2012-LatteL #branch #exclamation
- Branching Time? Pruning Time! (ML, ML), pp. 393–407.
- TACAS-2012-FriedmannL #analysis #automaton
- Ramsey-Based Analysis of Parity Automata (OF, ML), pp. 64–78.
- IJCAR-2010-FriedmannLL #automaton
- A Decision Procedure for CTL* Based on Tableaux and Automata (OF, ML, ML), pp. 331–345.
- ICALP-v2-2009-DaxKL #logic #on the
- On Regular Temporal Logics with Past, (CD, FK, ML), pp. 175–187.
- ICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.
- CAV-2006-HeljankoJKLL #automaton #bound #model checking
- Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.
- VMCAI-2005-GrumbergLLS #calculus
- Don’t Know in the µ-Calculus (OG, ML, ML, SS), pp. 233–249.
- VMCAI-2005-Lange #automaton #calculus #linear
- Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.
- CAV-2004-Lange #model checking
- Symbolic Model Checking of Non-regular Properties (ML), pp. 83–95.
- ICALP-2003-JohannsenL #exponential
- CTL+ Is Complete for Double Exponential Time (JJ, ML), pp. 767–775.
- FoSSaCS-2002-LangeS #fixpoint #logic #model checking
- Model Checking Fixed Point Logic with Chop (ML, CS), pp. 250–263.
- LICS-2001-LangeS #game studies #logic #satisfiability
- Focus Games for Satisfiability and Completeness of Temporal Logic (ML, CS), pp. 357–365.