Issue

Dagstuhl Reports, Volume 13, Issue 3

Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.13.3
Dagstuhl Reports, Volume 13, Issue 3, March 2023, Complete Issue
Abstract
Dagstuhl Reports, Volume 13, Issue 3, March 2023, Complete Issue
Cite as

Dagstuhl Reports, Volume 13, Issue 3, pp. 1-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{DagRep.13.3,
  title =	{{Dagstuhl Reports, Volume 13, Issue 3, March 2023, Complete Issue}},
  pages =	{1--133},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3},
  URN =		{urn:nbn:de:0030-drops-192230},
  doi =		{10.4230/DagRep.13.3},
  annote =	{Keywords: Dagstuhl Reports, Volume 13, Issue 3, March 2023, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.13.3.i
Dagstuhl Reports, Table of Contents, Volume 13, Issue 3, 2023
Abstract
Dagstuhl Reports, Table of Contents, Volume 13, Issue 3, 2023
Cite as

Dagstuhl Reports, Volume 13, Issue 3, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{DagRep.13.3.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 13, Issue 3, 2023}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.i},
  URN =		{urn:nbn:de:0030-drops-192243},
  doi =		{10.4230/DagRep.13.3.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
Document
DOI: 10.4230/DagRep.13.3.1
Foundations of WebAssembly (Dagstuhl Seminar 23101)

Authors: Karthikeyan Bhargavan, Jonathan Protzenko, Andreas Rossberg, and Deian Stefan

Abstract
WebAssembly (Wasm) is a new portable code format with a formal semantics whose popularity has been growing fast, as a platform for new application domains, as a target for compilers and languages, and as a subject of research into its semantics, its performance, and its use in building verified and secure systems. This Dagstuhl Seminar brought together leading academics and industry representatives currently involved in the design, implementation and formal study of Wasm, to exchange ideas around topics such as formal methods for, verified compilation to, and verified implementation of Wasm.
Cite as

Karthikeyan Bhargavan, Jonathan Protzenko, Andreas Rossberg, and Deian Stefan. Foundations of WebAssembly (Dagstuhl Seminar 23101). In Dagstuhl Reports, Volume 13, Issue 3, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bhargavan_et_al:DagRep.13.3.1,
  author =	{Bhargavan, Karthikeyan and Protzenko, Jonathan and Rossberg, Andreas and Stefan, Deian},
  title =	{{Foundations of WebAssembly (Dagstuhl Seminar 23101)}},
  pages =	{1--16},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{Bhargavan, Karthikeyan and Protzenko, Jonathan and Rossberg, Andreas and Stefan, Deian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.1},
  URN =		{urn:nbn:de:0030-drops-192255},
  doi =		{10.4230/DagRep.13.3.1},
  annote =	{Keywords: Compilation, Formal methods, Programming languages, Verification, Virtual machines, WebAssembly}
}
Document
DOI: 10.4230/DagRep.13.3.17
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)

Authors: Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, and Manaswi Paraashar

Abstract
This report documents the program and activities of Dagstuhl Seminar 23111 "Computational Complexity of Discrete Problems", which was held in-person in March 2023 (the previous instance of the seminar series had been held online in March 2021). Following a description of the seminar’s objectives and its overall organization, this report lists the different major talks given during the seminar in alphabetical order of speakers, followed by the abstracts of the talks, including the main references and relevant sources where applicable. The return to an in-person setting allowed an intense atmosphere of active research and interaction throughout the five day seminar.
Cite as

Anna Gál, Meena Mahajan, Rahul Santhanam, Till Tantau, and Manaswi Paraashar. Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111). In Dagstuhl Reports, Volume 13, Issue 3, pp. 17-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{gal_et_al:DagRep.13.3.17,
  author =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till and Paraashar, Manaswi},
  title =	{{Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)}},
  pages =	{17--31},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till and Paraashar, Manaswi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.17},
  URN =		{urn:nbn:de:0030-drops-192261},
  doi =		{10.4230/DagRep.13.3.17},
  annote =	{Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness}
}
Document
DOI: 10.4230/DagRep.13.3.32
Unifying Formal Methods for Trustworthy Distributed Systems (Dagstuhl Seminar 23112)

Authors: Swen Jacobs, Kenneth McMillan, Roopsha Samanta, and Ilya Sergey

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23112 "Unifying Formal Methods for Trustworthy Distributed Systems". Distributed systems are challenging to develop and reason about. Unsurprisingly, there have been many efforts in formally specifying, modeling, and verifying distributed systems. A bird’s eye view of this vast body of work reveals two primary sensibilities. The first is that of semi-automated or interactive deductive verification targeting structured programs and implementations, and focusing on simplifying the user’s task of providing inductive invariants. The second is that of fully-automated model checking, targeting more abstract models of distributed systems, and focusing on extending the boundaries of decidability for the parameterized model checking problem. Regrettably, solution frameworks and results in deductive verification and parameterized model checking have largely evolved in isolation while targeting the same overall goal. This seminar aimed at enabling conversations and solutions cutting across the deductive verification and model checking communities, leveraging the complementary strengths of these approaches. In particular, we explored layered and compositional approaches for modeling and verification of industrial-scale distributed systems that lend themselves well to separation of verification tasks, and thereby the use of diverse proof methodologies.
Cite as

