The following pages link to Jürgen Giesl (Q199242):
Displaying 50 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Termination of nested and mutually recursive algorithms (Q1367078) (← links)
- Induction proofs with partial functions (Q1595923) (← links)
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← links)
- Complexity analysis for term rewriting by integer transition systems (Q1687548) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Approximating the domains of functional and imperative programs (Q1818071) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- (Q2702599) (← links)
- (Q2723429) (← links)
- (Q2723934) (← links)
- (Q2753692) (← links)
- (Q2778873) (← links)
- (Q2782485) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- (Q2844067) (← links)
- Proving Non-looping Non-termination Automatically (Q2908495) (← links)
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- (Q3021913) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- SAT-based termination analysis using monotonicity constraints over the integers (Q3087439) (← links)
- <tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs (Q3087808) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Proving Termination of Programs Automatically with AProVE (Q3192189) (← links)
- Proving Termination and Memory Safety for Programs with Pointer Arithmetic (Q3192191) (← links)
- (Q3408137) (← links)
- Termination Competition (termCOMP 2015) (Q3454084) (← links)
- Maximal Termination (Q3522012) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016) (← links)
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (Q3527303) (← links)
- The Dependency Triple Framework for Termination of Logic Programs (Q3558284) (← links)
- Automated termination analysis for logic programs with cut (Q3585154) (← links)
- Automated Termination Analysis for Logic Programs by Term Rewriting (Q3591084) (← links)
- Proving Termination by Bounded Increase (Q3608788) (← links)
- SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476) (← links)
