LuFG Informatik 2 ▲ Sign in to save

• ▲ Jürgen Giesl

  RWTH Aachen University Computer Science
  4.35k

  citations

  36

  h-index

  74

  Aachen papers
• ▲ Florian Frohn

  RWTH Aachen University Computer Science
  567

  citations

  13

  h-index

  30

  Aachen papers
• ▲ Jera Hensel

  RWTH Aachen University Computer Science
  279

  citations

  9

  h-index

  5

  Aachen papers
• ▲ Marcel Hark

  RWTH Aachen University Computer Science
  140

  citations

  7

  h-index

  10

  Aachen papers
• ▲ Nils Lommen

  RWTH Aachen University Computer Science
  45

  citations

  5

  h-index

  31

  Aachen papers
• ▲ Jan-Christoph Kassing

  RWTH Aachen University Computer Science
  28

  citations

  3

  h-index

  19

  Aachen papers
• ▲ Éléanore Meyer

  RWTH Aachen University Computer Science
  12

  citations

  2

  h-index

  12

  Aachen papers
• ▲ Constantin Mensendiek

  RWTH Aachen University Computer Science
  10

  citations

  1

  h-index

  2

  Aachen papers
• ▲ Stefan Dollase

  RWTH Aachen University Computer Science
  2

  citations

  1

  h-index

  1

  Aachen papers

9 results

• Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

  2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  20

  citations
• Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)

  2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  16

  citations
• Polynomial Loops: Beyond Termination

  2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

  13

  citations
• Inferring Lower Runtime Bounds for Integer Programs

  2020 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

  12

  citations
• Termination of Polynomial Loops

  2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

  12

  citations
• AProVE: Non-Termination Witnesses for C Programs

  2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  10

  citations
• Improving Automatic Complexity Analysis of Integer Programs

  2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

  10

  citations
• Termination of triangular polynomial loops

  2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access

  8

  citations
• A calculus for modular loop acceleration and non-termination proofs

  2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems Open access

  8

  citations
• Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops

  2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  7

  citations
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs

  2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  7

  citations
• Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

  2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  7

  citations
• Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)

  2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

  6

  citations
• ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses

  2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

  5

  citations
• A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting

  2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

  3

  citations
• Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

  2021 other Computer Science Logic, programming, and type systems

  2

  citations
• Proving Termination of C Programs with Lists

  2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  2

  citations
• Proving Non-Termination by Acceleration Driven Clause Learning

  2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

  2

  citations
• From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting

  2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

  2

  citations
• A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting

  2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

  2

  citations