default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSL-LICS 2014: Vienna, Austria
- Thomas A. Henzinger, Dale Miller:
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, Vienna, Austria, July 14 - 18, 2014. ACM 2014, ISBN 978-1-4503-2886-9
Invited speakers
- Christel Baier
, Clemens Dubslaff, Sascha Klüppelholz:
Trade-off analysis meets probabilistic model checking. 1:1-1:10 - Patrick Cousot, Radhia Cousot:
Abstract interpretation: past, present and future. 2:1-2:10
Invited tutorials
- Jasmin Fisher:
Understanding biology through logic. 3:1 - Assia Mahboubi:
Computer-checked mathematics: a formal proof of the odd order theorem. 4:1
Award citations
- Anuj Dawar:
The Ackermann award 2014. 5:1-5:3 - Dexter Kozen:
Citations for the test-of-time award from 1994. 6:1
Contributed papers
- Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-state energy games. 7:1-7:10 - Beniamino Accattoli, Ugo Dal Lago:
Beta reduction is invariant, indeed. 8:1-8:10 - Rajeev Alur, Adam Freilich, Mukund Raghothaman:
Regular combinators for string transformations. 9:1-9:10 - Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu:
Asymptotic behaviour in temporal logic. 10:1-10:9 - Christel Baier, Joachim Klein, Sascha Klüppelholz, Sascha Wunderlich:
Weight monitoring with linear temporal logic: complexity and decidability. 11:1-11:10 - Pablo Barceló, Pablo Muñoz:
Graph logics with rational relations: the role of word combinatorics. 12:1-12:10 - Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective interpolation and preservation in guarded logics. 13:1-13:10 - Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli:
On the discriminating power of passivation and higher-order interaction. 14:1-14:10 - Paul Bilokon, Abbas Edalat:
A domain-theoretic approach to Brownian motion and general continuous stochastic processes. 15:1-15:10 - Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. 16:1-16:9 - Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer:
Decomposition theorems and model-checking for the modal μ-calculus. 17:1-17:10 - Benedikt Bollig:
Logic for communicating automata with parameterized topology. 18:1-18:10 - Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
Logical characterization of weighted pebble walking automata. 19:1-19:10 - Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot:
Coinduction up-to in a fibrational setting. 20:1-20:9 - Simone Bova, Robert Ganian, Stefan Szeider:
Model checking existential logic on partially ordered sets. 21:1-21:10 - Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen:
Zero-reachability in probabilistic multi-counter automata. 22:1-22:10 - Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The complexity of admissibility in Omega-regular games. 23:1-23:10 - Flavien Breuvart:
On the characterization of models of H. 24:1-24:10 - James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, Nikos Gorogiannis:
A decision procedure for satisfiability in separation logic with inductive predicates. 25:1-25:10 - Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure equilibria in weighted games. 26:1-26:26 - Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Weak MSO: automata and expressiveness modulo bisimilarity. 27:1-27:27 - Simon Castellan, Pierre Clairambault, Glynn Winskel:
Symmetry in concurrent games. 28:1-28:10 - Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Decidability of weak logics with deterministic transitive closure. 29:1-29:10 - Kaustuv Chaudhuri, Nicolas Guenot:
Equality and fixpoints in the calculus of structures. 30:1-30:10 - Hubie Chen:
The tractability frontier of graph-like first-order query sets. 31:1-31:9 - Hubie Chen, Moritz Müller:
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. 32:1-32:10 - Taolue Chen, Stefan Kiefer:
On the total variation distance of labelled Markov chains. 33:1-33:10 - Julien Cretin, Didier Rémy:
System F with coercion constraints. 34:1-34:10 - Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu:
The geometry of synchronization. 35:1-35:10 - Anupam Das:
On the pigeonhole and related principles in deep inference and monotone systems. 36:1-36:10 - Stéphane Demri, Morgan Deters:
Expressive completeness of separation logic with two variables and no separating conjunction. 37:1-37:10 - Thomas Ehrhard:
A new correctness criterion for MLL proof nets. 38:1-38:10 - Jörg Endrullis, Dimitri Hendriks:
On periodically iterated morphisms. 39:1-39:10 - Diego Figueira, Leonid Libkin:
Pattern logics and auxiliary relations. 40:1-40:10 - Marcelo P. Fiore, Sam Staton:
Substitution, jumps, and algebraic effects. 41:1-41:10 - Matthew Fredrikson, Somesh Jha:
Satisfiability modulo counting: a new approach for analyzing privacy properties. 42:1-42:10 - Georg Gottlob, Enrico Malizia:
Achieving new upper bounds for the hypergraph duality problem through logic. 43:1-43:10 - Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras:
KAT + B! 44:1-44:10 - Nicolas Guenot, Lutz Straßburger:
Symmetric normalisation for intuitionistic logic. 45:1-45:10 - Julian Gutierrez, Michael J. Wooldridge:
Equilibria of concurrent games on event structures. 46:1-46:10 - Christoph Haase:
Subclasses of presburger arithmetic and the weak EXP hierarchy. 47:1-47:10 - Matthew Hague:
Senescent ground tree rewrite systems. 48:1-48:10 - Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. 49:1-49:10 - Willem Heijltjes, Robin Houston:
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete. 50:1-50:10 - Martin Hofmann, Wei Chen:
Abstract interpretation from Büchi automata. 51:1-51:10 - Naohiko Hoshino, Koko Muroya, Ichiro Hasuo:
Memoryful geometry of interaction: from coalgebraic components to algebraic effects. 52:1-52:10 - Danko Ilik:
Axioms and decidability for type isomorphism in the presence of sums. 53:1-53:7 - Alan Jeffrey:
Functional reactive types. 54:1-54:9 - Joost-Pieter Katoen, Lei Song, Lijun Zhang:
Probably safe or live. 55:1-55:10 - Bakhadyr Khoussainov:
A quest for algorithmically random infinite structures. 56:1-56:9 - Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev:
On the succinctness of query rewriting over shallow ontologies. 57:1-57:10 - Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. 58:1-58:10 - Eric Koskinen, Tachio Terauchi:
Local temporal reasoning. 59:1-59:10 - Stephan Kreutzer, Nicole Schweikardt:
On Hanf-equivalence and the number of embeddings of small induced subgraphs. 60:1-60:10 - Ranko Lazic, Sylvain Schmitz:
Non-elementary complexities for branching VASS, MELL, and extensions. 61:1-61:10 - Stéphane Le Roux, Arno Pauly:
Infinite sequential games with real-valued payoffs. 62:1-62:10 - Jérôme Leroux, M. Praveen, Grégoire Sutre:
Hyper-Ackermannian bounds for pushdown vector addition systems. 63:1-63:10 - Paul Blain Levy, Sam Staton:
Transition systems over games. 64:1-64:10 - Hongjin Liang, Xinyu Feng, Zhong Shao:
Compositional verification of termination-preserving refinement of concurrent programs. 65:1-65:10 - Daniel R. Licata, Eric Finster:
Eilenberg-MacLane spaces in homotopy type theory. 66:1-66:9 - Katja Losemann, Wim Martens:
MSO queries on trees: enumerating answers under updates. 67:1-67:10 - Marcello Mamino:
On the computing power of +, -, and ×. 68:1-68:10 - Konstantinos Mamouras:
On the Hoare theory of monadic recursion schemes. 69:1-69:10 - Guillaume Munch-Maccagnoni:
Formulae-as-types for an involutive negation. 70:1-70:10 - Rasmus Ejlers Møgelberg:
A type theory for productive coprogramming via guarded recursion. 71:1-71:10 - Luca Padovani:
Deadlock and lock freedom in the linear π-calculus. 72:1-72:10 - Matthieu Perrinel:
On context semantics and interaction nets. 73:1-73:10 - Grgur Petric Maretic, Mohammad Torabi Dashti, David A. Basin:
Anchored LTL separation. 74:1-74:9 - Thomas Place, Marc Zeitoun:
Separating regular languages with first-order logic. 75:1-75:10 - Ian Pratt-Hartmann:
Logics with counting and equivalence. 76:1-76:10 - Pierre-Marie Pédrot:
A functional functional interpretation. 77:1-77:10 - Takeshi Tsukada, C.-H. Luke Ong:
Compositional higher-order model checking via ω-regular games over Böhm trees. 78:1-78:10 - Yaron Velner:
Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives. 79:1-79:10 - Ryan Williams:
Faster decision of first-order graph properties. 80:1-80:6
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 2025-12-05 22:21 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:
