Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Astrid Belder, Bas Luttik, and Jos Baeten. Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 11:1-11:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{belder_et_al:LIPIcs.CALCO.2019.11, author = {Belder, Astrid and Luttik, Bas and Baeten, Jos}, title = {{Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {11:1--11:22}, 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.11}, URN = {urn:nbn:de:0030-drops-114390}, doi = {10.4230/LIPIcs.CALCO.2019.11}, annote = {Keywords: Sequencing, Sequential composition, Bisimilarity, Axiomatisation, Decidability} }
Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Paweł Sobociński, Paul W. Wilson, and Fabio Zanasi. CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 20:1-20:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sobocinski_et_al:LIPIcs.CALCO.2019.20, author = {Soboci\'{n}ski, Pawe{\l} and Wilson, Paul W. and Zanasi, Fabio}, title = {{CARTOGRAPHER: A Tool for String Diagrammatic Reasoning}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {20:1--20:7}, 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.20}, URN = {urn:nbn:de:0030-drops-114482}, doi = {10.4230/LIPIcs.CALCO.2019.20}, annote = {Keywords: tool, string diagram, symmetric monoidal category, graphical reasoning} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Raven Beutner, Bernd Finkbeiner, and Jesko Hecking-Harbusch. Translating Asynchronous Games for Distributed Synthesis. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{beutner_et_al:LIPIcs.CONCUR.2019.26, author = {Beutner, Raven and Finkbeiner, Bernd and Hecking-Harbusch, Jesko}, title = {{Translating Asynchronous Games for Distributed Synthesis}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.26}, URN = {urn:nbn:de:0030-drops-109289}, doi = {10.4230/LIPIcs.CONCUR.2019.26}, annote = {Keywords: synthesis, distributed systems, causal memory, Petri games, control games} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, and Fabio Zanasi. Bialgebraic Semantics for String Diagrams. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2019.37, author = {Bonchi, Filippo and Piedeleu, Robin and Sobocinski, Pawel and Zanasi, Fabio}, title = {{Bialgebraic Semantics for String Diagrams}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.37}, URN = {urn:nbn:de:0030-drops-109398}, doi = {10.4230/LIPIcs.CONCUR.2019.37}, annote = {Keywords: String Diagram, Structural Operational Semantics, Bialgebraic semantics} }
Published in: LIPIcs, Volume 35, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Ionut Tutu and José Luiz Fiadeiro. Revisiting the Institutional Approach to Herbrand’s Theorem. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 304-319, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{tutu_et_al:LIPIcs.CALCO.2015.304, author = {Tutu, Ionut and Fiadeiro, Jos\'{e} Luiz}, title = {{Revisiting the Institutional Approach to Herbrand’s Theorem}}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)}, pages = {304--319}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-84-2}, ISSN = {1868-8969}, year = {2015}, volume = {35}, editor = {Moss, Lawrence S. and Sobocinski, Pawel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2015.304}, URN = {urn:nbn:de:0030-drops-55419}, doi = {10.4230/LIPIcs.CALCO.2015.304}, annote = {Keywords: Institution theory, Substitution systems, Herbrand’s theorem} }
Published in: LIPIcs, Volume 35, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Stefan Milius and Thorsten Wißmann. Finitary Corecursion for the Infinitary Lambda Calculus. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 336-351, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{milius_et_al:LIPIcs.CALCO.2015.336, author = {Milius, Stefan and Wi{\ss}mann, Thorsten}, title = {{Finitary Corecursion for the Infinitary Lambda Calculus}}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)}, pages = {336--351}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-84-2}, ISSN = {1868-8969}, year = {2015}, volume = {35}, editor = {Moss, Lawrence S. and Sobocinski, Pawel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2015.336}, URN = {urn:nbn:de:0030-drops-55436}, doi = {10.4230/LIPIcs.CALCO.2015.336}, annote = {Keywords: rational trees, infinitary lambda calculus, coinduction} }
Published in: LIPIcs, Volume 35, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Clovis Eberhart, Tom Hirschowitz, and Thomas Seiller. An Intensionally Fully-abstract Sheaf Model for pi. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 86-100, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{eberhart_et_al:LIPIcs.CALCO.2015.86, author = {Eberhart, Clovis and Hirschowitz, Tom and Seiller, Thomas}, title = {{An Intensionally Fully-abstract Sheaf Model for pi}}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)}, pages = {86--100}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-84-2}, ISSN = {1868-8969}, year = {2015}, volume = {35}, editor = {Moss, Lawrence S. and Sobocinski, Pawel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2015.86}, URN = {urn:nbn:de:0030-drops-55284}, doi = {10.4230/LIPIcs.CALCO.2015.86}, annote = {Keywords: concurrency, sheaves, causal models, games} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Karoliina Lehtinen and Sandra Quickert. Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 457-471, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lehtinen_et_al:LIPIcs.CSL.2015.457, author = {Lehtinen, Karoliina and Quickert, Sandra}, title = {{Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {457--471}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.457}, URN = {urn:nbn:de:0030-drops-54316}, doi = {10.4230/LIPIcs.CSL.2015.457}, annote = {Keywords: modal mu calculus, fixpoint logic, alternation hierarchy} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Charles Grellois and Paul-André Melliès. Relational Semantics of Linear Logic and Higher-order Model Checking. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 260-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{grellois_et_al:LIPIcs.CSL.2015.260, author = {Grellois, Charles and Melli\`{e}s, Paul-Andr\'{e}}, title = {{Relational Semantics of Linear Logic and Higher-order Model Checking}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {260--276}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.260}, URN = {urn:nbn:de:0030-drops-54190}, doi = {10.4230/LIPIcs.CSL.2015.260}, annote = {Keywords: Higher-order model-checking, linear logic, relational semantics, parity games, parametric comonads.} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Matthias Baaz and Christian G. Fermüller. Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 94-109, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{baaz_et_al:LIPIcs.CSL.2015.94, author = {Baaz, Matthias and Ferm\"{u}ller, Christian G.}, title = {{Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {94--109}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.94}, URN = {urn:nbn:de:0030-drops-54097}, doi = {10.4230/LIPIcs.CSL.2015.94}, annote = {Keywords: Cut-elimination, sequent calculus, intuitionistic logic} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
David Baelde, Stéphanie Delaune, and Lucca Hirschi. Partial Order Reduction for Security Protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 497-510, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{baelde_et_al:LIPIcs.CONCUR.2015.497, author = {Baelde, David and Delaune, St\'{e}phanie and Hirschi, Lucca}, title = {{Partial Order Reduction for Security Protocols}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {497--510}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.497}, URN = {urn:nbn:de:0030-drops-53946}, doi = {10.4230/LIPIcs.CONCUR.2015.497}, annote = {Keywords: Cryptographic protocols, verification, process algebra, trace equivalence} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, and Tjark Weber. Modal Logics for Nominal Transition Systems. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 198-211, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{parrow_et_al:LIPIcs.CONCUR.2015.198, author = {Parrow, Joachim and Borgstr\"{o}m, Johannes and Eriksson, Lars-Henrik and Gutkovas, Ramunas and Weber, Tjark}, title = {{Modal Logics for Nominal Transition Systems}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {198--211}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.198}, URN = {urn:nbn:de:0030-drops-53823}, doi = {10.4230/LIPIcs.CONCUR.2015.198}, annote = {Keywords: Process algebra, nominal sets, bisimulation, modal logic} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Andrea Cerone, Giovanni Bernardi, and Alexey Gotsman. A Framework for Transactional Consistency Models with Atomic Visibility. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 58-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cerone_et_al:LIPIcs.CONCUR.2015.58, author = {Cerone, Andrea and Bernardi, Giovanni and Gotsman, Alexey}, title = {{A Framework for Transactional Consistency Models with Atomic Visibility}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {58--71}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.58}, URN = {urn:nbn:de:0030-drops-53756}, doi = {10.4230/LIPIcs.CONCUR.2015.58}, annote = {Keywords: Replication, Consistency models, Transactions} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing. 05081 Abstracts Collection – Foundations of Global Computing. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{fiadeiro_et_al:DagSemProc.05081.1, author = {Fiadeiro, Jos\'{e} Luiz and Montanari, Ugo and Wirsing, Martin}, title = {{05081 Abstracts Collection – Foundations of Global Computing}}, booktitle = {Foundations of Global Computing}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.1}, URN = {urn:nbn:de:0030-drops-4590}, doi = {10.4230/DagSemProc.05081.1}, annote = {Keywords: Global Computing} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
Cristóvão Oliveira and Michel Wermelinger. Architectural Views for CommUnity. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{oliveira_et_al:DagSemProc.05081.2, author = {Oliveira, Crist\'{o}v\~{a}o and Wermelinger, Michel}, title = {{Architectural Views for CommUnity}}, booktitle = {Foundations of Global Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.2}, URN = {urn:nbn:de:0030-drops-2967}, doi = {10.4230/DagSemProc.05081.2}, annote = {Keywords: Software Architecture, views, computation, coordination, distribution} }
Feedback for Dagstuhl Publishing