H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 33 Citations 4,883 100 World Ranking 6704 National Ranking 328

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Algebra

Mathematical proof, Termination analysis, Programming language, Dependency and Algorithm are his primary areas of study. His research brings together the fields of Theoretical computer science and Mathematical proof. Jürgen Giesl combines subjects such as Sat problem, Rewriting and Encoding with his study of Termination analysis.

Jürgen Giesl interconnects Term and Confluence in the investigation of issues within Rewriting. His Dependency research integrates issues from Gas meter prover, Modularity, Proof theory and Dependency graph. His Algorithm study incorporates themes from Polynomial, Arithmetic and Modular design.

His most cited work include:

  • Termination of term rewriting using dependency pairs (487 citations)
  • AProVE 1.2: automatic termination proofs in the dependency pair framework (237 citations)
  • Mechanizing and Improving Dependency Pairs (182 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Termination analysis, Theoretical computer science, Programming language, Rewriting and Algorithm. He has researched Termination analysis in several fields, including Logic programming, Dependency, Path, Arithmetic and Extension. His biological study spans a wide range of topics, including Mathematical proof, Dependency graph and Logical programming.

In his research on the topic of Programming language, Modularity is strongly related with Gas meter prover. His study in Rewriting is interdisciplinary in nature, drawing from both Liveness, Term, Java bytecode and Confluence. His Algorithm research includes elements of Simple, Dependency pairs, Proof theory and Modular design.

He most often published in these fields:

  • Termination analysis (36.09%)
  • Theoretical computer science (35.50%)
  • Programming language (31.36%)

What were the highlights of his more recent work (between 2014-2021)?

  • Programming language (31.36%)
  • Integer (5.33%)
  • Algorithm (26.04%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Programming language, Integer, Algorithm, Theoretical computer science and Symbolic execution. Programming language connects with themes related to Mathematical proof in his study. Jürgen Giesl has included themes like Simple and Semantics in his Algorithm study.

Theoretical computer science is frequently linked to Complement in his study. In his study, which falls under the umbrella issue of Symbolic execution, Graph, Transition system and Open problem is strongly linked to Gas meter prover. His Termination analysis study deals with Range intersecting with Mathematical reasoning, Pointer and Separation logic.

Between 2014 and 2021, his most popular works were:

  • Analyzing Program Termination and Complexity Automatically with AProVE (78 citations)
  • Analyzing Runtime and Size Complexity of Integer Programs (43 citations)
  • Lower Runtime Bounds for Integer Programs (30 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Algebra

Jürgen Giesl mainly investigates Programming language, Algorithm, Term, Mathematical proof and Simple. His research integrates issues of restrict, Modular design, Exponential function and Alternation in his study of Algorithm. His Term research incorporates themes from Java, Haskell and Prolog.

His work in Mathematical proof is not limited to one particular discipline; it also encompasses Termination analysis. His study looks at the relationship between Memory safety and topics such as Graph, which overlap with Theoretical computer science. In his work, Rewriting is strongly intertwined with Integer, which is a subfield of Programming paradigm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Termination of term rewriting using dependency pairs

Thomas Arts;Jürgen Giesl.
Theoretical Computer Science (2000)

727 Citations

AProVE 1.2: automatic termination proofs in the dependency pair framework

Jürgen Giesl;Peter Schneider-Kamp;René Thiemann.
international joint conference on automated reasoning (2006)

332 Citations

Mechanizing and Improving Dependency Pairs

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke.
Journal of Automated Reasoning (2006)

247 Citations

Automated Termination Proofs with AProVE

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke.
rewriting techniques and applications (2004)

206 Citations

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp.
international conference on logic programming (2005)

191 Citations

SAT solving for termination analysis with polynomial interpretations

Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp.
theory and applications of satisfiability testing (2007)

170 Citations

Proving and disproving termination of higher-order functions

Jürgen Giesl;René Thiemann;Peter Schneider-Kamp.
frontiers of combining systems (2005)

153 Citations

Automated termination analysis for Haskell: from term rewriting to programming languages

Jürgen Giesl;Stephan Swiderski;Peter Schneider-Kamp;René Thiemann.
rewriting techniques and applications (2006)

105 Citations

Modular Termination Proofs for Rewriting Using Dependency Pairs

Jürgen Giesl;Thomas Arts;Enno Ohlebusch.
Journal of Symbolic Computation (2002)

101 Citations

Proving Termination of Programs Automatically with AProVE

Jürgen Giesl;Marc Brockschmidt;Fabian Emmes;Florian Frohn.
international joint conference on automated reasoning (2014)

100 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Jürgen Giesl

Aart Middeldorp

Aart Middeldorp

University of Innsbruck

Publications: 54

José Meseguer

José Meseguer

University of Illinois at Urbana-Champaign

Publications: 40

Deepak Kapur

Deepak Kapur

University of New Mexico

Publications: 14

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 14

Byron Cook

Byron Cook

Amazon (United States)

Publications: 14

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 11

Nachum Dershowitz

Nachum Dershowitz

Tel Aviv University

Publications: 10

Andrey Rybalchenko

Andrey Rybalchenko

Microsoft (United States)

Publications: 10

Neil D. Jones

Neil D. Jones

University of Copenhagen

Publications: 10

Dirk Beyer

Dirk Beyer

Ludwig-Maximilians-Universität München

Publications: 9

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 9

Manuel V. Hermenegildo

Manuel V. Hermenegildo

Madrid Institute for Advanced Studies

Publications: 9

Alexander Serebrenik

Alexander Serebrenik

Eindhoven University of Technology

Publications: 8

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 7

Gilles Barthe

Gilles Barthe

Max Planck Institute for Security and Privacy

Publications: 6

Something went wrong. Please try again later.