VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

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

Disclaimer | Powered by EasyChair Smart Program