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
PROGRAM FOR THURSDAY, JULY 24TH: TALK VIEW
Days:
previous day
all days
View:
with abstracts
session overview
ARW-DT
PRUV
SYNT
HSB
KR
FRIDA
9:00
9:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
08:45-09:45
Defining privacy is supposed to be easy
Luca Viganò
09:45-10:15
Extended Resolution in Modern SAT Solving
Norbert Manthey
08:45-09:45
The Whole Organism Challenge
David Harel
09:45-10:15
Modeling and analysis of qualitative behavior of gene regulatory networks
Alvis Brazma, Karlis Cerans, Dace Ruklisa, Thomas Schlitt, Juris Viksna
09:00-10:15
Datalog+/–: Questions and Answers
Georg Gottlob, Thomas Lukasiewicz, Andreas Pieris
09:00-10:15
Automatic Device Driver Synthesis Project: a Work-in-Progress Report (Invited Talk)
Leonid Ryzhyk
09:00-10:15
Specifying, Reasoning About, Optimizing, and Implementing Atomic Data Services for Distributed
Alexander Shvartsman
09:00-10:15
TBA
Gabriele Kern-Isberner
10:45-11:15
Logic Programs with Ordered Disjunction: First-order Semantics and Expressiveness
Vernon Asuncion, Yan Zhang, Heng Zhang
11:15-11:45
Constructive Negation in Extensional Higher-Order Logic Programming
Angelos Charalambidis, Panos Rondogiannis
11:45-12:15
The Well-Founded Semantics Is the Principle of Inductive Definition, revisited
Marc Denecker, Joost Vennekens
12:15-12:45
The Semantics of Gringo and Infinitary Propositional Formulas
Amelia Harrison, Vladimir Lifschitz, Fangkai Yang
10:45-11:15
Dynamic Causal Calculus
Alexander Bochman
11:15-11:45
Appropriate Causal Models and Stability of Causation
Joseph Halpern
11:45-12:15
Axiomatizing Rationality
Adam Bjorndahl, Joseph Halpern, Rafael Pass
12:15-12:45
∃GUARANTEENASH for Boolean Games Is NEXP-Hard
Egor Ianovski, Luke Ong
10:45-11:15
Parameterized Synthesis Case Study: AMBA AHB
Ayrat Khalimov, Swen Jacobs, Roderick Bloem
11:15-11:45
Are There Good Mistakes? A Theoretical Analysis of CEGIS
Susmit Jha, Sanjit A. Seshia
11:45-13:00
Petri Games: Synthesis of Distributed Systems with Causal Memory (Invited Talk)
Bernd Finkbeiner
10:45-11:15
Using CSP Meta Variables in AI Planning
Mark Judge
11:15-11:45
Automated Reasoning in Deontic Logic
Claudia Schon, Ulrich Furbach, Frieder Stolzenburg
11:45-12:15
(AI) Planning to Reconfigure your Robot?
Mark Judge
12:15-12:45
Second-Order Characterizations of Definientia in Formula Classes
Christoph Wernhard
12:45-13:15
On Herbrand theorems for classical and non-classical logics
Alexander Lyaletski
10:45-11:30
Tutorial: Challenges and opportunities in controlling the human heart
Radu Grosu
11:30-12:00
Integration of rule-based models and compartmental models of neurons
David C Sterratt, Oksana Sorokina, J Douglas Armstrong
12:00-12:30
Optimal Observation Time Points in Stochastic Chemical Kinetics
Charalampos Kyriakopoulos, Verena Wolf
12:30-13:00
Exploiting the eigenstructures of linear systems to speed up reachability computation
Alexandre Rocca, Thao Dang, Eric Fanchon
10:45-11:15
Verification and Validation Challenges in Smart Grids from the Industrial Perspective
Tobias Gawron-Deutsch
11:15-11:45
A Fast, Correct Time-Stamped Stack
Mike Dodds, Andreas Haas, Christoph Kirsch
11:45-12:15
Correctness and Performance Analysis of Distributed High Performance Programs in Scala
Felix P. Hargreaves, Daniel Merkle, Peter Schneider-Kamp
12:15-12:45
Models and techniques for verification of Software Defined Networks
Victor Altukhov, Eugene Chemeritskiy, Vladislav Podymov, Vladimir Zakharov
10:45-11:15
Answering Ontological Ranking Queries Based on Subjective Reports
T. Lukasiewicz, M.V. Martinez, C. Molinaro, L. Predoiu, G. Simari
11:15-11:45
Reasoning Under Belief Uncertainty in DL Lite N bool Using Finite Models
Ala Djeddai, Hassina Seridi, Tarek Khadir
11:45-12:15
Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy
Christoph Beierle, Markus Höhnerbach, Marcus Marto
12:50-13:50
KR Open Discussion and Closing
14:30-15:00
Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
Fabio Papacchini, Renate A. Schmidt
15:00-15:30
A Resolution-Based Prover for Normal Modal Logics
Cláudia Nalon, George Bezerra Silva
15:30-16:00
Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge
Patrick Koopmann, Renate A. Schmidt
14:30-14:55
Bayesian Design for Whole Cell Synthetic Biology Models
C. Angione, E. Bartocci, L. Bortolussi, P. Lio', A. Occhipinti, G. Sanguinetti
14:55-15:20
RKappa: Statistical sampling suite for Kappa models.
Anatoly Sorokin, Oksana Sorokina, J. Douglas Armstrong
15:20-16:00
Concluding remarks: Dynamic Systems Biology
Oded Maler
14:30-15:00
Round model for distributed algorithms: from verification to implementation.
Cezara Dragoi, Josef Widder, Damien Zufferey
15:00-15:30
On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering
L. Millet, M. Gradinariu Potop-Butucaru, N. Sznajder, S. Tixeuil
15:30-16:00
Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
Sasha Rubin
14:30-16:00
Demo session & closing
14:45-15:15
AbsSynthe: abstract synthesis from succinct safety specifications
Romain Brenguier, Guillermo Perez, Ocan Sankur, Jean-Francois Raskin
15:15-15:45
Low-effort Specification Debugging and Analysis
Rüdiger Ehlers, Vasumathi Raman
16:30-17:00
The Leo-III Project
Max Wisniewski, Alexander Steen, Christoph Benzmüller
17:00-17:30
Socratic Proofs for Propositional Linear-Time Logic
Alexander Bolotov, Vasilyi Shangin, Oleg Grigoriev, Mariusz Urbanski
17:30-18:00
Modular Verification of Interconnected Families of Uniform Linear Hybrid Automata
Matthias Horbach, Viorica Sofronie-Stokkermans
16:30-17:00
Synthesizing self-stabilizing fault-tolerant algorithms (extended abstract)
Joel Rybicki
17:00-17:30
Synthesis for Resilient Distributed Systems
Nicolas Braud-Santoni, Swen Jacobs
17:30-18:00
Parameterized Synthesis
Swen Jacobs
10:15-10:45
Coffee Break
13:00-14:30
Lunch Break
16:00-16:30
Coffee Break
Disclaimer
|
Powered by EasyChair Smart Program