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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
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} }
Filippo Bonchi, Jens Seeber, and Pawel Sobocinski. Graphical Conjunctive Queries. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 13:1-13:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bonchi_et_al:LIPIcs.CSL.2018.13, author = {Bonchi, Filippo and Seeber, Jens and Sobocinski, Pawel}, title = {{Graphical Conjunctive Queries}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {13:1--13:23}, 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.13}, URN = {urn:nbn:de:0030-drops-96805}, doi = {10.4230/LIPIcs.CSL.2018.13}, annote = {Keywords: conjunctive query inclusion, string diagrams, cartesian bicategories} }
Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. Approximating Probabilistic Automata by Regular Languages. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 14:1-14:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chadha_et_al:LIPIcs.CSL.2018.14, author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh}, title = {{Approximating Probabilistic Automata by Regular Languages}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {14:1--14:23}, 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.14}, URN = {urn:nbn:de:0030-drops-96815}, doi = {10.4230/LIPIcs.CSL.2018.14}, annote = {Keywords: Probabilistic Finite Automata, Regular Languages, Ambiguity} }
Jules Chouquet and Lionel Vaux Auclair. An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chouquet_et_al:LIPIcs.CSL.2018.15, author = {Chouquet, Jules and Vaux Auclair, Lionel}, title = {{An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {15:1--15: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.15}, URN = {urn:nbn:de:0030-drops-96828}, doi = {10.4230/LIPIcs.CSL.2018.15}, annote = {Keywords: linear logic, proof nets, cut elimination, differential linear logic} }
Pierre Clairambault and Hugo Paquet. Fully Abstract Models of the Probabilistic lambda-calculus. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{clairambault_et_al:LIPIcs.CSL.2018.16, author = {Clairambault, Pierre and Paquet, Hugo}, title = {{Fully Abstract Models of the Probabilistic lambda-calculus}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {16:1--16: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.16}, URN = {urn:nbn:de:0030-drops-96835}, doi = {10.4230/LIPIcs.CSL.2018.16}, annote = {Keywords: Game Semantics, Lambda-calculus, Probabilistic programming, Relational model, Full abstraction} }
Liron Cohen and Reuben N. S. Rowe. Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cohen_et_al:LIPIcs.CSL.2018.17, author = {Cohen, Liron and Rowe, Reuben N. S.}, title = {{Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {17:1--17: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.17}, URN = {urn:nbn:de:0030-drops-96841}, doi = {10.4230/LIPIcs.CSL.2018.17}, annote = {Keywords: Induction, Transitive Closure, Infinitary Proof Systems, Cyclic Proof Systems, Soundness, Completeness, Standard Semantics, Henkin Semantics} }
Anupam Das and Isabel Oitavem. A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{das_et_al:LIPIcs.CSL.2018.18, author = {Das, Anupam and Oitavem, Isabel}, title = {{A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {18:1--18: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.18}, URN = {urn:nbn:de:0030-drops-96851}, doi = {10.4230/LIPIcs.CSL.2018.18}, annote = {Keywords: Monotone complexity, Positive complexity, Function classes, Function algebras, Recursion-theoretic characterisations, Implicit complexity, Logic} }
Anupam Das and Damien Pous. Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{das_et_al:LIPIcs.CSL.2018.19, author = {Das, Anupam and Pous, Damien}, title = {{Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {19:1--19:18}, 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.19}, URN = {urn:nbn:de:0030-drops-96869}, doi = {10.4230/LIPIcs.CSL.2018.19}, annote = {Keywords: Kleene algebra, proof theory, sequent system, non-wellfounded proofs} }
Anuj Dawar and Gregory Wilsenach. Symmetric Circuits for Rank Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dawar_et_al:LIPIcs.CSL.2018.20, author = {Dawar, Anuj and Wilsenach, Gregory}, title = {{Symmetric Circuits for Rank Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {20:1--20: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.20}, URN = {urn:nbn:de:0030-drops-96870}, doi = {10.4230/LIPIcs.CSL.2018.20}, annote = {Keywords: fixed-point logic with rank, circuits, symmetric circuits, uniform families of circuits, circuit characterization, circuit framework, finite model theory, descriptive complexity} }
Paul Downen and Zena M. Ariola. Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 21:1-21:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{downen_et_al:LIPIcs.CSL.2018.21, author = {Downen, Paul and Ariola, Zena M.}, title = {{Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {21:1--21:23}, 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.21}, URN = {urn:nbn:de:0030-drops-96886}, doi = {10.4230/LIPIcs.CSL.2018.21}, annote = {Keywords: call-by-need, polarity, call-by-push-value, control} }
Flavio Ferrarotti, Jan Van den Bussche, and Jonni Virtema. Expressivity Within Second-Order Transitive-Closure Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ferrarotti_et_al:LIPIcs.CSL.2018.22, author = {Ferrarotti, Flavio and Van den Bussche, Jan and Virtema, Jonni}, title = {{Expressivity Within Second-Order Transitive-Closure Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {22:1--22:18}, 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.22}, URN = {urn:nbn:de:0030-drops-96896}, doi = {10.4230/LIPIcs.CSL.2018.22}, annote = {Keywords: Expressive power, Higher order logics, Descriptive complexity} }
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin. Quantifying Bounds in Strategy Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 23:1-23:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fijalkow_et_al:LIPIcs.CSL.2018.23, author = {Fijalkow, Nathana\"{e}l and Maubert, Bastien and Murano, Aniello and Rubin, Sasha}, title = {{Quantifying Bounds in Strategy Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {23:1--23:23}, 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.23}, URN = {urn:nbn:de:0030-drops-96901}, doi = {10.4230/LIPIcs.CSL.2018.23}, annote = {Keywords: Prompt LTL, Strategy Logic, Model checking, Automata with counters} }
W. John Gowers and James D. Laird. A Fully Abstract Game Semantics for Countable Nondeterminism. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gowers_et_al:LIPIcs.CSL.2018.24, author = {Gowers, W. John and Laird, James D.}, title = {{A Fully Abstract Game Semantics for Countable Nondeterminism}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {24:1--24:18}, 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.24}, URN = {urn:nbn:de:0030-drops-96918}, doi = {10.4230/LIPIcs.CSL.2018.24}, annote = {Keywords: semantics, nondeterminism, games and logic} }
Erich Grädel and Matthias Hoelzel. Dependency Concepts up to Equivalence. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 25:1-25:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gradel_et_al:LIPIcs.CSL.2018.25, author = {Gr\"{a}del, Erich and Hoelzel, Matthias}, title = {{Dependency Concepts up to Equivalence}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {25:1--25: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.25}, URN = {urn:nbn:de:0030-drops-96921}, doi = {10.4230/LIPIcs.CSL.2018.25}, annote = {Keywords: Logics of dependence and independence, Team semantics, Existential second-order logic, Observational equivalence, Expressive power} }
Béatrice Bérard, Patricia Bouyer, and Vincent Jugé. Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{berard_et_al:LIPIcs.CSL.2018.26, author = {B\'{e}rard, B\'{e}atrice and Bouyer, Patricia and Jug\'{e}, Vincent}, title = {{Finite Bisimulations for Dynamical Systems with Overlapping Trajectories}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {26:1--26: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.26}, URN = {urn:nbn:de:0030-drops-96932}, doi = {10.4230/LIPIcs.CSL.2018.26}, annote = {Keywords: Reachability properties, dynamical systems, o-minimal structures, intersecting trajectories, finite bisimulations} }
Toru Kawata. A Contextual Reconstruction of Monadic Reflection. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kawata:LIPIcs.CSL.2018.27, author = {Kawata, Toru}, title = {{A Contextual Reconstruction of Monadic Reflection}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {27:1--27:14}, 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.27}, URN = {urn:nbn:de:0030-drops-96947}, doi = {10.4230/LIPIcs.CSL.2018.27}, annote = {Keywords: Monadic Reflection, Delimited Continuations, shift/reset, Contextual Modal Logic, Curry-Howard Isomorphism} }
Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, and Howard Straubing. An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{krebs_et_al:LIPIcs.CSL.2018.28, author = {Krebs, Andreas and Lodaya, Kamal and Pandya, Paritosh K. and Straubing, Howard}, title = {{An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {28:1--28: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.28}, URN = {urn:nbn:de:0030-drops-96953}, doi = {10.4230/LIPIcs.CSL.2018.28}, annote = {Keywords: two-variable logic, finite model theory, algebraic automata theory} }
Aliaume Lopez and Alex Simpson. Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lopez_et_al:LIPIcs.CSL.2018.29, author = {Lopez, Aliaume and Simpson, Alex}, title = {{Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {29:1--29: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.29}, URN = {urn:nbn:de:0030-drops-96965}, doi = {10.4230/LIPIcs.CSL.2018.29}, annote = {Keywords: contextual equivalence, algebraic effects, operational semantics, domain theory, nondeterminism, probabilistic choice, Markov decision process} }
Martin Lück. Canonical Models and the Complexity of Modal Team Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 30:1-30:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{luck:LIPIcs.CSL.2018.30, author = {L\"{u}ck, Martin}, title = {{Canonical Models and the Complexity of Modal Team Logic}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {30:1--30:23}, 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.30}, URN = {urn:nbn:de:0030-drops-96979}, doi = {10.4230/LIPIcs.CSL.2018.30}, annote = {Keywords: team semantics, modal logic, complexity, satisfiability} }
P. Madhusudan, Umang Mathur, Shambwaditya Saha, and Mahesh Viswanathan. A Decidable Fragment of Second Order Logic With Applications to Synthesis. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{madhusudan_et_al:LIPIcs.CSL.2018.31, author = {Madhusudan, P. and Mathur, Umang and Saha, Shambwaditya and Viswanathan, Mahesh}, title = {{A Decidable Fragment of Second Order Logic With Applications to Synthesis}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {31:1--31:19}, 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.31}, URN = {urn:nbn:de:0030-drops-96987}, doi = {10.4230/LIPIcs.CSL.2018.31}, annote = {Keywords: second order logic, synthesis, decidable fragment} }
Dan Marsden and Maaike Zwart. Quantitative Foundations for Resource Theories. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{marsden_et_al:LIPIcs.CSL.2018.32, author = {Marsden, Dan and Zwart, Maaike}, title = {{Quantitative Foundations for Resource Theories}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {32:1--32: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.32}, URN = {urn:nbn:de:0030-drops-96996}, doi = {10.4230/LIPIcs.CSL.2018.32}, annote = {Keywords: Resource Theory, Enriched Category, Profunctor, Monad, Combinatorial Species, Multicategory, Operad, Bimodule} }
Guy McCusker and Alessio Santamaria. On Compositionality of Dinatural Transformations. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 33:1-33:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mccusker_et_al:LIPIcs.CSL.2018.33, author = {McCusker, Guy and Santamaria, Alessio}, title = {{On Compositionality of Dinatural Transformations}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {33:1--33: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.33}, URN = {urn:nbn:de:0030-drops-97006}, doi = {10.4230/LIPIcs.CSL.2018.33}, annote = {Keywords: Dinatural transformation, categorical logic, compositionality} }
Daniel Neider, Alexander Weinert, and Martin Zimmermann. Synthesizing Optimally Resilient Controllers. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{neider_et_al:LIPIcs.CSL.2018.34, author = {Neider, Daniel and Weinert, Alexander and Zimmermann, Martin}, title = {{Synthesizing Optimally Resilient Controllers}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {34:1--34: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.34}, URN = {urn:nbn:de:0030-drops-97010}, doi = {10.4230/LIPIcs.CSL.2018.34}, annote = {Keywords: Controller Synthesis, Infinite Games, Resilient Strategies, Disturbances} }
Rémi Nollet, Alexis Saurin, and Christine Tasson. Local Validity for Circular Proofs in Linear Logic with Fixed Points. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 35:1-35:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{nollet_et_al:LIPIcs.CSL.2018.35, author = {Nollet, R\'{e}mi and Saurin, Alexis and Tasson, Christine}, title = {{Local Validity for Circular Proofs in Linear Logic with Fixed Points}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {35:1--35:23}, 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.35}, URN = {urn:nbn:de:0030-drops-97025}, doi = {10.4230/LIPIcs.CSL.2018.35}, annote = {Keywords: sequent calculus, non-wellfounded proofs, circular proofs, induction, coinduction, fixed points, proof-search, linear logic, muMALL, finitization, infinite descent} }
Sven Schewe, Alexander Weinert, and Martin Zimmermann. Parity Games with Weights. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{schewe_et_al:LIPIcs.CSL.2018.36, author = {Schewe, Sven and Weinert, Alexander and Zimmermann, Martin}, title = {{Parity Games with Weights}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {36:1--36: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.36}, URN = {urn:nbn:de:0030-drops-97037}, doi = {10.4230/LIPIcs.CSL.2018.36}, annote = {Keywords: Infinite Games, Quantitative Games, Parity Games} }
Kazushige Terui. MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 37:1-37:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{terui:LIPIcs.CSL.2018.37, author = {Terui, Kazushige}, title = {{MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {37:1--37:19}, 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.37}, URN = {urn:nbn:de:0030-drops-97049}, doi = {10.4230/LIPIcs.CSL.2018.37}, annote = {Keywords: Algebraic cut elimination, Parameter-free second order logic, MacNeille completion, Omega-rule} }