LIPIcs, Volume 62
CSL 2016, August 29 to September 1, 2016, Marseille, France
Editors: Jean-Marc Talbot and Laurent Regnier
Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, and Jean-Marc Talbot. Weighted Automata and Expressions over Pre-Rational Monoids. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baudru_et_al:LIPIcs.CSL.2022.6, author = {Baudru, Nicolas and Dando, Louis-Marie and Lhote, Nathan and Monmege, Benjamin and Reynier, Pierre-Alain and Talbot, Jean-Marc}, title = {{Weighted Automata and Expressions over Pre-Rational Monoids}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.6}, URN = {urn:nbn:de:0030-drops-157266}, doi = {10.4230/LIPIcs.CSL.2022.6}, annote = {Keywords: Weighted Automata and Expressions, Inverse Monoids, Two-Way Automata} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Théodore Lopez, Benjamin Monmege, and Jean-Marc Talbot. Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lopez_et_al:LIPIcs.MFCS.2019.75, author = {Lopez, Th\'{e}odore and Monmege, Benjamin and Talbot, Jean-Marc}, title = {{Determinisation of Finitely-Ambiguous Copyless Cost Register Automata}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {75:1--75:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.75}, URN = {urn:nbn:de:0030-drops-110190}, doi = {10.4230/LIPIcs.MFCS.2019.75}, annote = {Keywords: Cost-register automata, Look-ahead removal, Unambiguity, Determinisation} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Proceedings{talbot_et_al:LIPIcs.CSL.2016, title = {{LIPIcs, Volume 62, CSL'16, Complete Volume}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016}, URN = {urn:nbn:de:0030-drops-66715}, doi = {10.4230/LIPIcs.CSL.2016}, annote = {Keywords: Conference Proceedings, Distributed Systems, Software/ Programs Verifications, Formal Definitions and Theory, Languages Constructs and Features, Knowledge Representations Formalisms and Methods, Theory of Computation, Mathematical Logic} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{talbot_et_al:LIPIcs.CSL.2016.0, author = {Talbot, Jean-Marc and Regnier, Laurent}, title = {{Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.0}, URN = {urn:nbn:de:0030-drops-65405}, doi = {10.4230/LIPIcs.CSL.2016.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Thierry Coquand and Anuj Dawar. The Ackermann Award 2016. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{coquand_et_al:LIPIcs.CSL.2016.1, author = {Coquand, Thierry and Dawar, Anuj}, title = {{The Ackermann Award 2016}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.1}, URN = {urn:nbn:de:0030-drops-65419}, doi = {10.4230/LIPIcs.CSL.2016.1}, annote = {Keywords: Ackermann Award, Computer Science, Logic} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Libor Barto. Infinite Domain Constraint Satisfaction Problem (Invited Talk). In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{barto:LIPIcs.CSL.2016.2, author = {Barto, Libor}, title = {{Infinite Domain Constraint Satisfaction Problem}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.2}, URN = {urn:nbn:de:0030-drops-65427}, doi = {10.4230/LIPIcs.CSL.2016.2}, annote = {Keywords: Descriptive complexity, Constraint Satisfaction Problem} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Anca Muscholl. Automated Synthesis: Going Distributed (Invited Talk). In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{muscholl:LIPIcs.CSL.2016.3, author = {Muscholl, Anca}, title = {{Automated Synthesis: Going Distributed}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {3:1--3:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.3}, URN = {urn:nbn:de:0030-drops-65436}, doi = {10.4230/LIPIcs.CSL.2016.3}, annote = {Keywords: Concurrent programs, Distributed synthesis, Runtime monitoring} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Agata Ciabattoni. Analytic Calculi for Non-Classical Logics: Theory and Applications (Invited Talk). In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, p. 4:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ciabattoni:LIPIcs.CSL.2016.4, author = {Ciabattoni, Agata}, title = {{Analytic Calculi for Non-Classical Logics: Theory and Applications}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {4:1--4:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.4}, URN = {urn:nbn:de:0030-drops-65440}, doi = {10.4230/LIPIcs.CSL.2016.4}, annote = {Keywords: Proof theory, Fuzzy logic} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Alexandra Silva. Coalgebraic Learning (Invited Talk). In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, p. 5:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{silva:LIPIcs.CSL.2016.5, author = {Silva, Alexandra}, title = {{Coalgebraic Learning}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {5:1--5:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.5}, URN = {urn:nbn:de:0030-drops-65455}, doi = {10.4230/LIPIcs.CSL.2016.5}, annote = {Keywords: Automata learning, coalgebraic techniques} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Hans Leiss. The Matrix Ring of a mu-Continuous Chomsky Algebra is mu-Continuous. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{leiss:LIPIcs.CSL.2016.6, author = {Leiss, Hans}, title = {{The Matrix Ring of a mu-Continuous Chomsky Algebra is mu-Continuous}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.6}, URN = {urn:nbn:de:0030-drops-65467}, doi = {10.4230/LIPIcs.CSL.2016.6}, annote = {Keywords: context-free language, fixed point operator, idempotent semiring, matrix ring, Chomsky algebra} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Sebastian Enqvist, Fatemeh Seifan, and Yde Venema. Completeness for Coalgebraic Fixpoint Logic. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 7:1-7:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{enqvist_et_al:LIPIcs.CSL.2016.7, author = {Enqvist, Sebastian and Seifan, Fatemeh and Venema, Yde}, title = {{Completeness for Coalgebraic Fixpoint Logic}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {7:1--7:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.7}, URN = {urn:nbn:de:0030-drops-65470}, doi = {10.4230/LIPIcs.CSL.2016.7}, annote = {Keywords: mu-calculus, coalgebra, coalgebraic modal logic, automata, completeness} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Akihisa Yamada, Christian Sternagel, René Thiemann, and Keiichirou Kusakari. AC Dependency Pairs Revisited. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{yamada_et_al:LIPIcs.CSL.2016.8, author = {Yamada, Akihisa and Sternagel, Christian and Thiemann, Ren\'{e} and Kusakari, Keiichirou}, title = {{AC Dependency Pairs Revisited}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.8}, URN = {urn:nbn:de:0030-drops-65488}, doi = {10.4230/LIPIcs.CSL.2016.8}, annote = {Keywords: Equational Rewriting, Termination, Dependency Pairs, Certification} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Jérémy Dubut, Eric Goubault, and Jean Goubault-Larrecq. The Directed Homotopy Hypothesis. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dubut_et_al:LIPIcs.CSL.2016.9, author = {Dubut, J\'{e}r\'{e}my and Goubault, Eric and Goubault-Larrecq, Jean}, title = {{The Directed Homotopy Hypothesis}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.9}, URN = {urn:nbn:de:0030-drops-65492}, doi = {10.4230/LIPIcs.CSL.2016.9}, annote = {Keywords: directed algebraic topology, partially enriched categories, homotopy hypothesis, geometric models for concurrency, higher category theory} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Paulo Tabuada and Daniel Neider. Robust Linear Temporal Logic. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{tabuada_et_al:LIPIcs.CSL.2016.10, author = {Tabuada, Paulo and Neider, Daniel}, title = {{Robust Linear Temporal Logic}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.10}, URN = {urn:nbn:de:0030-drops-65508}, doi = {10.4230/LIPIcs.CSL.2016.10}, annote = {Keywords: Linear Temporal Logic, Robustness} }
Feedback for Dagstuhl Publishing