CSL-LICS

Keyphrases

Publications

2014

Naohiko Hoshino, Koko Muroya, Ichiro Hasuo
Memoryful geometry of interaction: from coalgebraic components to algebraic effects. CSL-LICS (2014)
Eric Koskinen, Tachio Terauchi
Local temporal reasoning. CSL-LICS (2014)
Simon Castellan, Pierre Clairambault, Glynn Winskel
Symmetry in concurrent games. CSL-LICS (2014)
Benedikt Bollig
Logic for communicating automata with parameterized topology. CSL-LICS (2014)
Hongjin Liang, Xinyu Feng, Zhong Shao
Compositional verification of termination-preserving refinement of concurrent programs. CSL-LICS (2014)
Kaustuv Chaudhuri, Nicolas Guenot
Equality and fixpoints in the calculus of structures. CSL-LICS (2014)
Bakhadyr Khoussainov
A quest for algorithmically random infinite structures. CSL-LICS (2014)
Marcelo P. Fiore, Sam Staton
Substitution, jumps, and algebraic effects. CSL-LICS (2014)
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 '14, Vienna, Austria, July 14 - 18, 2014 CSL-LICS (2014)
Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot
Coinduction up-to in a fibrational setting. CSL-LICS (2014)
Stéphane Le Roux, Arno Pauly
Infinite sequential games with real-valued payoffs. CSL-LICS (2014)
Ian Pratt-Hartmann
Logics with counting and equivalence. CSL-LICS (2014)
Luca Padovani
Deadlock and lock freedom in the linear π-calculus. CSL-LICS (2014)
Flavien Breuvart
. CSL-LICS (2014)
Anuj Dawar
The Ackermann award 2014. CSL-LICS (2014)
Matthieu Perrinel
On context semantics and interaction nets. CSL-LICS (2014)
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
The complexity of admissibility in Omega-regular games. CSL-LICS (2014)
Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS (2014)
Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras
KAT + B! CSL-LICS (2014)
Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu
Asymptotic behaviour in temporal logic. CSL-LICS (2014)
Patrick Cousot, Radhia Cousot
Abstract interpretation: past, present and future. CSL-LICS (2014)
Julian Gutierrez, Michael J. Wooldridge
Equilibria of concurrent games on event structures. CSL-LICS (2014)
Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen
Zero-reachability in probabilistic multi-counter automata. CSL-LICS (2014)
Jörg Endrullis, Dimitri Hendriks
On periodically iterated morphisms. CSL-LICS (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Logical characterization of weighted pebble walking automata. CSL-LICS (2014)
Thomas Ehrhard
A new correctness criterion for MLL proof nets. CSL-LICS (2014)
Grgur Petric Maretic, Mohammad Torabi Dashti, David A. Basin
Anchored LTL separation. CSL-LICS (2014)
Pablo Barceló, Pablo Muñoz
Graph logics with rational relations: the role of word combinatorics. CSL-LICS (2014)
Anupam Das
On the pigeonhole and related principles in deep inference and monotone systems. CSL-LICS (2014)
Hubie Chen
The tractability frontier of graph-like first-order query sets. CSL-LICS (2014)
Julien Cretin, Didier Rémy
System F with coercion constraints. CSL-LICS (2014)
Nicolas Guenot, Lutz Straßburger
Symmetric normalisation for intuitionistic logic. CSL-LICS (2014)
Jérôme Leroux, M. Praveen, Grégoire Sutre
Hyper-Ackermannian bounds for pushdown vector addition systems. CSL-LICS (2014)
Beniamino Accattoli, Ugo Dal Lago
Beta reduction is invariant, indeed. CSL-LICS (2014)
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
Two-way cost automata and cost logics over infinite trees. CSL-LICS (2014)
Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev
On the succinctness of query rewriting over shallow ontologies. CSL-LICS (2014)
Katja Losemann, Wim Martens
MSO queries on trees: enumerating answers under updates. CSL-LICS (2014)
Willem Heijltjes, Robin Houston
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete. CSL-LICS (2014)
Rajeev Alur, Adam Freilich, Mukund Raghothaman
Regular combinators for string transformations. CSL-LICS (2014)
Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer
-calculus. CSL-LICS (2014)
Joost-Pieter Katoen, Lei Song, Lijun Zhang
Probably safe or live. CSL-LICS (2014)
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
Decidability of weak logics with deterministic transitive closure. CSL-LICS (2014)
Rasmus Ejlers Møgelberg
A type theory for productive coprogramming via guarded recursion. CSL-LICS (2014)
Christel Baier, Joachim Klein, Sascha Klüppelholz, Sascha Wunderlich
Weight monitoring with linear temporal logic: complexity and decidability. CSL-LICS (2014)
Christoph Haase
Subclasses of presburger arithmetic and the weak EXP hierarchy. CSL-LICS (2014)
Marcello Mamino
On the computing power of +, -, and ×. CSL-LICS (2014)
Diego Figueira, Leonid Libkin
Pattern logics and auxiliary relations. CSL-LICS (2014)
Matthew Fredrikson, Somesh Jha
Satisfiability modulo counting: a new approach for analyzing privacy properties. CSL-LICS (2014)
Taolue Chen, Stefan Kiefer
On the total variation distance of labelled Markov chains. CSL-LICS (2014)
Ranko Lazic, Sylvain Schmitz
Non-elementary complexities for branching VASS, MELL, and extensions. CSL-LICS (2014)