VSL 2014: VIENNA SUMMER OF LOGIC 2014

PROGRAM FOR TUESDAY, JULY 15TH: TALK VIEW

Days:
previous day
next day
all days

View: with abstractssession overview

SAT
CAV
CSL-LICS
ITP
LC
VSL
CSF
FLoC
RTA-TLCA
LG
IJCAR
ICLP
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
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
09:00-09:45
Ludics and interactive completeness
Kazushige Terui
09:45-10:15
Forward and backward induction in dynamic games: Distilling the axiomatic differences on common
Sujata Ghosh, Aviad Heifetz
09:15-10:15
Definability, automorphisms and enumeration degrees
Mariya I. Soskova
10:45-11:15
Zero-Reachability in Probabilistic Multi-Counter Automata
Tomas Brazdil, Stefan Kiefer, Antonin Kucera, Petr Novotný, Joost-Pieter Katoen
11:15-11:45
Senescent Ground Tree Rewrite Systems
Matthew Hague
11:45-12:15
Abstract Interpretation from Buchi Automata
Wei Chen, Martin Hofmann
12:15-12:45
Separating Regular Languages with First-Order Logic
Thomas Place, Marc Zeitoun
10:45-11:15
Coinduction Up-To in a Fibrational Setting
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
11:15-11:45
Deadlock and lock freedom in the linear pi-calculus
Luca Padovani
11:45-12:15
Secure Equilibria in Weighted Games
Véronique Bruyère, Noémie Meunier, Jean-Francois Raskin
12:15-12:45
Infinite sequential games with real-valued payoffs
Stephane Le Roux, Arno Pauly
10:45-11:15
A Formal Library for Elliptic Curves in the Coq Proof Assistant
Evmorfia-Iro Bartzia, Pierre-Yves Strub
11:15-11:45
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
Kento Emoto, Frédéric Loulergue, Julien Tesson
11:45-12:15
Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm
Peter Lammich
12:15-12:45
Cardinals in Isabelle/HOL
Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
12:45-13:00
HOL Constant Definitions Done Right
Rob Arthan
10:45-11:15
Ramsey Theorem as an intuitionistic property of well founded relations
Stefano Berardi, Silvia Steila
11:15-11:45
Termination of Cycle Rewriting
Hans Zantema, Barbara Koenig, Sander Bruggink
11:45-12:15
First-Order Formative Rules
Carsten Fuhs, Cynthia Kop
12:15-12:45
Formalizing monotone algebras for certification of termination- and complexity proofs
Christian Sternagel, René Thiemann
12:45-13:00
Nagoya Termination Tool (System Description)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
10:45-11:30
Signaling in independence-friendly logic
Gabriel Sandu
11:30-12:00
Game Reduction
Dietmar Berwanger, Marie van den Bogaard
12:00-12:30
Game Semantics from a Cognitive Modeling Standpoint
Emmanuel Genot, Justine Jacot
12:30-13:00
Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
Rasmus K. Rendsvig
10:45-11:15
Long Proofs of (Seemingly) Simple Formulas
Mladen Miksa, Jakob Nordström
11:15-11:45
Proof complexity and the Lovasz-Kneser Theorem
Gabriel Istrate, Adrian Crăciun
11:00-12:00
Tutorial on Stategic and Extensive Games 2
Krzysztof Apt
12:00-13:00
Logic meets number theory in o-minimality
Matthias Aschenbrenner
11:50-12:20
Ultimately Incremental SAT
Alexander Nadel, Ofer Strichman, Vadim Ryvchin
12:20-12:40
Community Branching for Parallel Portfolio SAT Solvers
Tomohiro Sonobe, Shuya Kondoh, Mary Inaba
12:40-13:00
Lazy clause exchange policy for parallel SAT solvers
Laurent Simon, Gilles Audemard
14:30-15:00
Two-Way Cost Automata and Cost Logics over Infinite Trees
A. Blumensath, T. Colcombet, D. Kuperberg, P. Parys, M. Vanden Boom
15:00-15:30
Logical Characterization of Weighted Pebble Walking Automata
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
15:30-16:00
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Georg Gottlob, Enrico Malizia
14:30-15:00
Decomposition Theorems and Model-Checking for the Modal mu-calculus
Christoph Dittmann, Stephan Kreutzer, Mikolaj Bojanczyk
15:00-15:30
Logics with Counting and Equivalence
Ian Pratt-Hartmann
15:30-16:00
Local Temporal Reasoning
Eric Koskinen, Tachio Terauchi
14:30-15:00
Balancing lists: a proof pearl
Guyslain Naves, Arnaud Spiwack
15:00-16:00
Invited talk: Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK
Rod Chapman, Florian Schanda
14:30-15:30
A unified approach to Univalent Foundations and Homotopical Algebra
Nicola Gambino
15:30-16:00
Amortised Resource Analysis and Typed Polynomial Interpretations
Martin Hofmann, Georg Moser
14:30-15:15
Semantic games for Łukasiewicz logic
Ondrej Majer
15:15-15:45
Game Semantics for Conditional Logic
Johannes Marti, Riccardo Pinosio
15:45-16:15
Multi-Agent Dialogical Games for Modal Logic
Martin Sticht
14:30-15:30
A (Biased) Proof Complexity Survey for SAT Practitioners
Jakob Nordström
14:30-15:15
Elections and knowledge
Rohit Parikh
15:15-16:00
Nash equilibrium semantics for Independence-Friendly Logic
Gabriel Sandu
14:30-15:15
UD-randomness and the Turing degrees
Johanna Franklin
15:15-16:00
On finitely presented expansions of groups and algebras
Bakhadyr Khoussainov
14:30-15:15
Matrix iterations and Cichoń's diagram
Diego A. Mejía
15:15-16:00
Regular cross-sections of Borel flows
Konstantin Slutsky
14:30-16:00
The place of logic in computer science education
B. Cook, A. Leitsch, P. Panangaden, N. Schweikardt, H. Veith, R. Zach
15:30-16:00
Unified characterisations of resolution hardness measures
Oliver Kullmann, Olaf Beyersdorff
16:30-17:30
Abstract Interpretation: Past, Present and Future
Patrick Cousot, Radhia Cousot
16:30-17:00
An Isabelle Proof Method Language
Daniel Matichuk, Makarius Wenzel, Toby Murray
17:00-17:30
Asynchronous User Interaction and Tool Integration in Isabelle/PIDE
Makarius Wenzel
17:30-18:00
Collaborative Interactive Theorem Proving with Clide
Martin Ring, Christoph Lüth
16:30-17:00
Self Types for Dependently Typed Lambda Encodings
Peng Fu, Aaron Stump
17:00-17:30
The Structural Theory of Pure Type Systems
Cody Roux, Floris van Doorn
17:30-18:00
Unnesting of Copatterns
Andreas Abel, Brigitte Pientka, Anton Setzer, David Thibodeau
16:30-17:00
Non-characterizability in belief revision: an application of finite model theory
Jon Yaggie, Gyorgy Turan
17:00-17:30
Game Semantics for Some Non-Classical Logics
Can Baskent
16:30-17:00
QBF Resolution Systems and their Proof Complexities
Valeriy Balabanov, Magdalena Widl, Jie-Hong Roland Jiang
16:30-16:50
Modal logic of clocks: Modalizing a first-order theory of time to get a better understanding of relativity
Attila Molnar, Gergely Szekely
16:50-17:10
Towards a Conditional for The Liar and the Sorites.
Sergi Oms
17:10-17:30
On graph calculus approach to modalities
Sheila Veloso, Paulo Veloso, Mario Benevides
17:30-17:50
Complexity of generalized grading with inverse relations and intersection of relations
Mitko Yanchev
17:50-18:10
Fuzzy Bsimulation for Standard Godel Modal Logic
Tuan-Fang Fan, Churn-Jung Liau
18:10-18:30
Hybrid extensions of S4 with the finite model property
Willem Conradie, Claudette Robinson
16:30-16:50
Almost structurally complete consequence operations extending S4.3
Piotr Wojtylak, Wojciech Dzik
16:50-17:10
Truth theory for logic of self-reference statements as a quaternion structure
Vladimir Stepanov
17:10-17:30
A Routley-Meyer semantics for Göodel 3-valued logic G3
Gemma Robles
17:30-17:50
Blocking the routes to triviality with depth relevance
José M. Méndez, Gemma Robles, Francisco Salto
16:30-16:50
On the almost sure validities in the finite in some fragments of monadic second-order logic
Valentin Goranko
16:50-17:10
Completeness of second-order separation logic for program verification
Makoto Tatsuta, Wei-Ngan Chin
17:10-17:30
Infinite Games Specified by 2-Tape Automata
Olivier Finkel
17:30-17:50
Circuit lower bounds in bounded arithmetics
Ján Pich
17:50-18:10
Model theory of bounded arithmetic and complexity theory
Michal Garlik
18:10-18:30
Weak Arithmetical Semantics for the Logic of Proofs
Thomas Studer
16:30-16:50
Boolean algebras and degrees of autostability relative to strong constructivizations
Nikolay Bazhenov
16:50-17:10
The $ \Delta^{0}_{\alpha} $-dimension of computable structures
Pavel Alaev
17:10-17:30
On categoricity of scattered linear orders
Andrey Frolov, Maxim Zubkov
17:30-17:50
A DNC function that computes no effectively bi-immune set
Achilles Beros
17:50-18:10
Integer-valued randomness and degrees
Michael McInerney
18:10-18:30
Effective genericity and differentiable functions
Rutger Kuyper
16:30-16:50
On $\Sigma^0_2$-initial segments of computable linear orders
Ravil Bikmukhametov
16:50-17:10
A non-uniqueness theorem for jumps of principal ideals
David Belanger, Richard Shore
17:10-17:30
Every non-zero honest elementary degree has the cupping property
Paul Shafer
17:30-17:50
Degree spectra of relations on a cone
Matthew Harrison-Trainor
17:50-18:10
$\Delta_2^0$-spectra of linear orderings
Andrey Frolov
18:10-18:30
Degree spectra of structures under $\Sigma_n$-equivalence.
Pavel Semukhin, Ekaterina Fokina, Daniel Turetsky
16:30-16:50
Effective results on the asymptotic behavior of nonexpansive iterations
Laurentiu Leustean
16:50-17:10
Pi_1 induction axioms vs Pi 1 induction rules
Andres Cordon-Franco And F. Felix Lara-Martin
17:10-17:30
Reverse mathematics of WQOs and Noetherian spaces
Alberto Marcone
17:30-17:50
A characterization for diagonalized--out objects
Saeed Salehi
17:50-18:10
Some applications of the Arithmetized Completeness Theorem to second-order arithmetic
Tin Lok Wong
18:10-18:30
Some properties of Intuitionistic Set Theory with the principle UP.
Alexey Vladimirov
16:30-16:50
The complexity of computably enumerable graphs
Luca San Mauro
16:50-17:10
The order dimensions of degree structures
Kojiro Higuchi
17:10-17:30
Computable numberings in Ershov hierarchy
Sergey Ospichev
17:30-17:50
Davies-trees in infinite combinatorics
Daniel Tamas Soukup
17:50-18:10
A descriptive set theoretical axiomatization of the Mathias model.
Wojciech Stadnicki
18:10-18:30
Restricting Martin's axiom to a ccc ground model
Miha Habič
16:30-16:50
Elementary epimorphisms between models of set theory
Robert Lubarsky, Norman Lewis Perlmutter
16:50-17:10
Generalized Ellentuck spaces and initial Tukey chains of non-p-points
Natasha Dobrinen
17:10-17:30
Co-analytic ideals on $\omega$
Konstantinos Beros
17:30-17:50
Budding Trees
Sheila Miller, Natasha Dobrinen
17:50-18:10
Finite Inseparability of Elementary Theories Based on Connection
Hsing-Chien Tsai
16:30-16:50
On various strengthenings of the notion of indivisibility
Nadav Meir
16:50-17:10
An ordinal rank characterising when Forth suffices
Roger Villemaire
17:10-17:30
Extreme amenability of precompact expansions of countably categorical structures
Alexandre Ivanov
17:30-17:50
Weak Beth definability property for finite variable fragments.
Hajnal Andréka, István Németi
17:50-18:10
Non-monotonic extensions of the weak Kleene clone with constants
Jose Martinez-Fernandez
18:10-18:30
A sheaf model of randomness
Alex Simpson
16:30-16:50
A Defense of Information Economy Principle
Hao Cheng Fu
16:50-17:10
Prospects for a Naive Theory of Classes
Hartry Field, Harvey Lederman
17:10-17:30
On the logical use of implicit contradictions
Antonio Vincenzi
17:30-17:50
Definable topological dynamics and real Lie groups
Grzegorz Jagiella
17:50-18:10
Topologies on Polish structures
Jan Dobrowolski
18:10-18:30
Explosiveness, Model Existence, and Incompatible Paraconsistencies
Jui-Lin Lee
17:00-18:00 SAT Association General Assembly
18:00-19:00 SIGLOG Meeting
19:00-20:00 Annual meeting of the EACSL
19:00-23:00 RTA/TLCA conference dinner
10:15-10:45 Coffee Break
13:00-14:30 Lunch Break
16:00-16:30 Coffee Break
19:00-20:00
VSL Public Lecture: Gödel in Vienna
Karl Sigmund
Disclaimer | Powered by EasyChair Smart Program