The following pages link to Jürgen Giesl (Q199242):
Displayed 31 items.
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- (Q4412115) (← links)
- (Q4447238) (← links)
- (Q4447242) (← links)
- (Q4539635) (← links)
- Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution (Q4571133) (← links)
- Proving innermost normalisation automatically (Q4594225) (← links)
- Analyzing Runtime Complexity via Innermost Runtime Complexity (Q4645739) (← links)
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (Q4909327) (← links)
- Lazy Abstraction for Size-Change Termination (Q4933307) (← links)
- Termination analysis for partial functions (Q5030190) (← links)
- Complexity Analysis for Java with AProVE (Q5045475) (← links)
- Generating polynomial orderings for termination proofs (Q5055845) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- Inferring Lower Bounds for Runtime Complexity (Q5277889) (← links)
- Automated Reasoning (Q5307050) (← links)
- SAT Solving for Argument Filterings (Q5387882) (← links)
- Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (Q5389079) (← links)
- Automated Termination Analysis of Java Bytecode by Term Rewriting (Q5389149) (← links)
- Frontiers of Combining Systems (Q5491901) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Improving Context-Sensitive Dependency Pairs (Q5505586) (← links)
- Transformation techniques for context-sensitive rewrite systems (Q5692154) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705932) (← links)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation (Q5896945) (← links)
- Automated Deduction – CADE-19 (Q5900707) (← links)
- Verification of Erlang processes by dependency pairs (Q5941753) (← links)
- Termination of triangular Integer loops is decidable (Q6194959) (← links)