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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
|
% Operating systems
@inproceedings{ LionsOs:Heiser,
address = {Gladstone, QLD, AU},
author = {Gernot Heiser},
booktitle = {Everything Open},
month = apr,
organization = {Linux Australia},
title = {{Lions OS}: Secure -- Fast -- Adaptable},
year = {2024}
}
@misc{ 3L:Hintz,
title = {3L: The Computing System of the Future},
author = {Thomas Hintz},
year = 2016,
note = {Accessed: 2024-06-20},
howpublished = {\url{https://3lproject.org/}}
}
@phdthesis{ securityKernelLambda:Rees,
title={A security kernel based on the lambda-calculus},
author={Rees, Jonathan A},
year={1995},
school={Massachusetts Institute of Technology}
}
@inproceedings{ MIMOSA:Yvon,
author = {Samuel Yvon and Marc Feeley},
editor = {Baptiste Saleil and Michael D. Adams},
title = {Running Scheme On Bare Metal (Experience Report)},
booktitle = {Proceedings of the 2020 Scheme and Functional Programming Workshop,
Online, Virtual Event, August 20-28, 2020},
series = {{CSE} Technical Reports},
volume = {{CSE-TR-001-21}},
pages = {51--65},
publisher = {University of Michigan},
year = {2020},
timestamp = {Tue, 15 Feb 2022 12:32:42 +0100},
biburl = {https://dblp.org/rec/conf/icfp/YvonF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{ContinuationsConcurrency:Hieb,
author = {Hieb, R. and Dybvig, R. Kent},
title = {Continuations and concurrency},
year = {1990},
issue_date = {Mar. 1990},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {25},
number = {3},
issn = {0362-1340},
url = {https://doi.org/10.1145/99164.99178},
doi = {10.1145/99164.99178},
abstract = {Continuations have proven to be useful for implementing a
variety of control structures, including exception handling facilities
and breadth-first searching algorithms. However, traditional
continuations are not useful in the presence of concurrency,
because the notion of the rest of the computation represented by a
continuation does not in general make sense. This paper presents a
new type of continuation, called a process continuation, that may
be used to control tree-structured concurrency. Just as a
traditional continuation represents the rest of a computation from
a given point in the computation, a process continuation represents
the rest of a subcomputation, or process, from a given point in the
subcomputation. Process continuations allow nonlocal exits to
arbitrary points in the process tree and allow the capture of a
subtree of a computation as a composable continuation for later
use. Even in the absence of multiple processes, the precise control
achievable with process continuations makes them more useful than
traditional continuations.},
journal = {SIGPLAN Not.},
month = {feb},
pages = {128–136},
numpages = {9}
}
% Oberon
@book{ Oberon:Wirth,
title={Project Oberon, The Design of an Operating System and Compiler},
author={Niklaus Wirth and Jürg Gutknecht},
year={1992},
isbn={0-201-54428-8},
publisher={Addison-Wesley/ACM Press},
url={https://people.inf.ethz.ch/wirth/ProjectOberon1992.pdf}
}
% Unix
@book{ QuarterCenturyUnix:Salus,
title={A Quarter Century of UNIX},
author={Peter H. Salus},
year={1994},
isbn={0-201-54777-5},
publisher={Addison-Wesley}
}
% Problems with the things we use
@article{ Threads:Lee,
author = {Lee, Edward},
year = {2006},
month = {06},
pages = {33 - 42},
title = {The Problem with Threads},
volume = {39},
journal = {Computer},
doi = {10.1109/MC.2006.180}
}
@inproceedings{ fork:Baumann,
title={A fork () in the road},
author={Baumann, Andrew and Appavoo, Jonathan and Krieger, Orran and
Roscoe, Timothy},
booktitle={Proceedings of the Workshop on Hot Topics in Operating Systems},
pages={14--22},
year={2019}
}
@article{ MythsPL:Shaw,
title={Myths and mythconceptions: what does it mean to be a programming language, anyhow?},
volume={4},
ISSN={2475-1421},
url={http://dx.doi.org/10.1145/3480947},
DOI={10.1145/3480947},
number={HOPL},
journal={Proceedings of the ACM on Programming Languages},
publisher={Association for Computing Machinery (ACM)},
author={Shaw, Mary},
year={2020},
month=jun,
pages={1–44}
}
@article{ SpectreMeltdown:HillMasters,
author={Hill, Mark D. and Masters, Jon and Ranganathan, Parthasarathy and
Turner, Paul and Hennessy, John L.},
journal={IEEE Micro},
title={On the Spectre and Meltdown Processor Security Vulnerabilities},
year={2019},
volume={39},
number={2},
pages={9-19},
keywords={Hardware;Computer architecture;Virtual
machining;Microarchitecture;Microprocessors;Software development},
doi={10.1109/MM.2019.2897677}
}
% Programming languages
@article{ lua:Ierusalimschy,
abstract = {We discuss the main novelties of the implementation of Lua
5.0: its register-based virtual machine, the new algorithm for
optimizing tables used as arrays, the implementation of closures,
and the addition of coroutines.},
author = {Ierusalimschy, Roberto and de Figueiredo, Luiz Henrique and
Celes, Waldemar},
doi = {10.3217/jucs-011-07-1159},
journal = {Journal of Universal Computer Science},
keywords = {Language Lua VM},
number = 7,
pages = {1159--1176},
title = {The Implementation of Lua 5.0},
url = {http://www.jucs.org/jucs_11_7/the_implementation_of_lua},
volume = 11,
year = 2005
}
@article{ LispMachine:Greenblatt,
author = {Greenblatt, Richard D. and Knight, Thomas F. and Holloway, John
T. and Moon, David A.},
title = {A LISP machine},
year = {1980},
issue_date = {March 1980},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {15},
number = {2},
issn = {0163-5840},
url = {https://doi.org/10.1145/1013881.802703},
doi = {10.1145/1013881.802703},
abstract = {LISP is the second oldest computer-programming language still
in active use. Our implementation is based on a powerful
microprogrammed processor designed specifically for LISP. This
processor supports a tagged macro-architecture; it manipulates items
which have a built-in data-type field.The system supports several
important new storage-management features, including a real-time
garbage collector with hardware assist (using the basic algorithm of
Baker).The software itself is written in LISP to a much larger extent
than in previous systems. In fact, there are only two levels in which
code is written: LISP and microcode. Among other things this improves
the consistancy of system interfaces.The system design incorporates the
personal computer philosophy. We believe the personal computer will
predominate in the future since it is preferable to time-sharing in
most cases and technological trends are greatly reducing its cost
penality. In the case of very large programs, the personal computer can
be cost-effective today, due to the phenomenon of thrashing encountered
in time-sharing systems.},
journal = {SIGIR Forum},
month = {mar},
pages = {137–138},
numpages = {2}
}
% Computers
@inproceedings{ riscvSelfHostingComputer:Somlo,
author={Somlo, Gabriel L.},
booktitle={2020 IEEE Security and Privacy Workshops (SPW)},
title={Toward a Trustable, Self-Hosting Computer System},
year={2020},
volume={},
number={},
pages={136-143},
keywords={Privacy;Conferences;Supply chains;Hardware;Software;Trojan
horses;Computer security},
doi={10.1109/SPW50608.2020.00039}
} % https://www.contrib.andrew.cmu.edu/~somlo/BTCP/
@inbook{EvolutionComputing:Larus,
author="Larus, James R.",
editor="Werthner, Hannes
and Ghezzi, Carlo
and Kramer, Jeff
and Nida-R{\"u}melin, Julian
and Nuseibeh, Bashar
and Prem, Erich
and Stanger, Allison",
title="Evolution of Computing",
bookTitle="Introduction to Digital Humanism: A Textbook",
year="2024",
publisher="Springer Nature Switzerland",
address="Cham",
pages="31--45",
abstract="Computers and computing emerged within a lifetime and completely
changed our world. Although their history is brief, the change they
precipitated has been rapid and constant. Today's world would be
unimaginably different without these machines. Not necessarily worse,
but certainly slower, static, disconnected, and poorer. One has to look
back to the steam engine in the nineteenth century or electricity in
the early twentieth century to find technologies with similar rapid and
far-reaching effects. This chapter briefly describes the evolution of
computing and highlights how its growth is closely tied to concerns of
digital humanism.",
isbn="978-3-031-45304-5",
doi="10.1007/978-3-031-45304-5_3",
url="https://doi.org/10.1007/978-3-031-45304-5_3"
}
% ISA design
@article{ GeneralPurposeProcessor:Chisnall,
author = {Chisnall, David},
title = {There’s No Such Thing as a General-purpose Processor: And the
belief in such a device is harmful},
year = {2014},
issue_date = {October 2014},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {12},
number = {10},
issn = {1542-7730},
url = {https://doi.org/10.1145/2685690.2687011},
doi = {10.1145/2685690.2687011},
abstract = {There is an increasing trend in computer architecture to
categorize processors and accelerators as "general purpose." Of the
papers published at this year’s International Symposium on Computer
Architecture (ISCA 2014), nine out of 45 explicitly referred to
general-purpose processors; one additionally referred to
general-purpose FPGAs (field-programmable gate arrays), and another
referred to general-purpose MIMD (multiple instruction, multiple
data) supercomputers, stretching the definition to the breaking point.
This article presents the argument that there is no such thing as a
truly general-purpose processor and that the belief in such a device is
harmful.},
journal = {Queue},
month = {oct},
pages = {20–25},
numpages = {6}
}
@article{LiberateFromVonNeumann:Backus,
author = {Backus, John},
title = {Can programming be liberated from the von Neumann style? a functional style and its algebra of programs},
year = {1978},
issue_date = {Aug. 1978},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {21},
number = {8},
issn = {0001-0782},
url = {https://doi.org/10.1145/359576.359579},
doi = {10.1145/359576.359579},
abstract = {Conventional programming languages are growing ever more
enormous, but not stronger. Inherent defects at the most basic level
cause them to be both fat and weak: their primitive word-at-a-time
style of programming inherited from their common ancestor—the von
Neumann computer, their close coupling of semantics to state
transitions, their division of programming into a world of
expressions and a world of statements, their inability to
effectively use powerful combining forms for building new programs
from existing ones, and their lack of useful mathematical
properties for reasoning about programs.An alternative functional
style of programming is founded on the use of combining forms for
creating programs. Functional programs deal with structured data,
are often nonrepetitive and nonrecursive, are hierarchically
constructed, do not name their arguments, and do not require the
complex machinery of procedure declarations to become generally
applicable. Combining forms can use high level programs to build
still higher level ones in a style not possible in conventional
languages.Associated with the functional style of programming is an
algebra of programs whose variables range over programs and whose
operations are combining forms. This algebra can be used to
transform programs and to solve equations whose “unknowns” are
programs in much the same way one transforms equations in high
school algebra. These transformations are given by algebraic laws
and are carried out in the same language in which programs are
written. Combining forms are chosen not only for their programming
power but also for the power of their associated algebraic laws.
General theorems of the algebra give the detailed behavior and
termination conditions for large classes of programs.A new class of
computing systems uses the functional programming style both in its
programming language and in its state transition rules. Unlike von
Neumann languages, these systems have semantics loosely coupled to
states—only one state transition occurs per major computation.},
journal = {Commun. ACM},
month = {aug},
pages = {613–641},
numpages = {29},
keywords = {von Neumann languages, von Neumann computers, programming
languages, program transformation, program termination, program
correctness, models of computing systems, metacomposition,
functional programming, functional forms, combining forms, applicative
state transition systems, applicative computing systems, algebra of
programs}
}
@inproceedings{CHERI:Woodruff,
author={Woodruff, Jonathan and Watson, Robert N. M. and Chisnall, David and
Moore, Simon W. and Anderson, Jonathan and Davis, Brooks and Laurie, Ben
and Neumann, Peter G. and Norton, Robert and Roe, Michael},
booktitle={2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA)},
title={The CHERI capability model: Revisiting RISC in an age of risk},
url={https://www.cl.cam.ac.uk/research/security/ctsrd/pdfs/201406-isca2014-cheri.pdf},
year={2014},
volume={},
number={},
pages={457-468},
keywords={Ground penetrating radar;Abstracts;Safety;Registers;Coprocessors},
doi={10.1109/ISCA.2014.6853201}
}
% PL popularity
@misc{PLCommunity:Tambad,
title={Analyzing programming languages by community characteristics on
Github and StackOverflow},
author={Samarth Tambad and Rohit Nandwani and Suzanne K. McIntosh},
year={2020},
eprint={2006.01351},
archivePrefix={arXiv},
primaryClass={cs.SE},
url={https://arxiv.org/abs/2006.01351},
}
% FPGA reconfiguration
@article{ FPGAReconf:Vipin,
author = {Vipin, Kizheppatt and Fahmy, Suhaib A.},
title = {FPGA Dynamic and Partial Reconfiguration: A Survey of
Architectures, Methods, and Applications},
year = {2018},
issue_date = {July 2019},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {51},
number = {4},
issn = {0360-0300},
url = {https://doi.org/10.1145/3193827},
doi = {10.1145/3193827},
abstract = {Dynamic and partial reconfiguration are key differentiating
capabilities of field programmable gate arrays (FPGAs). While they have
been studied extensively in academic literature, they find limited use
in deployed systems. We review FPGA reconfiguration, looking at
architectures built for the purpose, and the properties of modern
commercial architectures. We then investigate design flows and identify
the key challenges in making reconfigurable FPGA systems easier to
design. Finally, we look at applications where reconfiguration has
found use, as well as proposing new areas where this capability places
FPGAs in a unique position for adoption.},
journal = {ACM Comput. Surv.},
month = {jul},
articleno = {72},
numpages = {39},
keywords = {partial reconfiguration, dynamic reconfiguration, Field
programmable gate arrays}
}
|