WST 2014 INFORMAL PROCEEDINGS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A B C D E F G H K L M N O P R S T U W Z

A
Alves, Péricles	Real-world loops are easy to predict : a case study (PDF, talk)
Avanzini, Martin	Type Introduction for Runtime Complexity Analysis (PDF, talk)
B
Bau, Alexander	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk)
C
Cook, Byron	Abstract: Fairness for Infinite-State Systems (PDF, talk) Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
D
Dershowitz, Nachum	Another Proof for the Recursive Path Ordering (PDF, talk)
Donaldson, Alastair	Automatic Termination Analysis for GPU Kernels (PDF, talk)
E
Endrullis, Joerg	Non-termination using Regular Languages (PDF, talk)
F
Felgenhauer, Bertram	Type Introduction for Runtime Complexity Analysis (PDF, talk)
Futatsugi, Kokichi	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
G
Geser, Alfons	A Solution to Endrullis-08 and Similar Problems (PDF, talk) Kurth's Criterion H Revisited (PDF, talk)
Gonnord, Laure	Real-world loops are easy to predict : a case study (PDF, talk)
H
Heizmann, Matthias	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
Hellström, Lars	Ordering Networks (PDF, talk)
Hofbauer, Dieter	On the derivational complexity of Kachinuki orderings (PDF, talk)
K
Kataoka, Takumi	On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk)
Ketema, Jeroen	Automatic Termination Analysis for GPU Kernels (PDF, talk)
Khlaaf, Heidy	Abstract: Fairness for Infinite-State Systems (PDF, talk)
L
Leike, Jan	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
M
Magill, Stephen	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
Mesnard, Fred	Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
Middeldorp, Aart	Automating Elementary Interpretations (PDF, talk)
Miné, Antoine	To Infinity... and Beyond! (PDF, talk)
N
Nishida, Naoki	On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk)
O
Ogata, Kazuhiro	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
P
Parkinson, Matthew	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
Payet, Étienne	Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
Pereira, Fernando	Real-world loops are easy to predict : a case study (PDF, talk)
Piterman, Nir	Abstract: Fairness for Infinite-State Systems (PDF, talk)
Preining, Norbert	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
R
Rodrigues, Raphael	Real-world loops are easy to predict : a case study (PDF, talk)
S
Sato, Haruhiko	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk)
Stroeder, Thomas	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
T
Thiemann, Rene	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk)
U
Urban, Caterina	To Infinity... and Beyond! (PDF, talk)
W
Waldmann, Johannes	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk)
Winkler, Sarah	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk) Automating Elementary Interpretations (PDF, talk)
Z
Zankl, Harald	Automating Elementary Interpretations (PDF, talk)
Zantema, Hans	Non-termination using Regular Languages (PDF, talk)