Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Guillermo A. Pérez and Ritam Raha. Revisiting Parameter Synthesis for One-Counter Automata. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{perez_et_al:LIPIcs.CSL.2022.33, author = {P\'{e}rez, Guillermo A. and Raha, Ritam}, title = {{Revisiting Parameter Synthesis for One-Counter Automata}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {33:1--33:18}, 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.33}, URN = {urn:nbn:de:0030-drops-157534}, doi = {10.4230/LIPIcs.CSL.2022.33}, annote = {Keywords: Parametric one-counter automata, Reachability, Software Verification} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Michael Simpson, Venkatesh Srinivasan, and Alex Thomo. Reverse Prevention Sampling for Misinformation Mitigation in Social Networks. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{simpson_et_al:LIPIcs.ICDT.2020.24, author = {Simpson, Michael and Srinivasan, Venkatesh and Thomo, Alex}, title = {{Reverse Prevention Sampling for Misinformation Mitigation in Social Networks}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {24:1--24:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.24}, URN = {urn:nbn:de:0030-drops-119484}, doi = {10.4230/LIPIcs.ICDT.2020.24}, annote = {Keywords: Graph Algorithms, Social Networks, Misinformation Prevention} }
Published in: Dagstuhl Seminar Proceedings, Volume 6341, Computational Structures for Modelling Space, Time and Causality (2007)
Ingo Battenfeld, Matthias Schröder, and Alex Simpson. A convenient category of domains. In Computational Structures for Modelling Space, Time and Causality. Dagstuhl Seminar Proceedings, Volume 6341, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{battenfeld_et_al:DagSemProc.06341.2, author = {Battenfeld, Ingo and Schr\"{o}der, Matthias and Simpson, Alex}, title = {{A convenient category of domains}}, booktitle = {Computational Structures for Modelling Space, Time and Causality}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6341}, editor = {Ralph Kopperman and Prakash Panangaden and Michael B. Smyth and Dieter Spreen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06341.2}, URN = {urn:nbn:de:0030-drops-8945}, doi = {10.4230/DagSemProc.06341.2}, annote = {Keywords: Domain theory, topology of datatypes} }
Feedback for Dagstuhl Publishing