MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Martin Lange – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

42 documents found, showing 1 through 10. Next 10 →

ATOM

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
by Martin Lange
… and Martin Lange 2 1 Institut für Informatik, Ludwig-Maximilians-Universität München, Germany 2 Department…
Add To MetaCart

Symbolic Model Checking of Non-Regular Properties
by Martin Lange — 2004 — Proc. 16th Conf. on Computer Aided Verification, CAV’04, volume 3114 of LNCS
…Symbolic Model Checking of Non-Regular Properties Martin Lange Institut fur Informatik Ludwig…
Cited by 1 (1 self) – Add To MetaCart

Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition
by Martin Lange — 2002 — Proc. 9th Workshop on Expressiveness in Concurrency, EXPRESS'02, volume 68.2 of ENTCS
…-Calculus with Sequential Composition Martin Lange 1 Institut für Informatik Ludwig-Maximilians-Universität München…
Cited by 3 (2 self) – Add To MetaCart

Satisfiability and Completeness of Converse-PDL Replayed
by Martin Lange — 2003 — In Proc. 26th German Conf. on Artificial Intelligence, KI’03, volume ?? of LNAI
…Satisfiability and Completeness of Converse-PDL Replayed Martin Lange Institut fur Informatik…
Cited by 1 (0 self) – Add To MetaCart

Solving parity games by a reduction to SAT
by Martin Lange — 2005 — In Proc. of the Workshop on Games in Design and Verification, GDV’05
…Solving Parity Games by a Reduction to SAT Martin Lange Institut für Informatik, University…
Cited by 4 (0 self) – Add To MetaCart

Games for Modal and Temporal Logics
by Martin Lange — 2002
…Games for Modal and Temporal Logics Martin Lange T H E U N I V E R S I T Y O F E D I N…
Cited by 1 (0 self) – Add To MetaCart

A lower complexity bound for propositional dynamic logic with intersection
by Martin Lange — 1982 — Automata, Languages and Programming, 9th Colloquium
…A Lower Complexity Bound for Propositional Dynamic Logic with Intersection Martin Lange Institut…
Cited by 1 (0 self) – Add To MetaCart

The complexity of model checking higher order fixpoint logic
by Martin Lange — 2005 — In Proc. 30th Int. Symp. on Math. Foundations of Computer Science, MFCS’05, volume 3618 of LNCS
…The Complexity of Model Checking Higher Order Fixpoint Logic Martin Lange 1 and Rafa̷l Somla 2 1…
Cited by 3 (2 self) – Add To MetaCart

Weak automata for the linear time µ-calculus
by Martin Lange — 2005 — Proc. 6th Int. Conf. on Verification, Model Checking and Abstract Interpretation, VMCAI’05, volume 3385 of LNCS
…Weak Automata for the Linear Time µ-Calculus Martin Lange Institut für Informatik, University…
Cited by 5 (1 self) – Add To MetaCart

Game Over: The Foci Approach to LTL Satisfiability and Model Checking
by Christian Dax, Martin Lange — 2004
… Christian Dax Martin Lange Institut fur Informatik, University of Munich Abstract Focus games have been…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB