Jürgen Giesl
18 publications
3 venues
H Index 10
Affiliation
RWTH Aachen University, GermanyLinks
| Name | Venue | Year | citations |
|---|---|---|---|
Proving Termination of C Programs with Lists.
|
CADE | 2023 | 0 |
| Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).
|
CADE | 2023 | 0 |
| Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.
|
CADE | 2023 | 0 |
| Polynomial Loops: Beyond Termination.
|
LPAR | 2020 | 7 |
| Computing Expected Runtimes for Constant Probability Programs.
|
CADE | 2019 | 8 |
| Analyzing Runtime Complexity via Innermost Runtime Complexity.
|
LPAR | 2017 | 16 |
| Termination Competition (termCOMP 2015).
|
CADE | 2015 | 17 |
| A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.
|
CADE | 2011 | 35 |
| Termination Analysis by Dependency Pairs and Inductive Theorem Proving.
|
CADE | 2009 | 5 |
| Improving Context-Sensitive Dependency Pairs.
|
LPAR | 2008 | 37 |
| SAT Solving for Termination Analysis with Polynomial Interpretations.
|
SAT | 2007 | 169 |
| Proving Termination by Bounded Increase.
|
CADE | 2007 | 29 |
| SAT Solving for Argument Filterings.
|
LPAR | 2006 | 27 |
| The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.
|
LPAR | 2004 | 0 |
| Deciding Inductive Validity of Equations.
|
CADE | 2003 | 39 |
| Improving Dependency Pairs.
|
LPAR | 2003 | 50 |
| Eliminating Dummy Elimination.
|
CADE | 2000 | 7 |
| Termination Analysis by Inductive Evaluation.
|
CADE | 1998 | 17 |