Swen Jacobs, Kenneth McMillan, Roopsha Samanta, and Ilya Sergey. Unifying Formal Methods for Trustworthy Distributed Systems (Dagstuhl Seminar 23112). In Dagstuhl Reports, Volume 13, Issue 3, pp. 32-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{jacobs_et_al:DagRep.13.3.32,
  author =	{Jacobs, Swen and McMillan, Kenneth and Samanta, Roopsha and Sergey, Ilya},
  title =	{{Unifying Formal Methods for Trustworthy Distributed Systems (Dagstuhl Seminar 23112)}},
  pages =	{32--48},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{Jacobs, Swen and McMillan, Kenneth and Samanta, Roopsha and Sergey, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.32},
  URN =		{urn:nbn:de:0030-drops-192278},
  doi =		{10.4230/DagRep.13.3.32},
  annote =	{Keywords: Deductive Verification, Distributed Algorithms, Formal Verification, Model Checking}
}
Document
DOI: 10.4230/DagRep.13.3.49
Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121)

Authors: David Bevan, Miklós Bóna, and István Miklós

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23121 "Pattern Avoidance, Statistical Mechanics and Computational Complexity".
Cite as

David Bevan, Miklós Bóna, and István Miklós. Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). In Dagstuhl Reports, Volume 13, Issue 3, pp. 49-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bevan_et_al:DagRep.13.3.49,
  author =	{Bevan, David and B\'{o}na, Mikl\'{o}s and Mikl\'{o}s, Istv\'{a}n},
  title =	{{Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121)}},
  pages =	{49--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{Bevan, David and B\'{o}na, Mikl\'{o}s and Mikl\'{o}s, Istv\'{a}n},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.49},
  URN =		{urn:nbn:de:0030-drops-192289},
  doi =		{10.4230/DagRep.13.3.49},
  annote =	{Keywords: algorithms, counting and sampling, modeling, permutation patterns, statistical physics.}
}
Document
DOI: 10.4230/DagRep.13.3.74
Deep Continual Learning (Dagstuhl Seminar 23122)

Authors: Tinne Tuytelaars, Bing Liu, Vincenzo Lomonaco, Gido van de Ven, and Andrea Cossu

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23122 "Deep Continual Learning". This seminar brought together 26 researchers to discuss open problems and future directions of Continual Learning. The discussion revolved around key properties and the definition of Continual Learning itself, on the way Continual Learning should be evaluated, and on its real-world applications beyond academic research.
Cite as

Tinne Tuytelaars, Bing Liu, Vincenzo Lomonaco, Gido van de Ven, and Andrea Cossu. Deep Continual Learning (Dagstuhl Seminar 23122). In Dagstuhl Reports, Volume 13, Issue 3, pp. 74-91, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{tuytelaars_et_al:DagRep.13.3.74,
  author =	{Tuytelaars, Tinne and Liu, Bing and Lomonaco, Vincenzo and van de Ven, Gido and Cossu, Andrea},
  title =	{{Deep Continual Learning (Dagstuhl Seminar 23122)}},
  pages =	{74--91},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{Tuytelaars, Tinne and Liu, Bing and Lomonaco, Vincenzo and van de Ven, Gido and Cossu, Andrea},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.74},
  URN =		{urn:nbn:de:0030-drops-192298},
  doi =		{10.4230/DagRep.13.3.74},
  annote =	{Keywords: continual learning, incremental learning}
}
Document
DOI: 10.4230/DagRep.13.3.92
Software Bug Detection: Challenges and Synergies (Dagstuhl Seminar 23131)

Authors: Marcel Böhme, Maria Christakis, Rohan Padhye, Kostya Serebryany, Andreas Zeller, and Hasan Ferit Eniser

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 23131 "Software Bug Detection: Challenges and Synergies". This seminar brought together researchers from academia and industry working on various aspects of software bug detection, with two broad goals: identifying challenges in practical deployment of bug-finding tools and discovering new synergies among bug-finding techniques and research methods. The seminar focused discussion on bug-finding tools and their relevance and adoption in industry.
Cite as

