Issue

Dagstuhl Reports, Volume 2, Issue 11

Thumbnail PDF

Publication Details


Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Issue
DOI: 10.4230/DagRep.2.11
Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue
Abstract
Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue
Cite as

Dagstuhl Reports, Volume 2, Issue 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{DagRep.2.11,
  title =	{{Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue}},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11},
  URN =		{urn:nbn:de:0030-drops-39939},
  doi =		{10.4230/DagRep.2.11},
  annote =	{Keywords: Dagstuhl Reports, Volume 2, Issue 11, November 2012, Complete Issue}
}
Document
Front Matter
DOI: 10.4230/DagRep.2.11.i
Dagstuhl Reports, Table of Contents, Volume 2, Issue 11, 2012
Abstract
Table of Contents, Frontmatter
Cite as

Dagstuhl Reports, Volume 2, Issue 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{DagRep.2.11.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 2, Issue 11, 2012}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.i},
  URN =		{urn:nbn:de:0030-drops-39940},
  doi =		{10.4230/DagRep.2.11.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 2, Issue 11, 2012}
}
Document
DOI: 10.4230/DagRep.2.11.1
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)

Authors: Johan Hastad, Andrei Krokhin, and Dániel Marx

Abstract
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations of algorithmic techniques. The Dagstuhl Seminar 12451 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was aimed at bringing together researchers using all the different techniques in the study of the CSP, so that they can share their insights. This report documents the material presented during the course of the seminar.
Cite as

Johan Hastad, Andrei Krokhin, and Dániel Marx. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451). In Dagstuhl Reports, Volume 2, Issue 11, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{hastad_et_al:DagRep.2.11.1,
  author =	{Hastad, Johan and Krokhin, Andrei and Marx, D\'{a}niel},
  title =	{{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)}},
  pages =	{1--19},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Hastad, Johan and Krokhin, Andrei and Marx, D\'{a}niel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.1},
  URN =		{urn:nbn:de:0030-drops-39764},
  doi =		{10.4230/DagRep.2.11.1},
  annote =	{Keywords: Constraint satisfaction problem (CSP); Computational complexity; CSP dichotomy conjecture; Hardness of approximation; Unique games conjceture; Fixed-parameter tractability; Descriptive complexity; niversal algebra; Logic; Decomposition methods}
}
Document
DOI: 10.4230/DagRep.2.11.20
Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452)

Authors: Kurt Mehlhorn, Moshe Y. Vardi, and Marc Herbstritt

Abstract
The dissemination of research results is an integral part of research and hence a crucial component for any scientific discipline. In the area of computing research, there have been raised concerns recently about its publication culture, most notably by highlighting the high priority of conferences (compared to journals in other disciplines) and -- from an economic viewpoint -- the costs of preparing and accessing research results. The Dagstuhl Perspectives Workshop 12452 ``Publication Culture in Computing Research'' aimed at discussing the main problems with a selected group of researchers and practitioners. The goal was to identify and classify the current problems and to suggest potential remedies. The group of participants was selected in a way such that a wide spectrum of opinions would be presented. This lead to intensive discussions. The workshop is seen as an important step in the ongoing discussion. As a main result, the main problem roots were identified and potential solutions were discussed. The insights will be part of an upcoming manifesto on Publication Culture in Computing Research.
Cite as

Kurt Mehlhorn, Moshe Y. Vardi, and Marc Herbstritt. Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). In Dagstuhl Reports, Volume 2, Issue 11, pp. 20-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{mehlhorn_et_al:DagRep.2.11.20,
  author =	{Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc},
  title =	{{Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452)}},
  pages =	{20--44},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Mehlhorn, Kurt and Vardi, Moshe Y. and Herbstritt, Marc},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.20},
  URN =		{urn:nbn:de:0030-drops-39778},
  doi =		{10.4230/DagRep.2.11.20},
  annote =	{Keywords: scholarly publishing, conference, journal, peer review, open archive, open access, indexing, research evaluation}
}
Document
DOI: 10.4230/DagRep.2.11.45
Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)

Authors: Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, and Rupak M. Majumdar

Abstract
This report documents the program and the outcomes of the Dagstuhl Seminar 12461 "Games and Decisions for Rigorous Systems Engineering". The seminar brought together researchers working in rigorous software engineering, with a special focus on the interaction between synthesis and automated deduction. This event was the first seminar of this kind and a kickoff of a series of seminars organised on rigorous systems engineering. The theme of the seminar was close in spirit to many events that have been held over the last decades. The talks scheduled during the seminar naturally reflected fundamental research themes of the involved communities.
Cite as

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)

