Write a Blog >>
SPLASH 2019
Sun 20 - Fri 25 October 2019 Athens, Greece

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.

Accepted Talks

Title
An Incremental Locking Scheme for Transactional Editing
IC
Differential dataflow: a model and implementationKeynote
IC
From Whole Program Compilation to Incremental Compilation: A Critical Case
IC
Pre-print
Generating Incremental Type Services
IC
Incremental Datalog Prototype in Soufflé
IC
Incrementalizing inter-procedural program analyses with recursive aggregation in Datalog
IC
Pre-print
Precise, Efficient, and Expressive Incremental Build Scripts with PIE
IC
Pre-print File Attached
The meaning of a program change is a change to the program’s meaning
IC
Pre-print
Toward Lazy Evaluation in a Graph Database
IC

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.

Workshop Structure

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

Submission guidelines

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.

Plenary
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Mon 21 Oct
Times are displayed in time zone: Beirut change

09:00 - 10:30
KeynoteIC at Room 3A
Chair(s): Tamás Szabóitemis / JGU Mainz
09:00
90m
Talk
Differential dataflow: a model and implementationKeynote
IC
K: Frank McSherryMaterialize, Inc
10:30 - 11:00
Coffee breakCatering at Break area
10:30
30m
Coffee break
Break
Catering
11:00 - 12:30
Incremental DatalogIC at Room 3A
Chair(s): Neville GrechUniversity of Athens
11:00
30m
Talk
Generating Incremental Type Services
IC
André PacakJGU Mainz, Sebastian ErdwegJGU Mainz
11:30
30m
Talk
Incrementalizing inter-procedural program analyses with recursive aggregation in Datalog
IC
Tamás Szabóitemis / JGU Mainz, Gábor BergmannBudapest University of Technology and Economics / MTA-BME Lendület Research Group on Cyber-Physical Systems, Hungary, Sebastian ErdwegJGU Mainz
Pre-print
12:00
30m
Talk
Incremental Datalog Prototype in Soufflé
IC
David ZhaoThe University of Sydney, Pavle SuboticAmazon, Bernhard ScholzUniversity of Sydney, Australia
12:30 - 14:00
14:00 - 15:30
Incremental IDE servicesIC at Room 3A
Chair(s): Tamás Szabóitemis / JGU Mainz
14:00
30m
Talk
Precise, Efficient, and Expressive Incremental Build Scripts with PIE
IC
Gabriël KonatDelft University of Technology, Roelof SolDelft University of Technology, Sebastian ErdwegJGU Mainz, Eelco VisserDelft University of Technology
Pre-print File Attached
14:30
30m
Talk
From Whole Program Compilation to Incremental Compilation: A Critical Case
IC
Jeff SmitsDelft University of Technology, Gabriël KonatDelft University of Technology, Eelco VisserDelft University of Technology
Pre-print
15:00
30m
Talk
An Incremental Locking Scheme for Transactional Editing
IC
Nils KurowskyFernuni Hagen
15:30 - 16:00
Coffee breakCatering at Break area
15:30
30m
Coffee break
Break
Catering
16:00 - 17:30
Databases & SemanticsIC at Room 3A
Chair(s): Markus Völteritemis/independent
16:00
30m
Talk
Toward Lazy Evaluation in a Graph Database
IC
Jeffrey EymerSUNY Binghamton, Philip DexterSUNY Binghamton, Yu David Liu
16:30
30m
Talk
The meaning of a program change is a change to the program’s meaning
IC
Roly PereraThe Alan Turing Institute
Pre-print