default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd LICS 2017: Reykjavik, Iceland
- 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017. IEEE Computer Society 2017, ISBN 978-1-5090-3018-7
- Joël Ouaknine:
LICS 2017 foreword. ii-iv - Thomas Colcombet:
Logic and regular cost functions. 1-4 - Corina S. Pasareanu:
Symbolic execution and probabilistic reasoning. 1 - Kousha Etessami:
Algorithms for some infinite-state MDPs and stochastic games. 1 - C.-H. Luke Ong:
Quantitative semantics of the lambda calculus: Some generalisations of the relational model. 1-12 - Piotr Hofman
, Jérôme Leroux, Patrick Totzke:
Linear combinations of unordered data vectors. 1-11 - Valentin Blot:
An interpretation of system F through bar recursion. 1-12 - Mathieu Hoyrup, Walid Gomaa:
On the extension of computable real functions. 1-12 - Michael Blondin, Christoph Haase:
Logics for continuous reachability in Petri nets and vector addition systems with states. 1-12 - Gérard Cécé:
Foundation for a series of efficient simulation algorithms. 1-12 - Thomas Place, Marc Zeitoun:
Separation for dot-depth two. 1-12 - Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel:
Foundational nonuniform (Co)datatypes for higher-order logic. 1-12 - Felix Canavoi, Martin Otto:
Common knowledge and multi-scale locality analysis in Cayley structures. 1-12 - Simone Bova, Fabio Mogavero:
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. 1-12 - Vincent Rahli, Mark Bickford, Robert L. Constable:
Bar induction: The good, the bad, and the ugly. 1-12 - Amina Doumane:
Constructive completeness for the linear-time μ-calculus. 1-12 - Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
Gödel logic: From natural deduction to parallel computation. 1-12 - Paul-André Melliès:
Higher-order parity automata. 1-12 - Bakh Khoussainov, Toru Takisaka:
Large scale geometries of infinite strings. 1-12 - Wojciech Czerwinski, Slawomir Lasota:
Regular separability of one counter automata. 1-12 - Martin Grohe, Martin Ritzert:
Learning first-order definable concepts over structures of small degree. 1-12 - Martin Grohe, Wied Pakusa:
Descriptive complexity of linear equation systems and applications to propositional proof complexity. 1-12 - Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa:
Definability of summation problems for Abelian groups and semigroups. 1-11 - Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
Timed pushdown automata and branching vector addition systems. 1-12 - Taichi Uemura:
Fibred fibration categories. 1-12 - Hubie Chen, Stefan Mengel:
The logic of counting query answers. 1-12 - Emmanuel Jeandel:
Enumeration reducibility in closure spaces with applications to logic and algebra. 1-11 - Johan Thapper, Stanislav Zivný:
The limits of SDP relaxations for general-valued CSPs. 1-12 - Bahareh Afshari, Graham E. Leigh:
Cut-free completeness for modal mu-calculus. 1-12 - G. A. Kavvos:
Dual-context calculi for modal logic. 1-12 - Christoph Haase, Stefan Kiefer, Markus Lohrey:
Computing quantiles in Markov chains with multi-dimensional costs. 1-12 - Matteo Mio, Robert Furber, Radu Mardare:
Riesz Modal logic for Markov processes. 1-12 - Marcin Jurdzinski, Ranko Lazic:
Succinct progress measures for solving parity games. 1-9 - Takeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong:
Generalised species of rigid resource terms. 1-12 - Marco Voigt:
A fine-grained hierarchy of hard problems in the separated fragment. 1-12 - Aleks Kissinger, Sander Uijlen:
A categorical semantics for causal structure. 1-12 - Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin:
On delay and regret determinization of max-plus automata. 1-12 - Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg:
The clocks are ticking: No more delays! 1-12 - Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting reachability in timed automata. 1-12 - Iddo Tzameret, Stephen A. Cook:
Uniform, integral and efficient proofs for the determinant identities. 1-12 - Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity objectives in countable MDPs. 1-11 - Michael Benedikt, Timothy Duff, Aditya Sharad, James Worrell:
Polynomial automata: Zeroness and applications. 1-12 - Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
On the axiomatizability of quantitative algebras. 1-12 - Pierre Vial:
Infinitary intersection types as sequences: A new answer to Klop's problem. 1-12 - André Hernich, Phokion G. Kolaitis:
Foundations of information integration under bag semantics. 1-12 - Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect half space games. 1-11 - Miguel Romero, Pablo Barceló, Moshe Y. Vardi:
The homomorphism problem for regular graph patterns. 1-12 - Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman dimension of planar graphs is at most 3. 1-12 - Anuj Dawar, Pengming Wang:
Definability of semidefinite programming and lasserre lower bounds for CSPs. 1-12 - Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. 1-12 - Dusko Pavlovic, Peter-Michael Seidel:
Quotients in monadic programming: Projective algebras are equivalent to coalgebras. 1-12 - Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu:
Register automata with linear arithmetic. 1-12 - Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu:
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens. 1-12 - Pierre-Marie Pédrot, Nicolas Tabareau:
An effectful way to eliminate addiction to dependence. 1-12 - Stefano Berardi, Makoto Tatsuta:
Equivalence of inductive definitions and cyclic proofs under arithmetic. 1-12 - Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. 1-11 - Michal Wrona:
The complexity of minimal inference problem for conservative constraint languages. 1-12 - Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy:
Effectful applicative bisimilarity: Monads, relators, and Howe's method. 1-12 - Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully abstract encodings of λ-calculus in HOcore through abstract machines. 1-12 - Venanzio Capretta, Jonathan Fowler:
The continuity of monadic stream functions. 1-12 - Martin Hofmann, Jérémy Ledent:
A cartesian-closed category for higher-order model checking. 1-12 - Florent Capelli:
Understanding the complexity of #SAT using knowledge compilation. 1-10 - Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
The primitivity of operators in the algebra of binary relations under conjunctions of containments. 1-10 - Berit Grußien:
Capturing polynomial time using Modular Decomposition. 1-12 - Eric Finster, Samuel Mimram:
A type-theoretical definition of weak ω-categories. 1-12 - Martin Zimmermann:
Games with costs and delays. 1-12 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Verification of randomized security protocols. 1-12 - Andrej Dudenhefner, Jakob Rehof:
Typability in bounded dimension. 1-12 - Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. 1-12 - Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in Finite Model Theory. 1-12 - Thierry Coquand, Bassel Mannaa, Fabian Ruch:
Stack semantics of type theory. 1-11 - Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
MDPs with energy-parity objectives. 1-12 - Yoshiki Nakamura:
Partial derivatives on graphs for Kleene allegories. 1-12 - Dietrich Kuske, Nicole Schweikardt:
First-order logic with counting. 1-12 - Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On strong determinacy of countable stochastic games. 1-12 - Paolo Baldan, Andrea Corradini, Fabio Gadducci:
Domains and event structures for fusions. 1-12 - Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy logic with imperfect information. 1-12 - Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A convenient category for higher-order probability theory. 1-12 - Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Untwisting two-way transducers in elementary time. 1-12 - Matthias Schröder, Florian Steinberg:
Bounded time computation on metric spaces and Banach spaces. 1-12 - Mai Gehrke, Daniela Petrisan, Luca Reggio:
Quantifiers on languages and codensity monads. 1-12 - Simon Halfon, Philippe Schnoebelen, Georg Zetzsche:
Decidability, complexity, and expressiveness of first-order logic over the subword ordering. 1-12 - Rob J. van Glabbeek:
Lean and full congruence formats for recursion. 1-11 - Abbas Edalat, Mehrdad Maleki:
Differentiation in logical form. 1-12 - Javier Esparza, Anca Muscholl, Igor Walukiewicz:
Static analysis of deterministic negotiations. 1-12 - Julien Cervelle, Grégory Lafitte:
On shift-invariant maximal filters and hormonal cellular automata. 1-10 - Ulrik Buchholtz, Egbert Rijke:
The real projective spaces in homotopy type theory. 1-8 - Krzysztof Bar, Jamie Vicary:
Data structures for quasistrict higher categories. 1-12 - Michaël Cadilhac, Charles Paperman:
A crevice on the Crane Beach: Finite-degree predicates. 1-9 - Andrei A. Bulatov:
Constraint satisfaction problems over semilattice block Mal'tsev algebras. 1-11 - Marcelo Arenas, Martin Muñoz, Cristian Riveros:
Descriptive Complexity for counting complexity classes. 1-12 - Natsuki Urabe, Masaki Hara, Ichiro Hasuo:
Categorical liveness checking by corecursive algebras. 1-12 - Robert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden:
Unrestricted stone duality for Markov processes. 1-9 - Benjamin Lucien Kaminski, Joost-Pieter Katoen:
A weakest pre-expectation semantics for mixed-sign expectations. 1-12
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-02-20 19:34 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:
