The Second Workshop on Incremental Computing (IC) will provide a space where PL enthusiasts and researchers can come to discuss incremental computing problems and solutions. A computation is incremental if repeating it with a changed input is faster than from-scratch re-computation. Incremental computations can be found across a wide range of computing domains, and thus across many areas of computer science. Consider the following examples:
- interactive features of integrated development environments (including incremental parsing, typing, program analysis, verification, and testing)
- the database view maintenance problem
- incremental compilation management
- the rendering pipeline of web browsers
- artificial intelligence and planning in games and in robots
- motion simulation in computational geometry
- spreadsheet evaluation.
In each problem domain, practitioners engineer incremental computations to fulfill a practical need: Without these techniques, a system may be too unresponsive or inefficient to be useful, or at the very least, its utility would degrade.
In the area of PL, researchers are particularly interested in language-based approaches to incremental computation. In contrast to the algorithms community that often studies each incremental problem in isolation (e.g., incremental convex hull), PL researchers study large classes of incremental programs that are defined by a programming language. The scope of this programming language may vary, and be intended as general-purpose or domain-specific. In either case, the language and associated algorithmic techniques express the behavior of many incremental programs.
Call for Presentations
A good talk at IC probably consists of one or more of the following:
- explain an existing language or framework for incremental computing,
- outline an incremental computing domain in detail, highlighting challenges,
- outline a new incremental computing problem, or problem domain,
- propose a new language or framework for incremental computing.
This list is not exhaustive, but merely suggestive.
The one-day workshop will be structured to include the following activities:
- Submitted talks, ~20 minutes, plus ~10 minutes for interleaved discussion
- Longer invited talks
Submissions for talks: Authors will submit at most a 2-page (excluding bibliography) PDF document, in at least 10pt font, printable on US Letter paper. Authors are free to include links to multi-media content such as github projects, youtube videos or online demos. Reviewers may or may not view linked documents (it is up to authors to convince them to do so in their 2-page submission). Authors should not assume that reviewers will be experts in the particular area of the submission – they will most likely not be. All submissions should be accessible to a wide range of programming language researchers.
Submission will be handled through https://ic2019.hotcrp.com.
Reviewing of submissions will be very light. Authors should not expect a detailed analysis of their submission by the program committee. Accepted submissions will be posted as is on this web site. By submitting a document, you agree that if it is accepted, it may be posted and you agree that one of the co-authors will attend the workshop and give a talk there. There will be no revision process and no formal publication.
Mon 21 OctDisplayed time zone: Beirut change
09:00 - 10:30
|Differential dataflow: a model and implementationKeynote|
K: Frank McSherry Materialize, Inc
11:00 - 12:30
|Generating Incremental Type Services|
|Incrementalizing inter-procedural program analyses with recursive aggregation in Datalog|
Tamás Szabó itemis / JGU Mainz, Gábor Bergmann Budapest University of Technology and Economics / MTA-BME Lendület Research Group on Cyber-Physical Systems, Hungary, Sebastian Erdweg JGU MainzPre-print
|Incremental Datalog Prototype in Soufflé|
14:00 - 15:30
|Precise, Efficient, and Expressive Incremental Build Scripts with PIE|
Gabriël Konat Delft University of Technology, Roelof Sol Delft University of Technology, Sebastian Erdweg JGU Mainz, Eelco Visser Delft University of TechnologyPre-print File Attached
|From Whole Program Compilation to Incremental Compilation: A Critical Case|
Jeff Smits Delft University of Technology, Gabriël Konat Delft University of Technology, Eelco Visser Delft University of TechnologyPre-print
|An Incremental Locking Scheme for Transactional Editing|
Nils Kurowsky Fernuni Hagen
16:00 - 17:30
|Toward Lazy Evaluation in a Graph Database|
|The meaning of a program change is a change to the program’s meaning|
Roly Perera The Alan Turing InstitutePre-print