Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, and David Purser. The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 41:1-41:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2020.41, author = {Chistikov, Dmitry and Kiefer, Stefan and Murawski, Andrzej S. and Purser, David}, title = {{The Big-O Problem for Labelled Markov Chains and Weighted Automata}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {41:1--41:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.41}, URN = {urn:nbn:de:0030-drops-128534}, doi = {10.4230/LIPIcs.CONCUR.2020.41}, annote = {Keywords: weighted automata, labelled Markov chains, probabilistic systems} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Pierre Clairambault and Andrzej S. Murawski. On the Expressivity of Linear Recursion Schemes. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{clairambault_et_al:LIPIcs.MFCS.2019.50, author = {Clairambault, Pierre and Murawski, Andrzej S.}, title = {{On the Expressivity of Linear Recursion Schemes}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {50:1--50:14}, 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.50}, URN = {urn:nbn:de:0030-drops-109945}, doi = {10.4230/LIPIcs.MFCS.2019.50}, annote = {Keywords: higher-order recursion schemes, linear logic, game semantics, geometry of interaction} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Dmitry Chistikov, Andrzej S. Murawski, and David Purser. Asymmetric Distances for Approximate Differential Privacy. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2019.10, author = {Chistikov, Dmitry and Murawski, Andrzej S. and Purser, David}, title = {{Asymmetric Distances for Approximate Differential Privacy}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {10:1--10: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.10}, URN = {urn:nbn:de:0030-drops-109121}, doi = {10.4230/LIPIcs.CONCUR.2019.10}, annote = {Keywords: Bisimilarity distances, Differential privacy, Labelled Markov chains} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos. Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 72:1-72:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{murawski_et_al:LIPIcs.MFCS.2018.72, author = {Murawski, Andrzej S. and Ramsay, Steven J. and Tzevelekos, Nikos}, title = {{Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {72:1--72:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.72}, URN = {urn:nbn:de:0030-drops-96544}, doi = {10.4230/LIPIcs.MFCS.2018.72}, annote = {Keywords: automata over infinite alphabets, language equivalence, bisimilarity, computational group theory} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Andrzej S. Murawski and Nikos Tzevelekos. Higher-Order Linearisability. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{murawski_et_al:LIPIcs.CONCUR.2017.34, author = {Murawski, Andrzej S. and Tzevelekos, Nikos}, title = {{Higher-Order Linearisability}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {34:1--34:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.34}, URN = {urn:nbn:de:0030-drops-78035}, doi = {10.4230/LIPIcs.CONCUR.2017.34}, annote = {Keywords: Linearisability, Concurrency, Higher-Order Computation} }
Published in: LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
Pierre Clairambault and Andrzej S. Murawski. Böhm Trees as Higher-Order Recursive Schemes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 91-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{clairambault_et_al:LIPIcs.FSTTCS.2013.91, author = {Clairambault, Pierre and Murawski, Andrzej S.}, title = {{B\"{o}hm Trees as Higher-Order Recursive Schemes}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {91--102}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.91}, URN = {urn:nbn:de:0030-drops-43644}, doi = {10.4230/LIPIcs.FSTTCS.2013.91}, annote = {Keywords: Lambda calculus, B\"{o}hm trees, Recursion Schemes} }
Published in: Dagstuhl Seminar Proceedings, Volume 10252, Game Semantics and Program Verification (2010)
Paul-Andre Mellies, Andrzej S. Murawski, Andrea Schalk, and Igor Walukiewicz. 10252 Abstracts Collection – Game Semantics and Program Verification. In Game Semantics and Program Verification. Dagstuhl Seminar Proceedings, Volume 10252, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{mellies_et_al:DagSemProc.10252.1, author = {Mellies, Paul-Andre and Murawski, Andrzej S. and Schalk, Andrea and Walukiewicz, Igor}, title = {{10252 Abstracts Collection – Game Semantics and Program Verification}}, booktitle = {Game Semantics and Program Verification}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10252}, editor = {Paul-Andre Mellies and Andrzej S. Murawski and Andrea Schalk and Igor Walukiewicz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10252.1}, URN = {urn:nbn:de:0030-drops-27945}, doi = {10.4230/DagSemProc.10252.1}, annote = {Keywords: Software verification, Semantics of programming languages, Game semantics, Static analysis, Model checking} }
Published in: Dagstuhl Seminar Proceedings, Volume 10252, Game Semantics and Program Verification (2010)
Paul-Andre Mellies, Andrzej S. Murawski, Andrea Schalk, and Igor Walukiewicz. 10252 Executive Summary – Game Semantics and Program Verification. In Game Semantics and Program Verification. Dagstuhl Seminar Proceedings, Volume 10252, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{mellies_et_al:DagSemProc.10252.2, author = {Mellies, Paul-Andre and Murawski, Andrzej S. and Schalk, Andrea and Walukiewicz, Igor}, title = {{10252 Executive Summary – Game Semantics and Program Verification}}, booktitle = {Game Semantics and Program Verification}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10252}, editor = {Paul-Andre Mellies and Andrzej S. Murawski and Andrea Schalk and Igor Walukiewicz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10252.2}, URN = {urn:nbn:de:0030-drops-27938}, doi = {10.4230/DagSemProc.10252.2}, annote = {Keywords: Software verification, Semantics of programming languages, Game semantics, Static analysis, Model checking} }
Feedback for Dagstuhl Publishing