VSL 2014: VIENNA SUMMER OF LOGIC 2014

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

Disclaimer | Powered by EasyChair Smart Program