VSL 2014: VIENNA SUMMER OF LOGIC 2014
VSL FOREWORD
VSL
PROGRAM
VOLUMES
VSL
|
FLoC
|
CAV
|
CSF
|
CSL-LICS
|
ICLP
|
IJCAR
|
ITP
|
RTA-TLCA
|
SAT
|
LC
|
LATD
|
KR
|
DL
|
NMR
|
2FC
|
ACL2
|
ADDCT
|
AISS
|
APPA
|
ARQNL
|
ARW-DT
|
ASA
|
ASPOCP
|
Automatheo
|
CHR
|
CICLOPS-WLPE
|
CLC
|
Coq
|
CSPSAT
|
DCM
|
DTP
|
EC2
|
FCS-FCC
|
FRIDA
|
FWFM
|
GeTFun
|
GSB
|
HCVS
|
HOL
|
HOPA
|
HOR
|
HSB
|
IFIP-WG16
|
INFINITY
|
iPRA
|
ITRS
|
IWC
|
Isabelle
|
KInAR
|
KR4HC
|
LaSh
|
LCC
|
LFMTP
|
LG
|
Linearity
|
LOLA
|
LSB
|
NCPROOFS
|
NLCS
|
NLSR
|
NSV
|
ORE
|
PAAR
|
ParSearchOpt
|
PAS
|
PC
|
PCCR
|
PLP
|
POS
|
PRUV
|
PSC
|
QBF
|
QED
|
QUANTIFY
|
RCRA
|
REORDER
|
RS
|
SMT
|
SD
|
SSV
|
STAST
|
SYNT
|
TermGraph
|
UITP
|
UNIF
|
Vampire
|
VEMDP
|
VERIFY
|
VeriSure
|
VPT
|
VSTTE
|
WING
|
WIR
|
WPTE
|
WST
|
WWV
CFP
|
HOME
|
PC
|
PROGRAM
|
VOLUME
WST 2014 INFORMAL PROCEEDINGS
Papers
Papers with Abstracts
Preface
Author Index
Keyword Index
Editor:
Carsten Fuhs
Authors
Title
Paper
Talk
Martin Avanzini
and
Bertram Felgenhauer
Type Introduction for Runtime Complexity Analysis
Jul 17 15:30
Alexander Bau
,
Rene Thiemann
and
Johannes Waldmann
Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling
Jul 18 11:45
Byron Cook
,
Heidy Khlaaf
and
Nir Piterman
Abstract: Fairness for Infinite-State Systems
Jul 18 08:45
Byron Cook
,
Stephen Magill
,
Matthew Parkinson
and
Thomas Stroeder
Reducing Deadlock and Livelock Freedom to Termination
Jul 18 09:15
Nachum Dershowitz
Another Proof for the Recursive Path Ordering
Jul 18 15:30
Joerg Endrullis
and
Hans Zantema
Non-termination using Regular Languages
Jul 17 09:45
Alfons Geser
A Solution to Endrullis-08 and Similar Problems
Jul 18 12:15
Alfons Geser
Kurth's Criterion H Revisited
Jul 18 15:00
Lars Hellström
Ordering Networks
Jul 17 16:30
Dieter Hofbauer
On the derivational complexity of Kachinuki orderings
Jul 18 14:30
Jeroen Ketema
and
Alastair Donaldson
Automatic Termination Analysis for GPU Kernels
Jul 17 12:15
Jan Leike
and
Matthias Heizmann
Geometric Series as Nontermination Arguments for Linear Lasso Programs
Jul 17 09:15
Naoki Nishida
and
Takumi Kataoka
On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants
Jul 17 11:45
Étienne Payet
and
Fred Mesnard
Non-termination of Dalvik bytecode via compilation to CLP
Jul 17 08:45
Norbert Preining
,
Kazuhiro Ogata
and
Kokichi Futatsugi
Specifying and verifying liveness properties of QLOCK in CafeOBJ
Jul 18 09:45
Raphael Rodrigues
,
Péricles Alves
,
Fernando Pereira
and
Laure Gonnord
Real-world loops are easy to predict : a case study
Jul 17 15:00
Haruhiko Sato
and
Sarah Winkler
A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion
Jul 18 11:15
Caterina Urban
and
Antoine Miné
To Infinity... and Beyond!
Jul 17 14:30
Harald Zankl
,
Sarah Winkler
and
Aart Middeldorp
Automating Elementary Interpretations
Jul 18 10:45
Disclaimer
|
Powered by EasyChair Smart Program