|
LICS
|
RTA
|
SAT
|
| |
09:00‑10:00 (Grand Ballroom C)
Andreas Blass
Adapting Logics [pdf]
|
09:00‑10:00 (Willow A/B)
Javier Esparza
Rewriting Models of Control-Flow [pdf]
|
09:00‑10:00 (Grand Ballroom D)
Karem Sakallah
From Propositional Satisfiability To Satisfiability Modulo Theories [ppt]
|
10:00‑10:30
Break |
10:30‑11:00 (Grand Ballroom C)
Adam Barth
and John C. Mitchell
Managing Digital Rights using Linear Logic
|
10:30‑11:00 (Willow A/B)
Sylvain Salvati
Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear Lambda-Calculus
|
10:30‑11:00 (Grand Ballroom D)
Yinlei Yu and Sharad Malik
Lemma Learning in SMT on Linear Constraints
|
11:00‑11:30 (Grand Ballroom C)
Matthew Parkinson
, Richard Bornat
and Cristiano Calcagno
Variables as Resource in Hoare Logics
|
11:00‑11:30 (Willow A/B)
Yo Ohta and Masahito Hasegawa
A Terminating and Confluent Linear Lambda Calculus
|
11:00‑11:30 (Grand Ballroom D)
Robert Nieuwenhuis
and Albert Oliveras
On SAT Modulo Theories and Optimization Problems
|
11:30‑12:00 (Grand Ballroom C)
Jonathan Hayman
and Glynn Winskel
Independence and Concurrent Separation Logic
|
11:30‑12:00 (Willow A/B)
Ariel Arbiser
, Alexandre Miquel
and Alejandro Ríos
A Lambda-Calculus with Constructors
|
11:30‑12:00 (Grand Ballroom D)
Scott Cotton and Oded Maler
Fast and Flexible Difference Constraint Propagation for DPLL(T)
|
12:00‑12:30 (Grand Ballroom C)
Daniel Leivant
Matching explicit and modal reasoning about programs: a proof theoretic delineation of dynamic logic
|
12:00‑12:30 (Willow A/B)
Jose Espirito Santo
, Maria João Frade and Luís Pinto
Structural Proof Theory as Rewriting
|
12:00‑12:30 (Grand Ballroom D)
Hossein Sheini
and Karem Sakallah
A Progressive Simplifier for Satisfiability Modulo Theories
|
12:30‑14:00
Lunch break |
14:00‑14:30 (Grand Ballroom C)
Ugo Dal Lago
Context Semantics, Linear Logic and Computational Complexity
|
14:00‑14:30 (Willow A/B)
Steven Obua
Checking Conservativity of Overloaded Definitions in Higher-Order Logic
|
14:00‑14:30 (Grand Ballroom D)
Uwe Bubeck
and Hans Kleine Büning
Dependency Quantified Horn Formulas: Models and Complexity
|
14:30‑15:00 (Grand Ballroom C)
Olivier Laurent
and Lorenzo Tortora de Falco
Obsessional cliques: a semantic characterization of bounded time complexity
|
14:30‑15:00 (Willow A/B)
Adam Koprowski
Certified Higher-Order Recursive Path Ordering
|
14:30‑15:00 (Grand Ballroom D)
Stefan Porschen, Ewald Speckenmeyer and Bert Randerath
On Linear CNF Formulas
|
15:00‑15:30 (Grand Ballroom C)
Alexis Maciel
and Toniann Pitassi
A Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives
|
15:00‑15:30 (Willow A/B)
Takahito Aoto
Dealing with Non-Orientable Equations in Rewriting Induction
|
15:00‑15:30 (Grand Ballroom D)
Su Chen, Tomasz Imielinski, Karin Johnsgard, Donald Smith and Mario Szegedy
A Dichotomy Theorem for Constraint Satisfaction Problems with Disjoint Domains
|
15:30‑16:00
Break |
16:00‑16:30 (Grand Ballroom C)
Benoit Larose
, Cynthia Loten and Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems
|
16:00‑16:15 (Willow A/B)
Adam Koprowski
TPA: Termination Proved Automatically
|
16:00‑18:00 (Grand Ballroom D)
Poster Session |
16:15‑16:30 (Willow A/B)
Yuki Chiba and Takahito Aoto
RAPT: A Program Transformation System based on Term Rewriting
|
16:30‑17:00 (Grand Ballroom C)
Laura Chaubard, Jean-Eric Pin and Howard Straubing
First order formulas with modular predicates
|
16:30‑16:45 (Willow A/B)
Mathieu Turuani
The CL-Atse Protocol Analyser
|
16:45‑17:00 (Willow A/B)
Ian Wehrman
, Aaron Stump
and Edwin Westbrook
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
|
17:00‑17:30 (Grand Ballroom C)
Emil Kiss
and Matthew Valeriote
On tractability and congruence distributivity
|
|
17:30‑18:00 (Grand Ballroom C)
Lutz Schröder
and Dirk Pattinson
PSPACE bounds for rank-1 modal logics
|
| |
|
19:00‑22:00 (Grand Ballroom B)
LICS-SAT-RTA Joint Banquet |
19:00‑22:00 (Grand Ballroom B)
LICS-SAT-RTA Joint Banquet |
19:00‑22:00 (Grand Ballroom B)
LICS-SAT-RTA Joint Banquet |
