World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
4010
World Ranking
13683
National Ranking
119

Best Publications

  • Completeness results for basic narrowing

    Aart Middeldorp;Erik Hamoen

  • SAT solving for termination analysis with polynomial interpretations

    Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp

  • Tyrolean termination tool : Techniques and features

    Nao Hirokawa;Aart Middeldorp

  • Tyrolean termination tool: Techniques and features

    Nao Hirokawa;Aart Middeldorp

  • Tyrolean Termination Tool 2

    Martin Korp;Christian Sternagel;Harald Zankl;Aart Middeldorp

  • Automating the dependency pair method

    Nao Hirokawa;Aart Middeldorp

  • Sequentiality in orthogonal term rewriting systems

    Jan Willem Klop;Aart Middeldorp

  • Completeness of combinations of constructor systems

    Aart Middeldorp;Yoshihito Toyama

  • Dependency Pairs Revisited

    Nao Hirokawa;Aart Middeldorp

  • Call by need computations to root-stable form

    Aart Middeldorp

  • Lazy narrowing: strong completeness and eager variable elimination

    Aart Middeldorp;Satoshi Okui;Tetsuo Ida

  • A sufficient condition for the termination of the direct sum of term rewriting systems

    A. Middeldorp

  • Transformation techniques for context-sensitive rewrite systems

    Jürgen Giesl;Aart Middeldorp

  • Completeness of combinations of constructor systems

    Aart Middeldorp;Yoshihito Toyama

  • Satisfiability of non-linear (Ir)rational arithmetic

    Harald Zankl;Aart Middeldorp

  • Decidable call-by-need computations in term rewriting

    Irène Durand;Aart Middeldorp

  • Simple termination of rewrite systems

    Aart Middeldorp;Hans Zantema

  • Tyrolean Termination Tool 2

    Unknown

  • Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides

    Taro Suzuki;Aart Middeldorp;Tetsuo Ida

  • Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms

    Aart Middeldorp

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: