LIPIcs, Volume 85
CONCUR 2017, September 5-8, 2017, Berlin, Germany
Editors: Roland Meyer and Uwe Nestmann
Published in: OASIcs, Volume 84, 2nd Workshop on Formal Methods for Blockchains (FMBC 2020)
Florian Kammüller and Uwe Nestmann. Inter-Blockchain Protocols with the Isabelle Infrastructure Framework. In 2nd Workshop on Formal Methods for Blockchains (FMBC 2020). Open Access Series in Informatics (OASIcs), Volume 84, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kammuller_et_al:OASIcs.FMBC.2020.11, author = {Kamm\"{u}ller, Florian and Nestmann, Uwe}, title = {{Inter-Blockchain Protocols with the Isabelle Infrastructure Framework}}, booktitle = {2nd Workshop on Formal Methods for Blockchains (FMBC 2020)}, pages = {11:1--11:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-169-6}, ISSN = {2190-6807}, year = {2020}, volume = {84}, editor = {Bernardo, Bruno and Marmsoler, Diego}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2020.11}, URN = {urn:nbn:de:0030-drops-134249}, doi = {10.4230/OASIcs.FMBC.2020.11}, annote = {Keywords: Blockchain, smart contracts, interactive theorem proving, inter-blockchain protocols} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{meyer_et_al:LIPIcs.CONCUR.2017, title = {{LIPIcs, Volume 85, CONCUR'17, Complete Volume}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, 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}, URN = {urn:nbn:de:0030-drops-79070}, doi = {10.4230/LIPIcs.CONCUR.2017}, annote = {Keywords: Software, Data, Theory of Computation} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{meyer_et_al:LIPIcs.CONCUR.2017.0, author = {Meyer, Roland and Nestmann, Uwe}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {0:i--0:xx}, 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.0}, URN = {urn:nbn:de:0030-drops-77693}, doi = {10.4230/LIPIcs.CONCUR.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, and John Wickerson. Forward Progress on GPU Concurrency (Invited Talk). In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 1:1-1:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{donaldson_et_al:LIPIcs.CONCUR.2017.1, author = {Donaldson, Alastair F. and Ketema, Jeroen and Sorensen, Tyler and Wickerson, John}, title = {{Forward Progress on GPU Concurrency}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {1:1--1:13}, 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.1}, URN = {urn:nbn:de:0030-drops-78055}, doi = {10.4230/LIPIcs.CONCUR.2017.1}, annote = {Keywords: GPUs, concurrency, formal verification, memory models, data races} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Romain Brenguier, Arno Pauly, Jean-François Raskin, and Ocan Sankur. Admissibility in Games with Imperfect Information (Invited Talk). In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 2:1-2:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{brenguier_et_al:LIPIcs.CONCUR.2017.2, author = {Brenguier, Romain and Pauly, Arno and Raskin, Jean-Fran\c{c}ois and Sankur, Ocan}, title = {{Admissibility in Games with Imperfect Information}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {2:1--2:23}, 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.2}, URN = {urn:nbn:de:0030-drops-78066}, doi = {10.4230/LIPIcs.CONCUR.2017.2}, annote = {Keywords: Admissibility, non-zero sum games, reactive synthesis, imperfect infor- mation} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Hongseok Yang. Probabilistic Programming (Invited Talk). In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{yang:LIPIcs.CONCUR.2017.3, author = {Yang, Hongseok}, title = {{Probabilistic Programming}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {3:1--3:1}, 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.3}, URN = {urn:nbn:de:0030-drops-78088}, doi = {10.4230/LIPIcs.CONCUR.2017.3}, annote = {Keywords: Probabilistic programming, Machine learning, Denotational semantics} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Azadeh Farzan and Zachary Kincaid. A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 4:1-4:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{farzan_et_al:LIPIcs.CONCUR.2017.4, author = {Farzan, Azadeh and Kincaid, Zachary}, title = {{A New Notion of Compositionality for Concurrent Program Proofs}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {4:1--4:11}, 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.4}, URN = {urn:nbn:de:0030-drops-78097}, doi = {10.4230/LIPIcs.CONCUR.2017.4}, annote = {Keywords: Concurrency, Proofs, Dynamic Memory, Recursion} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Bidirectional Nested Weighted Automata. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2017.5, author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan}, title = {{Bidirectional Nested Weighted Automata}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {5:1--5:16}, 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.5}, URN = {urn:nbn:de:0030-drops-77763}, doi = {10.4230/LIPIcs.CONCUR.2017.5}, annote = {Keywords: weighted automata, nested weighted automata, complexity, bidirectional} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Uli Schlachter and Harro Wimmel. k-Bounded Petri Net Synthesis from Modal Transition Systems. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{schlachter_et_al:LIPIcs.CONCUR.2017.6, author = {Schlachter, Uli and Wimmel, Harro}, title = {{k-Bounded Petri Net Synthesis from Modal Transition Systems}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {6:1--6:15}, 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.6}, URN = {urn:nbn:de:0030-drops-77802}, doi = {10.4230/LIPIcs.CONCUR.2017.6}, annote = {Keywords: Modal transition system, bounded Petri net, synthesis} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Ki Yung Ahn, Ross Horne, and Alwen Tiu. A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ahn_et_al:LIPIcs.CONCUR.2017.7, author = {Ahn, Ki Yung and Horne, Ross and Tiu, Alwen}, title = {{A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {7:1--7:17}, 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.7}, URN = {urn:nbn:de:0030-drops-77899}, doi = {10.4230/LIPIcs.CONCUR.2017.7}, annote = {Keywords: bisimulation, modal logic, intuitionistic logic} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Adrian Francalanza. Consistently-Detecting Monitors. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{francalanza:LIPIcs.CONCUR.2017.8, author = {Francalanza, Adrian}, title = {{Consistently-Detecting Monitors}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {8:1--8:19}, 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.8}, URN = {urn:nbn:de:0030-drops-77722}, doi = {10.4230/LIPIcs.CONCUR.2017.8}, annote = {Keywords: Runtime Monitoring, Deterministic Behaviour, Controllability, Compositional Reasoning, Symbolic Analysis} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Orna Kupferman and Gal Vardi. Flow Logic. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kupferman_et_al:LIPIcs.CONCUR.2017.9, author = {Kupferman, Orna and Vardi, Gal}, title = {{Flow Logic}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {9:1--9: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.9}, URN = {urn:nbn:de:0030-drops-77796}, doi = {10.4230/LIPIcs.CONCUR.2017.9}, annote = {Keywords: Flow Network, Temporal Logic} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, and Yolanda Ortega-Mallén. Rule Formats for Nominal Process Calculi. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2017.10, author = {Aceto, Luca and F\'{a}bregas, Ignacio and Garc{\'\i}a-P\'{e}rez, \'{A}lvaro and Ing\'{o}lfsd\'{o}ttir, Anna and Ortega-Mall\'{e}n, Yolanda}, title = {{Rule Formats for Nominal Process Calculi}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {10:1--10:16}, 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.10}, URN = {urn:nbn:de:0030-drops-77869}, doi = {10.4230/LIPIcs.CONCUR.2017.10}, annote = {Keywords: nominal sets, nominal structural operational semantics, process algebra, nominal transition systems, scope opening, rule formats} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Adrien Durier, Daniel Hirschkoff, and Davide Sangiorgi. Divergence and Unique Solution of Equations. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{durier_et_al:LIPIcs.CONCUR.2017.11, author = {Durier, Adrien and Hirschkoff, Daniel and Sangiorgi, Davide}, title = {{Divergence and Unique Solution of Equations}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {11:1--11:16}, 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.11}, URN = {urn:nbn:de:0030-drops-77849}, doi = {10.4230/LIPIcs.CONCUR.2017.11}, annote = {Keywords: Bisimilarity, unique solution of equations, termination, process calculi} }
Feedback for Dagstuhl Publishing