Jürgen Giesl
19 publications
3 venues
H Index 12
Affiliation
RWTH Aachen University, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
Infinite State Model Checking by Learning Transitive Relations.
|
CADE | 2025 | 0 |
| Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.
|
CADE | 2023 | 9 |
| Proving Termination of C Programs with Lists.
|
CADE | 2023 | 4 |
| Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).
|
CADE | 2023 | 0 |
| Polynomial Loops: Beyond Termination.
|
LPAR | 2020 | 12 |
| Computing Expected Runtimes for Constant Probability Programs.
|
CADE | 2019 | 20 |
| Analyzing Runtime Complexity via Innermost Runtime Complexity.
|
LPAR | 2017 | 21 |
| Termination Competition (termCOMP 2015).
|
CADE | 2015 | 24 |
| A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.
|
CADE | 2011 | 41 |
| Termination Analysis by Dependency Pairs and Inductive Theorem Proving.
|
CADE | 2009 | 5 |
| Improving Context-Sensitive Dependency Pairs.
|
LPAR | 2008 | 34 |
| SAT Solving for Termination Analysis with Polynomial Interpretations.
|
SAT | 2007 | 175 |
| Proving Termination by Bounded Increase.
|
CADE | 2007 | 30 |
| SAT Solving for Argument Filterings.
|
LPAR | 2006 | 28 |
| The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.
|
LPAR | 2004 | 0 |
| Deciding Inductive Validity of Equations.
|
CADE | 2003 | 40 |
| Improving Dependency Pairs.
|
LPAR | 2003 | 51 |
| Eliminating Dummy Elimination.
|
CADE | 2000 | 5 |
| Termination Analysis by Inductive Evaluation.
|
CADE | 1998 | 16 |