LIPIcs, Volume 139
CALCO 2019, June 3-6, 2019, London, United Kingdom
Editors: Markus Roggenbach and Ana Sokolova
Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva, and Fabio Zanasi. A Categorical Approach to DIBI Models. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gu_et_al:LIPIcs.FSCD.2024.17, author = {Gu, Tao and Bao, Jialu and Hsu, Justin and Silva, Alexandra and Zanasi, Fabio}, title = {{A Categorical Approach to DIBI Models}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {17:1--17:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.17}, URN = {urn:nbn:de:0030-drops-203469}, doi = {10.4230/LIPIcs.FSCD.2024.17}, annote = {Keywords: Conditional Independence, Dependence Independence Bunched Implications, String Diagrams, Markov Categories} }
Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
Kostia Chardonnet, Louis Lemonnier, and Benoît Valiron. Semantics for a Turing-Complete Reversible Programming Language with Inductive Types. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 19:1-19:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chardonnet_et_al:LIPIcs.FSCD.2024.19, author = {Chardonnet, Kostia and Lemonnier, Louis and Valiron, Beno\^{i}t}, title = {{Semantics for a Turing-Complete Reversible Programming Language with Inductive Types}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {19:1--19:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.19}, URN = {urn:nbn:de:0030-drops-203487}, doi = {10.4230/LIPIcs.FSCD.2024.19}, annote = {Keywords: Reversible programming, functional programming, Computability, Denotational Semantics} }
Published in: LIPIcs, Volume 298, 36th Euromicro Conference on Real-Time Systems (ECRTS 2024)
Francesco Paladino, Alessandro Biondi, Enrico Bini, and Paolo Pazzaglia. Optimizing Per-Core Priorities to Minimize End-To-End Latencies. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 298, pp. 6:1-6:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{paladino_et_al:LIPIcs.ECRTS.2024.6, author = {Paladino, Francesco and Biondi, Alessandro and Bini, Enrico and Pazzaglia, Paolo}, title = {{Optimizing Per-Core Priorities to Minimize End-To-End Latencies}}, booktitle = {36th Euromicro Conference on Real-Time Systems (ECRTS 2024)}, pages = {6:1--6:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-324-9}, ISSN = {1868-8969}, year = {2024}, volume = {298}, editor = {Pellizzoni, Rodolfo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2024.6}, URN = {urn:nbn:de:0030-drops-203094}, doi = {10.4230/LIPIcs.ECRTS.2024.6}, annote = {Keywords: Cause-Effect Chains, Logical Execution Time, End-to-End Latency, Design Optimization, Task Priorities, Data Age, Reaction Time} }
Published in: Dagstuhl Reports, Volume 12, Issue 12 (2023)
Hagit Attiya, Constantin Enea, Sergio Rajsbaum, and Ana Sokolova. Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492). In Dagstuhl Reports, Volume 12, Issue 12, pp. 27-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{attiya_et_al:DagRep.12.12.27, author = {Attiya, Hagit and Enea, Constantin and Rajsbaum, Sergio and Sokolova, Ana}, title = {{Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492)}}, pages = {27--53}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {12}, number = {12}, editor = {Attiya, Hagit and Enea, Constantin and Rajsbaum, Sergio and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.12.27}, URN = {urn:nbn:de:0030-drops-178452}, doi = {10.4230/DagRep.12.12.27}, annote = {Keywords: automated verification and reasoning, concurrent data structures and transactions, distributed algorithms, large-scale replication} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, and Davide Sangiorgi. CONCUR Test-Of-Time Award 2022 (Invited Paper). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 1:1-1:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{castellani_et_al:LIPIcs.CONCUR.2022.1, author = {Castellani, Ilaria and Gastin, Paul and Kupferman, Orna and Randour, Mickael and Sangiorgi, Davide}, title = {{CONCUR Test-Of-Time Award 2022}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {1:1--1:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.1}, URN = {urn:nbn:de:0030-drops-170644}, doi = {10.4230/LIPIcs.CONCUR.2022.1}, annote = {Keywords: CONCUR Test-of-Time Award} }
Published in: LIPIcs, Volume 211, 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
Filippo Bonchi, Ana Sokolova, and Valeria Vignudelli. Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases ((Co)algebraic pearls). In 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 211, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bonchi_et_al:LIPIcs.CALCO.2021.11, author = {Bonchi, Filippo and Sokolova, Ana and Vignudelli, Valeria}, title = {{Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases}}, booktitle = {9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-212-9}, ISSN = {1868-8969}, year = {2021}, volume = {211}, editor = {Gadducci, Fabio and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2021.11}, URN = {urn:nbn:de:0030-drops-153666}, doi = {10.4230/LIPIcs.CALCO.2021.11}, annote = {Keywords: Convex sets of distributions monad, Convex semilattices, Unique base} }
Published in: LIPIcs, Volume 211, 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)
Ana Sokolova and Harald Woracek. Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively ((Co)algebraic pearls). In 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 211, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sokolova_et_al:LIPIcs.CALCO.2021.23, author = {Sokolova, Ana and Woracek, Harald}, title = {{Nawrotzki’s Algorithm for the Countable Splitting Lemma, Constructively}}, booktitle = {9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-212-9}, ISSN = {1868-8969}, year = {2021}, volume = {211}, editor = {Gadducci, Fabio and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2021.23}, URN = {urn:nbn:de:0030-drops-153781}, doi = {10.4230/LIPIcs.CALCO.2021.23}, annote = {Keywords: countable splitting lemma, distributions with given marginals, couplings} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Proceedings{roggenbach_et_al:LIPIcs.CALCO.2019, title = {{LIPIcs, Volume 139, CALCO'19, Complete Volume}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019}, URN = {urn:nbn:de:0030-drops-115619}, doi = {10.4230/LIPIcs.CALCO.2019}, annote = {Keywords: Theory of computation, Models of computation; Modal and temporal logics; Algebraic semantics; Categorical semantics, Quantum computation theory; Software and its engineering, Specification languages} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{roggenbach_et_al:LIPIcs.CALCO.2019.0, author = {Roggenbach, Markus and Sokolova, Ana}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {0:i--0:x}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.0}, URN = {urn:nbn:de:0030-drops-114282}, doi = {10.4230/LIPIcs.CALCO.2019.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Xiaohong Chen and Grigore Roşu. Matching mu-Logic: Foundation of K Framework (Invited Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.CALCO.2019.1, author = {Chen, Xiaohong and Ro\c{s}u, Grigore}, title = {{Matching mu-Logic: Foundation of K Framework}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {1:1--1:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.1}, URN = {urn:nbn:de:0030-drops-114296}, doi = {10.4230/LIPIcs.CALCO.2019.1}, annote = {Keywords: Matching mu-logic, Program verification, Reachability logic} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Stefan Milius. From Equational Specifications of Algebras with Structure to Varieties of Data Languages (Invited Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 2:1-2:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{milius:LIPIcs.CALCO.2019.2, author = {Milius, Stefan}, title = {{From Equational Specifications of Algebras with Structure to Varieties of Data Languages}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {2:1--2:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.2}, URN = {urn:nbn:de:0030-drops-114309}, doi = {10.4230/LIPIcs.CALCO.2019.2}, annote = {Keywords: Birkhoff theorem, Equational logic, Eilenberg theorem, Data languages} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Mehrnoosh Sadrzadeh. Principles of Natural Language, Logic, and Tensor Semantics (Invited Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 3:1-3:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sadrzadeh:LIPIcs.CALCO.2019.3, author = {Sadrzadeh, Mehrnoosh}, title = {{Principles of Natural Language, Logic, and Tensor Semantics}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {3:1--3:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.3}, URN = {urn:nbn:de:0030-drops-114312}, doi = {10.4230/LIPIcs.CALCO.2019.3}, annote = {Keywords: Residuated Monoids, Vector Space Semantics, Corpora of Textual Data, Sentence Similarity and Disambiguation} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Damien Pous. Coinduction: Automata, Formal Proof, Companions (Invited Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 4:1-4:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{pous:LIPIcs.CALCO.2019.4, author = {Pous, Damien}, title = {{Coinduction: Automata, Formal Proof, Companions}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {4:1--4:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.4}, URN = {urn:nbn:de:0030-drops-114323}, doi = {10.4230/LIPIcs.CALCO.2019.4}, annote = {Keywords: Coinduction, Automata, Coalgebra, Formal proofs} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Vincenzo Ciancia and Yde Venema. Omega-Automata: A Coalgebraic Perspective on Regular omega-Languages. In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ciancia_et_al:LIPIcs.CALCO.2019.5, author = {Ciancia, Vincenzo and Venema, Yde}, title = {{Omega-Automata: A Coalgebraic Perspective on Regular omega-Languages}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Roggenbach, Markus and Sokolova, Ana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.5}, URN = {urn:nbn:de:0030-drops-114338}, doi = {10.4230/LIPIcs.CALCO.2019.5}, annote = {Keywords: omega-automata, regular omega-languages, coalgebra, streams, bisimilarity} }
Feedback for Dagstuhl Publishing