Copy BibTex To Clipboard

@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-dev.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}
}
Document
DOI: 10.4230/DagRep.2.11.66
Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462)

Authors: Francois Boulier, Anne J. Shiu, Thomas Strum, and Andreas Weber

Abstract
During 11--16 November 2012, the Dagstuhl Seminar 12462 ``Symbolic Methods for Chemical Reaction Networks'' was held in Schloss Dagstuhl -- Leibneiz Center for Informatics. The seminar brought together researchers in symbolic computation, chemical engineering, and systems biology. During the seminar, participants presented five-minute talks introducing their research interests, five participants gave longer talks, and all participants had the opportunity to take part in various discussion groups. Abstracts of presentations and summaries of the discussion groups are compiled in this report.
Cite as

Francois Boulier, Anne J. Shiu, Thomas Strum, and Andreas Weber. Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462). In Dagstuhl Reports, Volume 2, Issue 11, pp. 66-86, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{boulier_et_al:DagRep.2.11.66,
  author =	{Boulier, Francois and Shiu, Anne J. and Strum, Thomas and Weber, Andreas},
  title =	{{Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462)}},
  pages =	{66--86},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Boulier, Francois and Shiu, Anne J. and Strum, Thomas and Weber, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.66},
  URN =		{urn:nbn:de:0030-drops-39060},
  doi =		{10.4230/DagRep.2.11.66},
  annote =	{Keywords: chemical reaction network theory, differential algebra, Hopf bifurcation, mass-action kinetics, model inference, model reduction, molecular interaction network, multistationarity, parameter estimation, quantifier elimination, stoichiometric network analysis, symbolic computation}
}
Document
DOI: 10.4230/DagRep.2.11.87
SAT Interactions (Dagstuhl Seminar 12471)

Authors: Nadia Creignou, Nicola Galesi, Oliver Kullmann, and Heribert Vollmer

Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 12471 "SAT Interactions". The seminar brought together researchers from different areas from theoretical computer science as well as the area of SAT solvers. A key objective of the seminar has been to initiate or consolidate discussions among the different groups for a fresh attack on one of the most important problems in theoretical computer science and mathematics.
Cite as

Nadia Creignou, Nicola Galesi, Oliver Kullmann, and Heribert Vollmer. SAT Interactions (Dagstuhl Seminar 12471). In Dagstuhl Reports, Volume 2, Issue 11, pp. 87-101, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{creignou_et_al:DagRep.2.11.87,
  author =	{Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert},
  title =	{{SAT Interactions (Dagstuhl Seminar 12471)}},
  pages =	{87--101},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Creignou, Nadia and Galesi, Nicola and Kullmann, Oliver and Vollmer, Heribert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.87},
  URN =		{urn:nbn:de:0030-drops-39786},
  doi =		{10.4230/DagRep.2.11.87},
  annote =	{Keywords: satisfiability problem, computational complexity, P-NP question, proof complexity, combinatorics, SAT-solvers, quantified Boolean formulas}
}
Document
DOI: 10.4230/DagRep.2.11.102
Is the Future of Preservation Cloudy? (Dagstuhl Seminar 12472)

Authors: Erik Elmroth, Michael Factor, Ethan Miller, and Margo Seltzer

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12472 "Is the Future of Preservation Cloudy?". Our seminar was composed of a series of panels structured as a series of brief presentations followed by an open discussion. The seminar started with a session introducing key concepts and definitions and illuminating the vast array of perspectives from which attendees were addressing issues of cloud and preservation. We them proceeded into a discussion of requirements from different types of communities and a subsequent discussion on how to protect the data and ensure its integrity and reliability. We next considered issues related to cloud infrastructure, in particular related to management of the bits and logical obsolescence. We also considered the economics of preservation and the ability to reuse knowledge. In addition to these pre-planned panels, we had three breakout sessions that were identified by the participants: automated appraisal, design for forgetting, and PaaS/SaaS for data preservation. After the executive summary, we present summaries of the panels and reports on the breakout sessions, followed by brief abstracts from a majority of the seminar participants describing the material they presented in the panels.
Cite as

Erik Elmroth, Michael Factor, Ethan Miller, and Margo Seltzer. Is the Future of Preservation Cloudy? (Dagstuhl Seminar 12472). In Dagstuhl Reports, Volume 2, Issue 11, pp. 102-134, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{elmroth_et_al:DagRep.2.11.102,
  author =	{Elmroth, Erik and Factor, Michael and Miller, Ethan and Seltzer, Margo},
  title =	{{Is the Future of Preservation Cloudy? (Dagstuhl Seminar 12472)}},
  pages =	{102--134},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Elmroth, Erik and Factor, Michael and Miller, Ethan and Seltzer, Margo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.102},
  URN =		{urn:nbn:de:0030-drops-39790},
  doi =		{10.4230/DagRep.2.11.102},
  annote =	{Keywords: long-term preservation, cloud storage, provenance, obsolescence, data access, storage systems}
}
Document
DOI: 10.4230/DagRep.2.11.135
Quantitative Security Analysis (Dagstuhl Seminar 12481)

Authors: Boris Köpf, Paquale Malacaria, and Catuscia Palamidessi

Abstract
The high amount of trust put into today's software systems calls for a rigorous analysis of their security. Unfortunately, security is often in conflict with requirements on the functionality or the performance of a system, making perfect security an impossible or overly expensive goal. Under such constraints, the relevant question is not whether a system is secure, but rather how much security it provides. Quantitative notions of security can express degrees of protection and thus enable reasoning about the trade-off between security and conflicting requirements. Corresponding quantitative security analyses bear the potential of becoming an important tool for the rigorous development of practical systems, and a formal foundation for the management of security risks.
Cite as

Boris Köpf, Paquale Malacaria, and Catuscia Palamidessi. Quantitative Security Analysis (Dagstuhl Seminar 12481). In Dagstuhl Reports, Volume 2, Issue 11, pp. 135-154, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{kopf_et_al:DagRep.2.11.135,
  author =	{K\"{o}pf, Boris and Malacaria, Paquale and Palamidessi, Catuscia},
  title =	{{Quantitative Security Analysis (Dagstuhl Seminar 12481)}},
  pages =	{135--154},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{K\"{o}pf, Boris and Malacaria, Paquale and Palamidessi, Catuscia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.135},
  URN =		{urn:nbn:de:0030-drops-39824},
  doi =		{10.4230/DagRep.2.11.135},
  annote =	{Keywords: Security, Privacy,Information theory, Programming languages, Formal methods}
}
Document
DOI: 10.4230/DagRep.2.11.155
Analysis of Security APIs (Dagstuhl Seminar 12482)

Authors: Mike Bond, Riccardo Focardi, Sibylle Fröschle, and Graham Steel

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12482 "Analysis of Security APIs". Abstracts from the talks give a snapshot of current research in the field, while reports on the discussions give a roadmap for future research in the area.
Cite as

Mike Bond, Riccardo Focardi, Sibylle Fröschle, and Graham Steel. Analysis of Security APIs (Dagstuhl Seminar 12482). In Dagstuhl Reports, Volume 2, Issue 11, pp. 155-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{bond_et_al:DagRep.2.11.155,
  author =	{Bond, Mike and Focardi, Riccardo and Fr\"{o}schle, Sibylle and Steel, Graham},
  title =	{{Analysis of Security APIs (Dagstuhl Seminar 12482)}},
  pages =	{155--168},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{11},
  editor =	{Bond, Mike and Focardi, Riccardo and Fr\"{o}schle, Sibylle and Steel, Graham},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.11.155},
  URN =		{urn:nbn:de:0030-drops-39832},
  doi =		{10.4230/DagRep.2.11.155},
  annote =	{Keywords: Security APIs, cryptography, key management, formal methods, security protocols}
}

Filters

  • Authors
  • B
  • Bjorner, Nikolaj
  • Bond, Mike
  • Boulier, Francois
  • C
  • Chatterjee, Krishnendu
  • Creignou, Nadia
  • E
  • Elmroth, Erik
  • F
  • Factor, Michael
  • Focardi, Riccardo
  • Fröschle, Sibylle
  • G
  • Galesi, Nicola
  • H
  • Hastad, Johan
  • Herbstritt, Marc
  • K
  • Köpf, Boris
  • Kovacs, Laura
  • Krokhin, Andrei
  • Kullmann, Oliver
  • M
  • Majumdar, Rupak M.
  • Malacaria, Paquale
  • Marx, Dániel
  • Mehlhorn, Kurt
  • Miller, Ethan
  • P
  • Palamidessi, Catuscia
  • S
  • Seltzer, Margo
  • Shiu, Anne J.
  • Steel, Graham
  • Strum, Thomas
  • V
  • Vardi, Moshe Y.
  • Vollmer, Heribert
  • W
  • Weber, Andreas

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