4 Search Results for "Smith, Douglas"

Document
Keynote Speakers
DOI: 10.4230/LIPIcs.AofA.2018.8
Periods in Subtraction Games (Keynote Speakers)

Authors: Bret Benesh, Jamylle Carter, Deidra A. Coleman, Douglas G. Crabill, Jack H. Good, Michael A. Smith, Jennifer Travis, and Mark Daniel Ward

Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)

Abstract
We discuss the structure of periods in subtraction games. In particular, we discuss ways that a computational approach yields insights to the periods that emerge in the asymptotic structure of these combinatorial games.
Cite as

Bret Benesh, Jamylle Carter, Deidra A. Coleman, Douglas G. Crabill, Jack H. Good, Michael A. Smith, Jennifer Travis, and Mark Daniel Ward. Periods in Subtraction Games (Keynote Speakers). In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 8:1-8:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{benesh_et_al:LIPIcs.AofA.2018.8,
  author =	{Benesh, Bret and Carter, Jamylle and Coleman, Deidra A. and Crabill, Douglas G. and Good, Jack H. and Smith, Michael A. and Travis, Jennifer and Ward, Mark Daniel},
  title =	{{Periods in Subtraction Games}},
  booktitle =	{29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)},
  pages =	{8:1--8:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-078-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{110},
  editor =	{Fill, James Allen and Ward, Mark Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.8},
  URN =		{urn:nbn:de:0030-drops-89015},
  doi =		{10.4230/LIPIcs.AofA.2018.8},
  annote =	{Keywords: combinatorial games, subtraction games, periods, asymptotic structure}
}
Document
DOI: 10.4230/DagSemProc.09501.1
09501 Abstracts Collection – Software Synthesis

Authors: Ratislav Bodik, Orna Kupferman, Dougla R. Smith, and Eran Yahav

Published in: Dagstuhl Seminar Proceedings, Volume 9501, Software Synthesis (2010)

Abstract
From 06.12.09 to 11.12.09, the Dagstuhl Seminar 09501 ``Software Synthesis '' in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Ratislav Bodik, Orna Kupferman, Dougla R. Smith, and Eran Yahav. 09501 Abstracts Collection – Software Synthesis. In Software Synthesis. Dagstuhl Seminar Proceedings, Volume 9501, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{bodik_et_al:DagSemProc.09501.1,
  author =	{Bodik, Ratislav and Kupferman, Orna and Smith, Dougla R. and Yahav, Eran},
  title =	{{09501 Abstracts Collection – Software Synthesis}},
  booktitle =	{Software Synthesis},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9501},
  editor =	{Ratislav Bodik and Orna Kupferman and Douglas R. Smith and Eran Yahav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09501.1},
  URN =		{urn:nbn:de:0030-drops-26696},
  doi =		{10.4230/DagSemProc.09501.1},
  annote =	{Keywords: Software Synthesis, Verification, Theorem Proving, Program Analysis, Programming by Demonstration}
}
Document
DOI: 10.4230/DagSemProc.09501.2
Software Synthesis is Hard – and Simple

Authors: Sven Schewe

Published in: Dagstuhl Seminar Proceedings, Volume 9501, Software Synthesis (2010)

Abstract
While the components of distributed hardware systems can reasonably be assumed to be synchronised, this is not the case for the components of distributed software systems. This has a strong impact on the class of synthesis problems for which decision procedures exist: While there is a rich family of distributed systems, including pipelines, chains, and rings, for which the realisability and synthesis problem is decidable if the system components are composed synchronously, it is well known that the asynchronous synthesis problem is only decidable for monolithic systems. From a theoretical point of view, this renders distributed software synthesis undecidable, and one is tempted to conclude that synthesis of asynchronous systems, and hence of software, is much harder than the synthesis of synchronous systems. Taking a more practical approach, however, reveals that bounded synthesis, one of the most promising synthesis techniques, can easily be extended to asynchronous systems. This merits the hope that the promising results from bounded synthesis will carry over to asynchronous systems as well.
Cite as

Sven Schewe. Software Synthesis is Hard – and Simple. In Software Synthesis. Dagstuhl Seminar Proceedings, Volume 9501, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{schewe:DagSemProc.09501.2,
  author =	{Schewe, Sven},
  title =	{{Software Synthesis is Hard – and Simple}},
  booktitle =	{Software Synthesis},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9501},
  editor =	{Ratislav Bodik and Orna Kupferman and Douglas R. Smith and Eran Yahav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09501.2},
  URN =		{urn:nbn:de:0030-drops-26702},
  doi =		{10.4230/DagSemProc.09501.2},
  annote =	{Keywords: Synthesis, Temporal Logics}
}
Document
DOI: 10.4230/DagSemRep.84
Logical Theory for Program Construction (Dagstuhl Seminar 9410)

Authors: Jean-Pierre Finance, Stefan Jähnichen, Jacques Loeckx, Douglas Smith, and Martin Wirsing

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Jean-Pierre Finance, Stefan Jähnichen, Jacques Loeckx, Douglas Smith, and Martin Wirsing. Logical Theory for Program Construction (Dagstuhl Seminar 9410). Dagstuhl Seminar Report 84, pp. 1-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)

Copy BibTex To Clipboard

@TechReport{finance_et_al:DagSemRep.84,
  author =	{Finance, Jean-Pierre and J\"{a}hnichen, Stefan and Loeckx, Jacques and Smith, Douglas and Wirsing, Martin},
  title =	{{Logical Theory for Program Construction (Dagstuhl Seminar 9410)}},
  pages =	{1--46},
  ISSN =	{1619-0203},
  year =	{1994},
  type = 	{Dagstuhl Seminar Report},
  number =	{84},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.84},
  URN =		{urn:nbn:de:0030-drops-149727},
  doi =		{10.4230/DagSemRep.84},
}
  • Refine by Author
  • 1 Benesh, Bret
  • 1 Bodik, Ratislav
  • 1 Carter, Jamylle
  • 1 Coleman, Deidra A.
  • 1 Crabill, Douglas G.
  • Show More...

  • Refine by Classification
  • 1 Mathematics of computing → Combinatorial algorithms

  • Refine by Keyword
  • 1 Program Analysis
  • 1 Programming by Demonstration
  • 1 Software Synthesis
  • 1 Synthesis
  • 1 Temporal Logics
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 2 2010
  • 1 1994
  • 1 2018

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