Search Results

Documents authored by Demetrescu, Camil


Document
Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402)

Authors: Camil Demetrescu, Sebastian Erdweg, Matthew A. Hammer, and Shriram Krishnamurthi

Published in: Dagstuhl Reports, Volume 6, Issue 10 (2017)


Abstract
Incremental computations are those that process input changes faster than naive computation that runs from scratch, and reactive computations consist of interactive behavior that varies over time. Due to the importance and prevalence of incremental, reactive systems, ad hoc variants of incremental and reactive computation are ubiquitous in modern software systems. In response to this reality, the PL research community has worked for several decades to advance new languages for systems that interface with a dynamically-changing environment. In this space, researchers propose new general-purpose languages and algorithms to express and implement efficient, dynamic behavior, in the form of incremental and reactive language systems. While these research lines continue to develop successfully, this work lacks a shared community that synthesizes a collective discussion about common motivations, alternative techniques, current results and future challenges. To overcome this lack of community, this seminar will work towards building one, by strengthening existing research connections and by forging new ones. Developing a shared culture is critical to the future advancement of incremental and reactive computing in modern PL research, and in turn, this PL research is critical to developing the efficient, understandable interactive systems of the future.

Cite as

Camil Demetrescu, Sebastian Erdweg, Matthew A. Hammer, and Shriram Krishnamurthi. Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402). In Dagstuhl Reports, Volume 6, Issue 10, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@Article{demetrescu_et_al:DagRep.6.10.1,
  author =	{Demetrescu, Camil and Erdweg, Sebastian and Hammer, Matthew A. and Krishnamurthi, Shriram},
  title =	{{Programming Language Techniques for Incremental and Reactive Computing (Dagstuhl Seminar 16402)}},
  pages =	{1--12},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{10},
  editor =	{Demetrescu, Camil and Erdweg, Sebastian and Hammer, Matthew A. and Krishnamurthi, Shriram},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.10.1},
  URN =		{urn:nbn:de:0030-drops-69491},
  doi =		{10.4230/DagRep.6.10.1},
  annote =	{Keywords: Incremental computing, reactive programming, memoization, change propagation, dynamic dependency graph, dataflow programming, live programming}
}
Document
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111)

Authors: Daniel Delling, Camil Demetrescu, David S. Johnson, and Jan Vitek

Published in: Dagstuhl Reports, Volume 6, Issue 3 (2016)


Abstract
This report documents the talks and discussions at the Dagstuhl seminar 16111 "Rethinking Experimental Methods in Computing". The seminar brought together researchers from several computer science communities, including algorithm engineering, programming languages, information retrieval, high-performance computing, operations research, performance analysis, embedded systems, distributed systems, and software engineering. The main goals of the seminar were building a network of experimentalists and fostering a culture of sound quantitative experiments in computing. During the seminar, groups of participants have worked on distilling useful resources based on the collective experience gained in different communities and on planning actions to promote sound experimental methods and reproducibility efforts.

Cite as

Daniel Delling, Camil Demetrescu, David S. Johnson, and Jan Vitek. Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). In Dagstuhl Reports, Volume 6, Issue 3, pp. 24-43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@Article{delling_et_al:DagRep.6.3.24,
  author =	{Delling, Daniel and Demetrescu, Camil and Johnson, David S. and Vitek, Jan},
  title =	{{Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111)}},
  pages =	{24--43},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{3},
  editor =	{Delling, Daniel and Demetrescu, Camil and Johnson, David S. and Vitek, Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.3.24},
  URN =		{urn:nbn:de:0030-drops-61463},
  doi =		{10.4230/DagRep.6.3.24},
  annote =	{Keywords: Algorithms, Benchmarks, Data sets, Experiments, Repeatability, Reproducibility, Software Artifacts, Statistics}
}
Document
Front Matter, Table of Contents

Authors: Camil Demetrescu and Matthew Flatt

Published in: DARTS, Volume 1, Issue 1, Special Issue of the 29th European Conference on Object-Oriented Programming (ECOOP 2015)


Abstract
Front Matter, Table of Contents

Cite as

Special Issue of the 29th European Conference on Object-Oriented Programming (ECOOP 2015). Dagstuhl Artifacts Series (DARTS), Volume 1, Issue 1, pp. 0:i-0:vi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@Article{demetrescu_et_al:DARTS.1.1.0,
  author =	{Demetrescu, Camil and Flatt, Matthew},
  title =	{{Front Matter, Table of Contents}},
  pages =	{0:i--0:vi},
  journal =	{Dagstuhl Artifacts Series},
  ISSN =	{2509-8195},
  year =	{2016},
  volume =	{1},
  number =	{1},
  editor =	{Demetrescu, Camil and Flatt, Matthew},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DARTS.1.1.0},
  URN =		{urn:nbn:de:0030-drops-61407},
  doi =		{10.4230/DARTS.1.1.0},
  annote =	{Keywords: Front Matter, Table of Contents}
}
Document
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)

Authors: Camil Demetrescu, Michael Kaufmann, Stephen Kobourov, and Petra Mutzel

Published in: Dagstuhl Reports, Volume 1, Issue 5 (2011)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11191 ``Graph Drawing with Algorithm Engineering Methods''. We summarize the talks, open problems, and working group discussions.

Cite as

Camil Demetrescu, Michael Kaufmann, Stephen Kobourov, and Petra Mutzel. Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). In Dagstuhl Reports, Volume 1, Issue 5, pp. 47-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@Article{demetrescu_et_al:DagRep.1.5.47,
  author =	{Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra},
  title =	{{Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)}},
  pages =	{47--60},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Demetrescu, Camil and Kaufmann, Michael and Kobourov, Stephen and Mutzel, Petra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.47},
  URN =		{urn:nbn:de:0030-drops-32046},
  doi =		{10.4230/DagRep.1.5.47},
  annote =	{Keywords: Algorithm Engineering, Graph Drawing}
}
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