Non-termination of Dalvik bytecode via compilation to CLP (abstract)

Geometric Series as Nontermination Arguments for Linear Lasso Programs (abstract)

Non-termination using Regular Languages (abstract)

Termination of Biological Programs (abstract)

On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (abstract)

Automatic Termination Analysis for GPU Kernels (abstract)

Discussion (abstract)

To Infinity... and Beyond! (abstract)

Real-world loops are easy to predict : a case study (abstract)

Type Introduction for Runtime Complexity Analysis (abstract)

Foundations and Technology Competitions Award Ceremony (abstract)

FLoC Olympic Games Award Ceremony 1 (abstract)

FLoC Closing Week 1 (abstract)

Ordering Networks (abstract)

Discussion (abstract)

Fairness for Infinite-State Systems (abstract)

Reducing Deadlock and Livelock Freedom to Termination (abstract)

Specifying and verifying liveness properties of QLOCK in CafeOBJ (abstract)

Automating Elementary Interpretations (abstract)

A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (abstract)

Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (abstract)

A Solution to Endrullis-08 and Similar Problems (abstract)

Discussion (abstract)

On the derivational complexity of Kachinuki orderings (abstract)

Kurth's Criterion H Revisited (abstract)

Another Proof for the Recursive Path Ordering (abstract)

Discussion and Business Meeting (abstract)