LIPIcs, Volume 171
CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)
Editors: Igor Konnov and Laura Kovács
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Laura Kovács. Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 4:1-4:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{kovacs:LIPIcs.MFCS.2023.4, author = {Kov\'{a}cs, Laura}, title = {{Algebraic Reasoning for (Un)Solvable Loops}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {4:1--4:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.4}, URN = {urn:nbn:de:0030-drops-185385}, doi = {10.4230/LIPIcs.MFCS.2023.4}, annote = {Keywords: Symbolic Computation, Formal Methods, Loop Analysis, Polynomial Invariants} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Igor Konnov and Laura Kovács. LIPIcs, Volume 171, CONCUR 2020, Complete Volume. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 1-984, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@Proceedings{konnov_et_al:LIPIcs.CONCUR.2020, title = {{LIPIcs, Volume 171, CONCUR 2020, Complete Volume}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {1--984}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020}, URN = {urn:nbn:de:0030-drops-128115}, doi = {10.4230/LIPIcs.CONCUR.2020}, annote = {Keywords: LIPIcs, Volume 171, CONCUR 2020, Complete Volume} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Igor Konnov and Laura Kovács. Front Matter, Table of Contents, Preface, Conference Organization. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 0:i-0:xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{konnov_et_al:LIPIcs.CONCUR.2020.0, author = {Konnov, Igor and Kov\'{a}cs, Laura}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {0:i--0:xvi}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.0}, URN = {urn:nbn:de:0030-drops-128125}, doi = {10.4230/LIPIcs.CONCUR.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
Luca Aceto, Jos Baeten, Patricia Bouyer-Decitre, Holger Hermanns, and Alexandra Silva. CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 5:1-5:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2020.5, author = {Aceto, Luca and Baeten, Jos and Bouyer-Decitre, Patricia and Hermanns, Holger and Silva, Alexandra}, title = {{CONCUR Test-Of-Time Award 2020 Announcement}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {5:1--5:3}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.5}, URN = {urn:nbn:de:0030-drops-128172}, doi = {10.4230/LIPIcs.CONCUR.2020.5}, annote = {Keywords: Concurrency, CONCUR Test-of-Time Award} }
Published in: LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1
Pascal Raymond, Claire Maiza, Catherine Parent-Vigouroux, Erwan Jahier, Nicolas Halbwachs, Fabienne Carrier, Mihail Asavoae, and Rémy Boutonnet. Improving WCET Evaluation using Linear Relation Analysis. In LITES, Volume 6, Issue 1 (2019). Leibniz Transactions on Embedded Systems, Volume 6, Issue 1, pp. 02:1-02:28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@Article{raymond_et_al:LITES-v006-i001-a002, author = {Raymond, Pascal and Maiza, Claire and Parent-Vigouroux, Catherine and Jahier, Erwan and Halbwachs, Nicolas and Carrier, Fabienne and Asavoae, Mihail and Boutonnet, R\'{e}my}, title = {{Improving WCET Evaluation using Linear Relation Analysis}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {02:1--02:28}, ISSN = {2199-2002}, year = {2019}, volume = {6}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v006-i001-a002}, doi = {10.4230/LITES-v006-i001-a002}, annote = {Keywords: Worst Case Execution Time estimation, Infeasible Execution Paths, Abstract Interpretation} }
Published in: LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Laura Kovács. First-Order Interpolation and Grey Areas of Proofs (Invited Talk). In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 82, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{kovacs:LIPIcs.CSL.2017.3, author = {Kov\'{a}cs, Laura}, title = {{First-Order Interpolation and Grey Areas of Proofs}}, booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-045-3}, ISSN = {1868-8969}, year = {2017}, volume = {82}, editor = {Goranko, Valentin and Dam, Mads}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.3}, URN = {urn:nbn:de:0030-drops-76912}, doi = {10.4230/LIPIcs.CSL.2017.3}, annote = {Keywords: theorem proving, interpolation, proof transformations, constraint solving, program analysis} }
Published in: LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1
Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, and Wang Yi. A Survey on Static Cache Analysis for Real-Time Systems. In LITES, Volume 3, Issue 1 (2016). Leibniz Transactions on Embedded Systems, Volume 3, Issue 1, pp. 05:1-05:48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Article{lv_et_al:LITES-v003-i001-a005, author = {Lv, Mingsong and Guan, Nan and Reineke, Jan and Wilhelm, Reinhard and Yi, Wang}, title = {{A Survey on Static Cache Analysis for Real-Time Systems}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {05:1--05:48}, ISSN = {2199-2002}, year = {2016}, volume = {3}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a005}, doi = {10.4230/LITES-v003-i001-a005}, annote = {Keywords: Hard real-time, Cache analysis, Worst-case execution time} }
Published in: OASIcs, Volume 30, 13th International Workshop on Worst-Case Execution Time Analysis (2013)
Armin Biere, Jens Knoop, Laura Kovács, and Jakob Zwirchmayr. The Auspicious Couple: Symbolic Execution and WCET Analysis. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 53-63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{biere_et_al:OASIcs.WCET.2013.53, author = {Biere, Armin and Knoop, Jens and Kov\'{a}cs, Laura and Zwirchmayr, Jakob}, title = {{The Auspicious Couple: Symbolic Execution and WCET Analysis}}, booktitle = {13th International Workshop on Worst-Case Execution Time Analysis}, pages = {53--63}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-54-5}, ISSN = {2190-6807}, year = {2013}, volume = {30}, editor = {Maiza, Claire}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.53}, URN = {urn:nbn:de:0030-drops-41225}, doi = {10.4230/OASIcs.WCET.2013.53}, annote = {Keywords: WCET analysis, Symbolic execution, WCET refinement, Flow Facts} }
Published in: Dagstuhl Reports, Volume 2, Issue 11 (2013)
Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, and Rupak M. Majumdar. Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461). In Dagstuhl Reports, Volume 2, Issue 11, pp. 45-65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Article{bjorner_et_al:DagRep.2.11.45, author = {Bjorner, Nikolaj and Chatterjee, Krishnendu and Kovacs, Laura and Majumdar, Rupak M.}, title = {{Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)}}, pages = {45--65}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {11}, editor = {Bjorner, Nikolaj and Chatterjee, Krishnendu and Kovacs, Laura and Majumdar, Rupak M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.45}, URN = {urn:nbn:de:0030-drops-39092}, doi = {10.4230/DagRep.2.11.45}, annote = {Keywords: Systems Engineering, Software Verification, Reactive Synthesis, Automated Deduction} }
Feedback for Dagstuhl Publishing