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
|
% 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}
}
% 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}
}
% 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
}
% 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/
% 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}}
|