Repository navigation
Expand file tree
/
Copy pathindex.html
More file actions
185 lines (154 loc) · 6.04 KB
/
Copy pathindex.html
File metadata and controls
185 lines (154 loc) · 6.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
<!DOCTYPE html>
<html lang="en" xml:lang="en"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>AutoInc</title>
<!-- <link rel="stylesheet" href="./css/main.css" type="text/css"> -->
<style>
body {
font-family: 'Segoe UI', Tahoma, Geneva, Verdana, sans-serif;
font-size: 20px;
margin: 2em;
background-color: #cff8fa;
color: #333;
}
p {
font-size: 20px;
}
ul {
font-size: 20px;
}
#page {
padding: 10pt 10pt 10pt 10pt;
margin: 0;
color: #000000;
background: #cff8fa;
max-width: 750pt;
border:0px;
margin-left: auto;
margin-right: auto;
position: relative;
text-align: justify;
font-size: 14px;
line-height: 1.1;
}
#title {
border-radius: 10pt 10pt 0 0;
padding: 10pt 10pt 10pt 10pt;
margin: 0;
overflow: hidden;
border:0;
max-width: 750pt;
position: relative;
margin-left: auto;
margin-right: auto;
}
#erclogo {
float :inline-end;
margin: 0;
border: none ;
border-radius: 10pt 10pt 10pt 10pt;
}
h3 {
font-size: 2em;
margin-bottom: 0.5em;
border-bottom: 3px solid #4a90e2;
display: inline-block;
}
h4 {
font-size: 1.4em;
margin: 1.5em 0 0.5em;
color: #4a4a4a;
}
.member-list.vertical {
display: flex;
flex-direction: column;
gap: 0.8em;
}
.member-card {
background-color: #e2fcff;
border-radius: 10px;
padding: 0.8em 1em;
box-shadow: 0 2px 6px rgba(0,0,0,0.08);
transition: transform 0.2s ease;
width: fit-content;
}
.member-card:hover {
transform: scale(1.02);
}
.member-link {
text-decoration: none;
color: #2b6cb0;
font-weight: 500;
display: flex;
align-items: center;
gap: 0.5em;
font-size: 1.2rem
}
.member-link:hover {
color: #1a4368;
}
.icon {
font-size: 1.1em;
}
.member-info {
display: flex;
flex-direction: column;
}
.member-name {
font-weight: 600;
color: #2b6cb0;
}
.member-role {
font-size: 0.95rem;
color: #666;
}
</style>
</head>
<body>
<div id="title">
<h2>AutoInc: Asymptotic Speedups for Free through Automatic Incremental Computing</h2>
</div>
<div id="page">
<img id="erclogo" src="./assets/ERC_logo.svg" width="200" height="180">
<h3>Objective</h3>
<p>The energy consumption of data centers and ICT devices grows at an alarming rate and will be responsible for up to 20% of the global energy consumption by 2030. To sustain the ongoing digital transformation, we must find ways to run software dramatically more efficiently. A promising direction is <em>incremental computing</em>. Incremental computations react to input changes rather than recomputing their result from scratch, which is known to deliver asymptotic speedups in theory and order-of-magnitude speedups in practice.
</p><p>
However, current approaches to incrementality have limited applicability: They either require expert knowledge, or only support specialized domains (e.g. database queries), or only yield modest speedups. The goal of this project is to develop a methodology for automatically incrementalizing computations and significantly improving their time and energy efficiency.
</p><p>
The AutoInc project achieves this ambitious goal by establishing a novel foundation for <em>incremental computing</em> in three complementary parts:
<ul>
<li>A library of incremental operators for atomic and other essential data types,</li>
<li>A low-level intermediate representation (IR) for describing compositional incremental computations,</li>
<li>An optimizing compiler that translates existing code to the low-level incremental IR.</li>
</ul>
</p>
<h3>Team</h3>
<p>The <a href="https://pl.ipd.kit.edu/staff.php">PL Team</a> from KIT.</p>
<h3>Publications</h3>
<p><a href="https://dl.acm.org/doi/10.1145/3798261">Differential Execution with Lexical Tracing</a>.
Sebastian Erdweg, Runqing Xu, and Mo Bitar.
<i>Proceedings of the ACM on Programming Languages (OOPSLA1). 2026</i>
</p>
<p><a href="https://dl.acm.org/doi/10.1145/3776728">Stateful Differential Operators for Incremental Computing</a>.
Runqing Xu and Sebastian Erdweg.
<i>Proceedings of the ACM on Programming Languages (POPL). 2026</i>
</p>
<p><a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2025.20">Incremental Computing by Differential Execution</a>.
Prashant Kumar, André Pacak, and Sebastian Erdweg.
<i>European Conference on Object-Oriented Programming (ECOOP). 2025</i>
</p>
<p><a href="https://publikationen.bibliothek.kit.edu/1000187537/170103974">Mono types --- First-Class Containers for Datalog</a>.
Runqing Xu, David Klopp, and Sebastian Erdweg.
<i>European Conference on Object-Oriented Programming (ECOOP). 2025</i>
</p>
<p><a href="https://publikationen.bibliothek.kit.edu/1000188610/171091116">A Typed Multi-level Datalog IR and Its Compiler Framework</a>. David Klopp, Sebastian Erdweg, and André Pacak. <i>Proceedings of the ACM on Programming Languages (OOPSLA). 2024</i>
</p>
<p><a href="https://publikationen.bibliothek.kit.edu/1000188609/171101142">Object-Oriented Fixpoint Programming with Datalog</a>. David Klopp, Sebastian Erdweg, and André Pacak. <i>Proceedings of the ACM on Programming Languages (OOPSLA). 2024</i>
</p>
<p><a href="https://www.pl.informatik.uni-mainz.de/files/2024/10/datalog-modules.pdf">Separate Compilation and Partial Linking: Modules for Datalog IR
</a>. David Klopp, André Pacak, and Sebastian Erdweg. <i>Proceedings of Generative Programming: Concepts & Experiences (GPCE). 2024</i>
</p>
<p><a href="https://www.pl.informatik.uni-mainz.de/files/2024/10/sturdy-java-bytecode.pdf">Abstract Interpretation of Java Bytecode in Sturdy</a>. Stefan Marx and Sebastian Erdweg. <i>Proceedings of the 26th ACM International Workshop on Formal Techniques for Java-like Programs (FTfJP). 2024</i></p>
<hr>
<p><em>This project is supported by ERC grant <a href="https://doi.org/10.3030/101125325">Asymptotic Speedups for Free through Automatic Incremental Computing</a></em></p>
<small>Last overhaul of this page: January 2026</small>
</body></html>