14th International Workshop on Termination (WST 2014)
Carsten Fuhs · 2014
Fairness for Infinite-State Systems 11 Byron Cook, Heidy Khlaaf and Nir Piterman Reducing Deadlock and Livelock Freedom to Termination 16 Byron Cook, Stephen Magill, Matthew Parkinson and Thomas Stroeder Another Proof for the Recursive Path Ordering 21 Nachum Dershowitz Non-termination using Regular Languages 26 Joerg Endrullis and Hans Zantema A Solution to Endrullis-08 and Similar Problems 31 Alfons Geser Kurth’s Criterion H Revisited 36 Alfons Geser Ordering Networks 41 Lars Hellstrom On the derivational complexity of Kachinuki orderings 46 Dieter Hofbauer Automatic Termination Analysis for GPU Kernels 50 Jeroen Ketema and Alastair Donaldson Geometric Series as Nontermination Arguments for Linear Lasso Programs 55 Jan Leike and Matthias Heizmann On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants 60 Naoki Nishida and Takumi Kataoka Non-termination of Dalvik bytecode via compilation to CLP 65 Etienne Payet and Fred Mesnard Specifying and verifying liveness properties of QLOCK in CafeOBJ 70 Norbert Preining, Kazuhiro Ogata and Kokichi Futatsugi