WST 2014 INFORMAL PROCEEDINGS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: A B C D E F G I J K L M N O P R S T U V

A
abstract interpretation	To Infinity... and Beyond! (PDF, talk)
Algebraic specification	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
Android	Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
automation	Automating Elementary Interpretations (PDF, talk)
B
biaffine PROP	Ordering Networks (PDF, talk)
C
CafeOBJ	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
concurrency	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk) Automatic Termination Analysis for GPU Kernels (PDF, talk)
Constraint Logic Programming	Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
Constraint-based synthesis	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
Constraints	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk)
Criterion~H	Kurth's Criterion H Revisited (PDF, talk)
D
Dalvik	Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
deadlock	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
dependency pair framework	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk)
Derivational complexity	On the derivational complexity of Kachinuki orderings (PDF, talk)
E
elementary interpretations	Automating Elementary Interpretations (PDF, talk)
F
Fair CTL	Abstract: Fairness for Infinite-State Systems (PDF, talk)
Fair Termination	Abstract: Fairness for Infinite-State Systems (PDF, talk)
fairness	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
G
GPUs	Automatic Termination Analysis for GPU Kernels (PDF, talk)
I
Infinite execution	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
J
Just-in-time Compilation	Real-world loops are easy to predict : a case study (PDF, talk)
K
Kachinuki ordering	On the derivational complexity of Kachinuki orderings (PDF, talk)
Knuth-Bendix completion	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk)
L
Linear lasso program	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
livelock	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
Liveness	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
loop	A Solution to Endrullis-08 and Similar Problems (PDF, talk)
Loop Analysis	Real-world loops are easy to predict : a case study (PDF, talk)
M
maximal completion	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk)
model checking	Abstract: Fairness for Infinite-State Systems (PDF, talk)
mutual exclusion protocol	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)
N
network rewriting	Ordering Networks (PDF, talk)
non-termination	Non-termination using Regular Languages (PDF, talk) Non-termination of Dalvik bytecode via compilation to CLP (PDF, talk)
Nontermination	Geometric Series as Nontermination Arguments for Linear Lasso Programs (PDF, talk)
O
Orderings	Another Proof for the Recursive Path Ordering (PDF, talk)
Ordinals	To Infinity... and Beyond! (PDF, talk)
P
procedural program	On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk)
program analysis	Abstract: Fairness for Infinite-State Systems (PDF, talk)
program transformation	On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk)
PROP	Ordering Networks (PDF, talk)
PROP quasi-order	Ordering Networks (PDF, talk)
R
Ranking Function	To Infinity... and Beyond! (PDF, talk)
Recursive path ordering	Another Proof for the Recursive Path Ordering (PDF, talk)
regular languages	Non-termination using Regular Languages (PDF, talk)
Runtime Complexity Analysis	Type Introduction for Runtime Complexity Analysis (PDF, talk)
S
SAT	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk)
SAT encoding	A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (PDF, talk)
Semantic Labelling	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk) Kurth's Criterion H Revisited (PDF, talk)
semi-Thue system	A Solution to Endrullis-08 and Similar Problems (PDF, talk) Kurth's Criterion H Revisited (PDF, talk)
shared-memory	Reducing Deadlock and Livelock Freedom to Termination (PDF, talk)
string rewriting	A Solution to Endrullis-08 and Similar Problems (PDF, talk) On the derivational complexity of Kachinuki orderings (PDF, talk)
T
temporal logic	Abstract: Fairness for Infinite-State Systems (PDF, talk)
Term Rewrite Systems	Type Introduction for Runtime Complexity Analysis (PDF, talk)
term rewriting	Non-termination using Regular Languages (PDF, talk) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk)
termination	Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (PDF, talk) Reducing Deadlock and Livelock Freedom to Termination (PDF, talk) Another Proof for the Recursive Path Ordering (PDF, talk) A Solution to Endrullis-08 and Similar Problems (PDF, talk) Kurth's Criterion H Revisited (PDF, talk) On the derivational complexity of Kachinuki orderings (PDF, talk) Automatic Termination Analysis for GPU Kernels (PDF, talk) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (PDF, talk) To Infinity... and Beyond! (PDF, talk) Automating Elementary Interpretations (PDF, talk)
tree automata	Non-termination using Regular Languages (PDF, talk)
Trip Count Prediction	Real-world loops are easy to predict : a case study (PDF, talk)
Type Introduction	Type Introduction for Runtime Complexity Analysis (PDF, talk)
U
uniform termination	A Solution to Endrullis-08 and Similar Problems (PDF, talk) Kurth's Criterion H Revisited (PDF, talk)
V
verification	Specifying and verifying liveness properties of QLOCK in CafeOBJ (PDF, talk)