LIPIcs, Volume 119
CSL 2018, September 4-7, 2018, Birmingham, GB
Editors: Dan R. Ghica and Achim Jung
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Dan Ghica and Achim Jung. LIPIcs, Volume 119, CSL'18, Complete Volume. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@Proceedings{ghica_et_al:LIPIcs.CSL.2018, title = {{LIPIcs, Volume 119, CSL'18, Complete Volume}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018}, URN = {urn:nbn:de:0030-drops-97444}, doi = {10.4230/LIPIcs.CSL.2018}, annote = {Keywords: Theory of computation, Software and its engineering, Formal language definitions, Formal software verification} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Dan R. Ghica and Achim Jung. Front Matter, Table of Contents, Preface, Conference Organization. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 0:i-0:xiv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ghica_et_al:LIPIcs.CSL.2018.0, author = {Ghica, Dan R. and Jung, Achim}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {0:i--0:xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.0}, URN = {urn:nbn:de:0030-drops-96679}, doi = {10.4230/LIPIcs.CSL.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Dexter Kozen and Thomas Schwentick. The Ackermann Award 2018. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 1:1-1:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kozen_et_al:LIPIcs.CSL.2018.1, author = {Kozen, Dexter and Schwentick, Thomas}, title = {{The Ackermann Award 2018}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {1:1--1:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.1}, URN = {urn:nbn:de:0030-drops-96686}, doi = {10.4230/LIPIcs.CSL.2018.1}, annote = {Keywords: Ackermann Award} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Samson Abramsky and Nihil Shah. Relating Structure and Power: Comonadic Semantics for Computational Resources. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 2:1-2:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abramsky_et_al:LIPIcs.CSL.2018.2, author = {Abramsky, Samson and Shah, Nihil}, title = {{Relating Structure and Power: Comonadic Semantics for Computational Resources}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.2}, URN = {urn:nbn:de:0030-drops-96698}, doi = {10.4230/LIPIcs.CSL.2018.2}, annote = {Keywords: Finite model theory, combinatorial games, Ehrenfeucht-Fra\"{i}ss\'{e} games, pebble games, bisimulation, comonads, coKleisli category, coalgebras of a comonad} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Faried Abu Zaid, Dietrich Kuske, and Peter Lindner. Climbing up the Elementary Complexity Classes with Theories of Automatic Structures. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 3:1-3:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{abuzaid_et_al:LIPIcs.CSL.2018.3, author = {Abu Zaid, Faried and Kuske, Dietrich and Lindner, Peter}, title = {{Climbing up the Elementary Complexity Classes with Theories of Automatic Structures}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.3}, URN = {urn:nbn:de:0030-drops-96701}, doi = {10.4230/LIPIcs.CSL.2018.3}, annote = {Keywords: Automatic Structures, Complexity Theory, Model Theory} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, and Marco Maggesi. High-Level Signatures and Initial Semantics. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 4:1-4:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahrens_et_al:LIPIcs.CSL.2018.4, author = {Ahrens, Benedikt and Hirschowitz, Andr\'{e} and Lafont, Ambroise and Maggesi, Marco}, title = {{High-Level Signatures and Initial Semantics}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {4:1--4:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.4}, URN = {urn:nbn:de:0030-drops-96713}, doi = {10.4230/LIPIcs.CSL.2018.4}, annote = {Keywords: initial semantics, signatures, syntax, monadic substitution, computer-checked proofs} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Aurore Alcolei, Pierre Clairambault, Martin Hyland, and Glynn Winskel. The True Concurrency of Herbrand's Theorem. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 5:1-5:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{alcolei_et_al:LIPIcs.CSL.2018.5, author = {Alcolei, Aurore and Clairambault, Pierre and Hyland, Martin and Winskel, Glynn}, title = {{The True Concurrency of Herbrand's Theorem}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {5:1--5:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.5}, URN = {urn:nbn:de:0030-drops-96723}, doi = {10.4230/LIPIcs.CSL.2018.5}, annote = {Keywords: Herbrand's theorem, Game semantics, True concurrency} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Carlo Angiuli, Kuen-Bang Hou (Favonia), and Robert Harper. Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 6:1-6:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{angiuli_et_al:LIPIcs.CSL.2018.6, author = {Angiuli, Carlo and Hou (Favonia), Kuen-Bang and Harper, Robert}, title = {{Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.6}, URN = {urn:nbn:de:0030-drops-96734}, doi = {10.4230/LIPIcs.CSL.2018.6}, annote = {Keywords: Homotopy Type Theory, Two-Level Type Theory, Computational Type Theory, Cubical Sets} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Albert Atserias and Anuj Dawar. Definable Inapproximability: New Challenges for Duplicator. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 7:1-7:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{atserias_et_al:LIPIcs.CSL.2018.7, author = {Atserias, Albert and Dawar, Anuj}, title = {{Definable Inapproximability: New Challenges for Duplicator}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.7}, URN = {urn:nbn:de:0030-drops-96742}, doi = {10.4230/LIPIcs.CSL.2018.7}, annote = {Keywords: Descriptive Compleixty, Hardness of Approximation, MAX SAT, Vertex Cover, Fixed-point logic with counting} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Arnon Avron, Shahar Lev, and Nissan Levi. Safety, Absoluteness, and Computability. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 8:1-8:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{avron_et_al:LIPIcs.CSL.2018.8, author = {Avron, Arnon and Lev, Shahar and Levi, Nissan}, title = {{Safety, Absoluteness, and Computability}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.8}, URN = {urn:nbn:de:0030-drops-96754}, doi = {10.4230/LIPIcs.CSL.2018.8}, annote = {Keywords: Dependent Safety, Computability, Absoluteness, Decidability, Domain Independence} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Patrick Baillot and Alexis Ghyselen. Combining Linear Logic and Size Types for Implicit Complexity. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 9:1-9:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{baillot_et_al:LIPIcs.CSL.2018.9, author = {Baillot, Patrick and Ghyselen, Alexis}, title = {{Combining Linear Logic and Size Types for Implicit Complexity}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.9}, URN = {urn:nbn:de:0030-drops-96763}, doi = {10.4230/LIPIcs.CSL.2018.9}, annote = {Keywords: Implicit computational complexity, lambda-calculus, linear logic, type systems, polynomial time complexity, size types} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, and Marie Van den Bogaard. Beyond Admissibility: Dominance Between Chains of Strategies. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 10:1-10:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{basset_et_al:LIPIcs.CSL.2018.10, author = {Basset, Nicolas and Jecker, Isma\"{e}l and Pauly, Arno and Raskin, Jean-Fran\c{c}ois and Van den Bogaard, Marie}, title = {{Beyond Admissibility: Dominance Between Chains of Strategies}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {10:1--10:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.10}, URN = {urn:nbn:de:0030-drops-96774}, doi = {10.4230/LIPIcs.CSL.2018.10}, annote = {Keywords: dominated strategies, admissible strategies, games played on finite graphs, reactive synthesis, reachability games, safety games, cofinal, order theory} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Nicolas Behr and Pawel Sobocinski. Rule Algebras for Adhesive Categories. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 11:1-11:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{behr_et_al:LIPIcs.CSL.2018.11, author = {Behr, Nicolas and Sobocinski, Pawel}, title = {{Rule Algebras for Adhesive Categories}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {11:1--11:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.11}, URN = {urn:nbn:de:0030-drops-96781}, doi = {10.4230/LIPIcs.CSL.2018.11}, annote = {Keywords: Adhesive categories, rule algebras, Double Pushout (DPO) rewriting} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Manuel Bodirsky, Marcello Mamino, and Caterina Viola. Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 12:1-12:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bodirsky_et_al:LIPIcs.CSL.2018.12, author = {Bodirsky, Manuel and Mamino, Marcello and Viola, Caterina}, title = {{Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.12}, URN = {urn:nbn:de:0030-drops-96792}, doi = {10.4230/LIPIcs.CSL.2018.12}, annote = {Keywords: Valued constraint satisfaction problems, Piecewise linear functions, Submodular functions, Semilinear, Constraint satisfaction, Optimisation, Model Theory} }
Feedback for Dagstuhl Publishing