Talk Author Index

TALK AUTHOR INDEX

Shortcuts: B D F G H J K L M S T W Y

B
Blanqui, Frédéric	Termination of Lambda-Pi modulo rewriting using the size-change principle
D
David, Cristina	Procedure-Modular Termination Analysis
Dershowitz, Nachum	GPO: A Path Ordering for Graphs
Divasón, Jose	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving
Doménech, Jesús	Control-Flow Refinement via Partial Evaluation
F
Frohn, Florian	Complexity Analysis for Bitvector Programs
Fuhs, Carsten	Improving Static Dependency Pairs for Higher-Order Rewriting
G
Gallagher, John P.	Control-Flow Refinement via Partial Evaluation
Genaim, Samir	Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations Control-Flow Refinement via Partial Evaluation
Genestier, Guillaume	Termination of Lambda-Pi modulo rewriting using the size-change principle
Geser, Alfons	Comparing on Strings: Semantic Kachinuki Order
Giesl, Jürgen	Complexity Analysis for Bitvector Programs
Gupta, Piyush	Verification of Rewriting-based Query Optimizers
H
Hehner, Eric	Objective and Subjective Specifications
Hensel, Jera	Complexity Analysis for Bitvector Programs
Hofbauer, Dieter	Comparing on Strings: Semantic Kachinuki Order Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions
J
Joosten, Sebastiaan	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving
Jouannaud, Jean-Pierre	GPO: A Path Ordering for Graphs
K
Kop, Cynthia	Improving Static Dependency Pairs for Higher-Order Rewriting
Krishnamurthy, Balaji	Verification of Rewriting-based Query Optimizers
Kroening, Daniel	Procedure-Modular Termination Analysis
L
Lucas, Salvador	Well-founded models in proofs of termination
M
Merayo, Alicia	Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations
S
Schrammel, Peter	Procedure-Modular Termination Analysis
Schöpf, Jonas	TTT2 with Termination Templates for Teaching
Sternagel, Christian	TTT2 with Termination Templates for Teaching
T
Thakkar, Aalok	Verification of Rewriting-based Query Optimizers
Thiemann, René	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving
W
Waldmann, Johannes	Comparing on Strings: Semantic Kachinuki Order
Worrell, James	Termination Checking and Invariant Synthesis for Affine Programs
Y
Yamada, Akihisa	Towards a Unified Method for Termination A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving