default search action
30th LICS 2015: Kyoto, Japan
- 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. IEEE Computer Society 2015, ISBN 978-1-4799-8875-4
Invited Talks
- Luke Ong
:
Higher-Order Model Checking: An Overview. 1-15 - Daniel Kifer:
Privacy and the Price of Data. 16 - Peter W. O'Hearn:
From Categorical Logic to Facebook Engineering. 17-20
Invited Tutorials
- Andrew M. Pitts
Names and Symmetry in Computer Science (Invited Tutorial). 21-22 - Geoffrey Smith:
Recent Developments in Quantitative Information Flow (Invited Tutorial). 23-31
Session 1: Petri Nets
- Michael Blondin
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. 32-43 - Tomás Brázdil, Stefan Kiefer, Antonín Kucera
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. 44-55 - Jérôme Leroux, Sylvain Schmitz:
Demystifying Reachability in Vector Addition Systems. 56-67 - Paul Brunet
Petri Automata for Kleene Allegories. 68-79 - Willem Heijltjes
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets. 80-91
Session 2: Foundations of Programming Languages
- Daniel R. Licata
A Cubical Approach to Synthetic Homotopy Theory. 92-103 - Tim Disney, Cormac Flanagan:
Game Semantics for Type Soundness. 104-114 - Jennifer Hackett, Graham Hutton
Programs for Cheap! 115-126 - Guillaume Munch-Maccagnoni, Gabriel Scherer
Polarised Intermediate Representation of Lambda Calculus with Sums. 127-140 - Beniamino Accattoli, Claudio Sacerdoti Coen
On the Relative Usefulness of Fireballs. 141-155
Session 3: Bisimilarity
- Andrzej S. Murawski, Steven J. Ramsay
Bisimilarity in Fresh-Register Automata. 156-167 - Wojciech Czerwinski, Petr Jancar
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. 168-179 - Chaodong He, Mingzhang Huang:
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete. 180-191
Session 4: Formal Languages
- Fabian Reiter
Distributed Graph Automata. 192-201 - Thomas Place:
Separating Regular Languages with Two Quantifiers Alternations. 202-213 - Mikolaj Bojanczyk:
Star Height via Games. 214-219
Session 5: Game Graphs and Game Semantics
- Takeshi Tsukada, C.-H. Luke Ong
Nondeterminism in Game Semantics via Sheaves. 220-231 - Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Parallel Intensionally Fully Abstract Games Model of PCF. 232-243 - Krishnendu Chatterjee, Zuzana Komárková, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. 244-256 - Lorenzo Clemente, Jean-François Raskin
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. 257-268 - Krishnendu Chatterjee
Improved Algorithms for One-Pair and k-Pair Streett Objectives. 269-280
Session 6: Databases
- Tomasz Gogacz, Jerzy Marcinkowski:
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. 281-292 - Michael Benedikt
The Complexity of Boundedness for Guarded Logics. 293-304 - Antoine Amarilli, Michael Benedikt
Finite Open-World Query Answering with Number Restrictions. 305-316 - Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. 317-328 - Diego Figueira
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency. 329-340
Session 7: Modal and Second-Order Logic
- Facundo Carreiro:
PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic. 341-352 - Sebastian Enqvist, Fatemeh Seifan
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras. 353-365 - Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa:
Defining Winning Strategies in Fixed-Point Logic. 366-377 - Michael Benedikt
Interpolation with Decidable Fixpoint Logics. 378-389 - Anupam Das
A Complete Axiomatization of MSO on Infinite Trees. 390-401
Session 8: Category Theory and Domains
- Kenji Maillard
A Fibrational Account of Local States. 402-413 - Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
Varieties of Languages in a Category. 414-425 - Abbas Edalat:
Extensions of Domain Maps in Differential and Integral Calculus. 426-437 - Arno Pauly
Descriptive Set Theory in the Category of Represented Spaces. 438-449 - Chris Heunen, Bert Lindenhovius:
Domains of Commutative C-Subalgebras. 450-461
Session 9: Constraints, Unification, and Knowledge Representation
- Catarina Carvalho
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. 462-474 - Bartek Klin
Locally Finite Constraint Satisfaction Problems. 475-486 - Víctor Dalmau
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. 487-498 - Adrià Gascón, Ashish Tiwari, Manfred Schmidt-Schauß
One Context Unification Problems Solvable in Polynomial Time. 499-510 - Tomer Kotek, Mantas Simkus
Extending ALCQIO with Trees. 511-522
Session 10: Computability and Proofs
- Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback Turing Computability, and Turing Computability as Feedback. 523-534 - Jörg Endrullis
Regularity Preserving but Not Reflecting Encodings. 535-546 - Arnold Beckmann, Norbert Preining:
Hyper Natural Deduction. 547-558 - Ugo Dal Lago
Parallelism and Synchronization in an Infinitary Context. 559-572 - Amar Hadzihasanovic
A Diagrammatic Axiomatisation for Qubit Entanglement. 573-584
Session 11: Randomization and Probabilities
- Benoit Monin, André Nies
A Unifying Approach to the Gamma Question. 585-596 - Annabelle McIver
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow. 597-608 - Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? 609-620 - Albert Atserias, José L. Balcázar:
Entailment among Probabilistic Implications. 621-632 - Raphaëlle Crubillé, Ugo Dal Lago
Metric Reasoning about λ-Terms: The Affine Case. 633-644
Session 12: Complexity
- Laura Bozzelli, David Pearce:
On the Complexity of Temporal Equilibrium Logic. 645-656 - Matthias Baaz
A Note on the Complexity of Classical and Intuitionistic Proofs. 657-666 - Antonia Lechner, Joël Ouaknine
On the Complexity of Linear Arithmetic with Divisibility. 667-676 - Erich Grädel, Wied Pakusa, Svenja Schalthöfer
Characterising Choiceless Polynomial Time with First-Order Interpretations. 677-688 - Andreas Krebs, Oleg Verbitsky:
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. 689-700
Session 13: Automata
- Borja Balle, Prakash Panangaden, Doina Precup:
A Canonical Form for Weighted Automata and Applications to Approximate Minimization. 701-712 - Naoki Kobayashi
Automata-Based Abstraction Refinement for µHORS Model Checking. 713-724 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
Nested Weighted Automata. 725-737 - Lorenzo Clemente, Slawomir Lasota
Timed Pushdown Automata Revisited. 738-749 - Udi Boker, Thomas A. Henzinger, Jan Otop
The Target Discounted-Sum Problem. 750-761
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: