Issue

Dagstuhl Reports, Volume 2, Issue 10

Thumbnail PDF

Publication Details


Access Numbers

Documents

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

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

Copy BibTex To Clipboard

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

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

Copy BibTex To Clipboard

@Article{DagRep.2.10.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 2, Issue 10, 2012}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.i},
  URN =		{urn:nbn:de:0030-drops-39803},
  doi =		{10.4230/DagRep.2.10.i},
  annote =	{Keywords: Dagstuhl Reports, Table of Contents, Volume 2, Issue 10, 2012}
}
Document
DOI: 10.4230/DagRep.2.10.1
Web Application Security (Dagstuhl Seminar 12401)

Authors: Lieven Desmet, Martin Johns, Benjamin Livshits, and Andrei Sabelfeld

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12401 ``Web Application Security''. The seminar brought 44 web security researchers together, coming from companies and research institutions across Europe and the US. The seminar had a well-filled program, with 3 keynotes, 28 research talks, and 15 5-minute talks. As web application security is a broad research domain, a diverse set of recent research results was presented during the talks, covering the web security vulnerability landscape, information-flow control, JavaScript formalization, JavaScript confinement, and infrastructure and server hardening. In addition to the plenary program, the seminar also featured three parallel break-out sessions on Cross-Site Scripting (XSS), JavaScript and Information-flow control.
Cite as

Lieven Desmet, Martin Johns, Benjamin Livshits, and Andrei Sabelfeld. Web Application Security (Dagstuhl Seminar 12401). In Dagstuhl Reports, Volume 2, Issue 10, pp. 1-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{desmet_et_al:DagRep.2.10.1,
  author =	{Desmet, Lieven and Johns, Martin and Livshits, Benjamin and Sabelfeld, Andrei},
  title =	{{Web Application Security (Dagstuhl Seminar 12401)}},
  pages =	{1--37},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Desmet, Lieven and Johns, Martin and Livshits, Benjamin and Sabelfeld, Andrei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.1},
  URN =		{urn:nbn:de:0030-drops-39051},
  doi =		{10.4230/DagRep.2.10.1},
  annote =	{Keywords: Web application security, JavaScript, Secure interaction, Information flow, Secure composition, Application security, Web 2.0}
}
Document
DOI: 10.4230/DagRep.2.10.38
Coalgebraic Logics (Dagstuhl Seminar 12411)

Authors: Ernst-Erich Doberkat and Alexander Kurz

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12411 "Coalgebraic Logics". The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.
Cite as

Ernst-Erich Doberkat and Alexander Kurz. Coalgebraic Logics (Dagstuhl Seminar 12411). In Dagstuhl Reports, Volume 2, Issue 10, pp. 38-59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{doberkat_et_al:DagRep.2.10.38,
  author =	{Doberkat, Ernst-Erich and Kurz, Alexander},
  title =	{{Coalgebraic Logics (Dagstuhl Seminar 12411)}},
  pages =	{38--59},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Doberkat, Ernst-Erich and Kurz, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.38},
  URN =		{urn:nbn:de:0030-drops-38938},
  doi =		{10.4230/DagRep.2.10.38},
  annote =	{Keywords: Modal Logic, Coalgebra, Category Theory, Stochastic Logic, Categorical Semantics}
}
Document
DOI: 10.4230/DagRep.2.10.60
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421)

Authors: Manindra Agrawal, Thomas Thierauf, and Christopher Umans

Abstract
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The PCP characterization of NP and the Agrawal-Kayal-Saxena polynomial-time primality test are two prominent examples. Recently, there have been some works going in the opposite direction, giving alternative combinatorial proofs for results that were originally proved algebraically. These alternative proofs can yield important improvements because they are closer to the underlying problems and avoid the losses in passing to the algebraic setting. A prominent example is Dinur's proof of the PCP Theorem via gap amplification which yielded short PCPs with only a polylogarithmic length blowup (which had been the focus of significant research effort up to that point). We see here (and in a number of recent works) an exciting interplay between algebraic and combinatorial techniques. This seminar aims to capitalize on recent progress and bring together researchers who are using a diverse array of algebraic and combinatorial methods in a variety of settings.
Cite as

Manindra Agrawal, Thomas Thierauf, and Christopher Umans. Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). In Dagstuhl Reports, Volume 2, Issue 10, pp. 60-78, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{agrawal_et_al:DagRep.2.10.60,
  author =	{Agrawal, Manindra and Thierauf, Thomas and Umans, Christopher},
  title =	{{Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421)}},
  pages =	{60--78},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Agrawal, Manindra and Thierauf, Thomas and Umans, Christopher},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.60},
  URN =		{urn:nbn:de:0030-drops-39034},
  doi =		{10.4230/DagRep.2.10.60},
  annote =	{Keywords: Computational Complexity, lower bounds, approximazation, pseudo-randomness, derandomization, circuits}
}
Document
DOI: 10.4230/DagRep.2.10.79
Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431)

Authors: James Davis, Bernd Jähne, Andreas Kolb, Ramesh Raskar, and Christian Theobalt

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12431 "Time-of-Flight Imaging: Algorithms, Sensors and Applications". The seminar brought together researchers with diverse background from both academia and industry to discuss various aspects of Time-of-Flight imaging and general depth sensors. The executive summary and abstracts of the talks given during the seminar as well as the outcome of several working groups on specific research topics are presented in this report.
Cite as

James Davis, Bernd Jähne, Andreas Kolb, Ramesh Raskar, and Christian Theobalt. Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431). In Dagstuhl Reports, Volume 2, Issue 10, pp. 79-104, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{davis_et_al:DagRep.2.10.79,
  author =	{Davis, James and J\"{a}hne, Bernd and Kolb, Andreas and Raskar, Ramesh and Theobalt, Christian},
  title =	{{Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431)}},
  pages =	{79--104},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Davis, James and J\"{a}hne, Bernd and Kolb, Andreas and Raskar, Ramesh and Theobalt, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.79},
  URN =		{urn:nbn:de:0030-drops-39044},
  doi =		{10.4230/DagRep.2.10.79},
  annote =	{Keywords: Time-of-Flight, Kinect^TM, depth sensor}
}
Document
DOI: 10.4230/DagRep.2.10.105
Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441)

Authors: James Delgrande, Thomas Meyer, and Ulrike Sattler

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12441 "Foundations and Challenges of Change and Evolution in Ontologies", held from 28 October to 2 November 2012. The aim of the workshop was to bring together researchers working in the areas of logic-based ontologies, belief change, and database systems, along with researchers working in relevant areas in nonmonotonic reasoning, commonsense reasoning, and paraconsistent reasoning. The workshop provided a forum for discussions on the application of existing work in belief change, nonmonotonic reasoning, commonsense reasoning, and databases to logic-based ontologies. Overall the intent was to provide an interdisciplinary (with respect to computer science and mathematics) workshop for addressing both theoretical and computational issues in managing change and evolution in formal ontologies.
Cite as

James Delgrande, Thomas Meyer, and Ulrike Sattler. Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441). In Dagstuhl Reports, Volume 2, Issue 10, pp. 105-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{delgrande_et_al:DagRep.2.10.105,
  author =	{Delgrande, James and Meyer, Thomas and Sattler, Ulrike},
  title =	{{Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441)}},
  pages =	{105--116},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Delgrande, James and Meyer, Thomas and Sattler, Ulrike},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.105},
  URN =		{urn:nbn:de:0030-drops-39079},
  doi =		{10.4230/DagRep.2.10.105},
  annote =	{Keywords: Artificial intelligence, Belief change, Ontologies, Description logics}
}
Document
DOI: 10.4230/DagRep.2.10.117
Requirements Management – Novel Perspectives and Challenges (Dagstuhl Seminar 12442)

Authors: Jane Cleland-Huang, Matthias Jarke, Lin Liu, and Kalle Lyytinen

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12442 "Requirements Management -- Novel Perspectives and Challenges". Changes in computational paradigms and capabilities that draw upon platform strategies, web services, and virtualization of both application services and development platforms have significant implications for views of modularity and requirements evolution, complexity of RE tasks, and the economics of system development and operations. The aim of the seminar was to bring together experts from multiple fields to discuss models and theories around these changes. Three key challenges and associated solution ideas were addressed, namely (1) to better deal with context changes and business goal management to reduce the "black swan" rate of badly failed large projects, (2) to exploit recent theories of technological and institutional evolution to understand better how to control complexity and leverage it for innovation at the same time, and (3) the demand for runtime re-organization of existing large-scale systems with respect to new operational goals such as energy efficiency. Future RE must see itself as the marketplace where responsibility for all these complexities and evolutionary steps is traded.
Cite as

Jane Cleland-Huang, Matthias Jarke, Lin Liu, and Kalle Lyytinen. Requirements Management – Novel Perspectives and Challenges (Dagstuhl Seminar 12442). In Dagstuhl Reports, Volume 2, Issue 10, pp. 117-152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{clelandhuang_et_al:DagRep.2.10.117,
  author =	{Cleland-Huang, Jane and Jarke, Matthias and Liu, Lin and Lyytinen, Kalle},
  title =	{{Requirements Management – Novel Perspectives and Challenges (Dagstuhl Seminar 12442)}},
  pages =	{117--152},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Cleland-Huang, Jane and Jarke, Matthias and Liu, Lin and Lyytinen, Kalle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.117},
  URN =		{urn:nbn:de:0030-drops-39082},
  doi =		{10.4230/DagRep.2.10.117},
  annote =	{Keywords: requirements engineering; system complexity; software evolution; socio-technical systems}
}

Filters

  • Authors
  • A
  • Agrawal, Manindra
  • C
  • Cleland-Huang, Jane
  • D
  • Davis, James
  • Delgrande, James
  • Desmet, Lieven
  • Doberkat, Ernst-Erich
  • J
  • Jähne, Bernd
  • Jarke, Matthias
  • Johns, Martin
  • K
  • Kolb, Andreas
  • Kurz, Alexander
  • L
  • Liu, Lin
  • Livshits, Benjamin
  • Lyytinen, Kalle
  • M
  • Meyer, Thomas
  • R
  • Raskar, Ramesh
  • S
  • Sabelfeld, Andrei
  • Sattler, Ulrike
  • T
  • Theobalt, Christian
  • Thierauf, Thomas
  • U
  • Umans, Christopher

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