Marcel Böhme, Maria Christakis, Rohan Padhye, Kostya Serebryany, Andreas Zeller, and Hasan Ferit Eniser. Software Bug Detection: Challenges and Synergies (Dagstuhl Seminar 23131). In Dagstuhl Reports, Volume 13, Issue 3, pp. 92-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bohme_et_al:DagRep.13.3.92,
  author =	{B\"{o}hme, Marcel and Christakis, Maria and Padhye, Rohan and Serebryany, Kostya and Zeller, Andreas and Eniser, Hasan Ferit},
  title =	{{Software Bug Detection: Challenges and Synergies (Dagstuhl Seminar 23131)}},
  pages =	{92--105},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{B\"{o}hme, Marcel and Christakis, Maria and Padhye, Rohan and Serebryany, Kostya and Zeller, Andreas and Eniser, Hasan Ferit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.92},
  URN =		{urn:nbn:de:0030-drops-192308},
  doi =		{10.4230/DagRep.13.3.92},
  annote =	{Keywords: Bug Finding, Coverage, ML4SE, Oracles, Software Testing, Software Verification}
}
Document
DOI: 10.4230/DagRep.13.3.106
AI-Augmented Facilities: Bridging Experiment and Simulation with ML (Dagstuhl Seminar 23132)

Authors: Peer-Timo Bremer, Brian Spears, Tom Gibbs, and Michael Bussmann

Abstract
In the last week of March 2023, Schloss Dagstuhl hosted a Dagstuhl Seminar on "AI-Augmented Facilities: Bridging Experiment and Simulation with ML". The seminar brought together experimental and computational scientists, experts on edge and HPC computing, and machine learning and computer science researchers to jointly develop a strategic vision on how to move towards AI-augmented facilities in a unified manner. The goal was to suggest a common research agenda with an emphasis on areas where joint efforts are needed for future progress. Starting with some overarching perspectives the seminar was dominated by lively discussions that resulted in a strategic write-up to be published separately.
Cite as

Peer-Timo Bremer, Brian Spears, Tom Gibbs, and Michael Bussmann. AI-Augmented Facilities: Bridging Experiment and Simulation with ML (Dagstuhl Seminar 23132). In Dagstuhl Reports, Volume 13, Issue 3, pp. 106-131, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{bremer_et_al:DagRep.13.3.106,
  author =	{Bremer, Peer-Timo and Spears, Brian and Gibbs, Tom and Bussmann, Michael},
  title =	{{AI-Augmented Facilities: Bridging Experiment and Simulation with ML (Dagstuhl Seminar 23132)}},
  pages =	{106--131},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{Bremer, Peer-Timo and Spears, Brian and Gibbs, Tom and Bussmann, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.3.106},
  URN =		{urn:nbn:de:0030-drops-192317},
  doi =		{10.4230/DagRep.13.3.106},
  annote =	{Keywords: Self-driving experiments, Smart facilities, AI models, Multimodal data, Accelerated scientific discovery, AI software stack for experiments}
}

Filters

  • Authors
  • B
  • Bevan, David
  • Bhargavan, Karthikeyan
  • Böhme, Marcel
  • Bóna, Miklós
  • Bremer, Peer-Timo
  • Bussmann, Michael
  • C
  • Christakis, Maria
  • Cossu, Andrea
  • E
  • Eniser, Hasan Ferit
  • G
  • Gál, Anna
  • Gibbs, Tom
  • J
  • Jacobs, Swen
  • L
  • Liu, Bing
  • Lomonaco, Vincenzo
  • M
  • Mahajan, Meena
  • McMillan, Kenneth
  • Miklós, István
  • P
  • Padhye, Rohan
  • Paraashar, Manaswi
  • Protzenko, Jonathan
  • R
  • Rossberg, Andreas
  • S
  • Samanta, Roopsha
  • Santhanam, Rahul
  • Serebryany, Kostya
  • Sergey, Ilya
  • Spears, Brian
  • Stefan, Deian
  • T
  • Tantau, Till
  • Tuytelaars, Tinne
  • V
  • van de Ven, Gido
  • Z
  • Zeller, Andreas

  • Subjects
  • Applied computing
  • Applied computing → Physical sciences and engineering
  • Computer systems organization
  • Computer systems organization → Embedded and cyber-physical systems
  • Computing methodologies
  • Computing methodologies → Distributed algorithms
  • Computing methodologies → Learning settings
  • Computing methodologies → Machine learning
  • Computing methodologies → Modeling and simulation
  • Computing methodologies → Neural networks
  • Information systems
  • Information systems → Data management systems
  • Information systems → Data structures
  • Mathematics of computing
  • Mathematics of computing → Combinatoric problems
  • Mathematics of computing → Probability and statistics
  • Software and its engineering
  • Software and its engineering
  • Software and its engineering → Formal language definitions
  • Software and its engineering → Software testing and debugging
  • Software and its engineering → Software verification
  • Software and its engineering → Virtual machines
  • Theory of computation
  • Theory of computation → Algebraic complexity theory
  • Theory of computation → Circuit complexity
  • Theory of computation → Concurrency
  • Theory of computation → Formal languages and automata theory
  • Theory of computation → Probabilistic computation
  • Theory of computation → Program verification
  • Theory of computation → Pseudorandomness and derandomization
  • Theory of computation → Semantics and reasoning
  • Theory of computation → Streaming models
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact