Index: doc/theses/mike_brooks_MMath/intro.tex =================================================================== --- doc/theses/mike_brooks_MMath/intro.tex (revision 96b0e49992f694d187be2f63a3b7938da27f5e21) +++ doc/theses/mike_brooks_MMath/intro.tex (revision 69ab896b1b8be1526e572697e23555f39cfbd80b) @@ -1,3 +1,7 @@ \chapter{Introduction} + +\cite{Blache19} +\cite{Oorschot23} +\cite{Ruef19} \section{Arrays} Index: doc/theses/mike_brooks_MMath/uw-ethesis.bib =================================================================== --- doc/theses/mike_brooks_MMath/uw-ethesis.bib (revision 96b0e49992f694d187be2f63a3b7938da27f5e21) +++ doc/theses/mike_brooks_MMath/uw-ethesis.bib (revision 69ab896b1b8be1526e572697e23555f39cfbd80b) @@ -4,22 +4,17 @@ % -------------------------------------------------- % Cforall + @misc{cfa:frontpage, - url = {https://cforall.uwaterloo.ca/} + url = {https://cforall.uwaterloo.ca} } @article{cfa:typesystem, - author = {Aaron Moss and Robert Schluntz and Peter A. Buhr}, - title = {{\CFA} : Adding modern programming language features to {C}}, - journal = {Softw. Pract. Exp.}, - volume = {48}, - number = {12}, - pages = {2111--2146}, - year = {2018}, - url = {https://doi.org/10.1002/spe.2624}, - doi = {10.1002/spe.2624}, - timestamp = {Thu, 09 Apr 2020 17:14:14 +0200}, - biburl = {https://dblp.org/rec/journals/spe/MossSB18.bib}, - bibsource = {dblp computer science bibliography, https://dblp.org} + author = {Aaron Moss and Robert Schluntz and Peter A. Buhr}, + title = {{\CFA} : Adding modern programming language features to {C}}, + journal = {Softw. Pract. Exp.}, + volume = {48}, + number = {12}, + pages = {2111--2146}, + year = {2018}, } - % -------------------------------------------------- @@ -27,41 +22,29 @@ @inproceedings{arr:futhark:tytheory, - author = {Henriksen, Troels and Elsman, Martin}, - title = {Towards Size-Dependent Types for Array Programming}, - year = {2021}, - isbn = {9781450384667}, - publisher = {Association for Computing Machinery}, - address = {New York, NY, USA}, - url = {https://doi.org/10.1145/3460944.3464310}, - doi = {10.1145/3460944.3464310}, - abstract = {We present a type system for expressing size constraints on array types in an ML-style type system. The goal is to detect shape mismatches at compile-time, while being simpler than full dependent types. The main restrictions is that the only terms that can occur in types are array sizes, and syntactically they must be variables or constants. For those programs where this is not sufficient, we support a form of existential types, with the type system automatically managing the requisite book-keeping. We formalise a large subset of the type system in a small core language, which we prove sound. We also present an integration of the type system in the high-performance parallel functional language Futhark, and show on a collection of 44 representative programs that the restrictions in the type system are not too problematic in practice.}, - booktitle = {Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming}, - pages = {1–14}, - numpages = {14}, - keywords = {functional programming, parallel programming, type systems}, - location = {Virtual, Canada}, - series = {ARRAY 2021} + author = {Troels Henriksen and Martin Elsman}, + title = {Towards Size-Dependent Types for Array Programming}, + year = {2021}, + publisher = {Association for Computing Machinery}, + address = {New York, NY, USA}, + booktitle = {Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming}, + pages = {1-14}, + numpages = {14}, + location = {Virtual, Canada}, + series = {ARRAY 2021} } @article{arr:dex:long, - author = {Adam Paszke and - Daniel D. Johnson and - David Duvenaud and - Dimitrios Vytiniotis and - Alexey Radul and - Matthew J. Johnson and - Jonathan Ragan{-}Kelley and - Dougal Maclaurin}, - title = {Getting to the Point. Index Sets and Parallelism-Preserving Autodiff - for Pointful Array Programming}, - journal = {CoRR}, - volume = {abs/2104.05372}, - year = {2021}, - url = {https://arxiv.org/abs/2104.05372}, - eprinttype = {arXiv}, - eprint = {2104.05372}, - timestamp = {Mon, 25 Oct 2021 07:55:47 +0200}, - biburl = {https://dblp.org/rec/journals/corr/abs-2104-05372.bib}, - bibsource = {dblp computer science bibliography, https://dblp.org} + author = {Adam Paszke and Daniel D. Johnson and David Duvenaud and + Dimitrios Vytiniotis and Alexey Radul and Matthew J. Johnson and + Jonathan Ragan-Kelley and Dougal Maclaurin}, + title = {Getting to the Point. Index Sets and Parallelism-Preserving Autodiff + for Pointful Array Programming}, + publisher = {Association for Computing Machinery}, + address = {New York, NY, USA}, + volume = 5, + number = {ICFP}, + year = 2021, + journal = {Proc. ACM Program. Lang.}, + month = {aug}, } @@ -74,18 +57,48 @@ title = {\textsf{C}$\mathbf{\forall}$ Stack Evaluation Programs}, year = 2018, - howpublished= {\href{https://cforall.uwaterloo.ca/CFAStackEvaluation.zip}{https://cforall.uwaterloo.ca/\-CFAStackEvaluation.zip}}, + howpublished= {\url{https://cforall.uwaterloo.ca/CFAStackEvaluation.zip}}, } @misc{lst:linuxq, - title = {queue(7) — Linux manual page}, - howpublished= {\href{https://man7.org/linux/man-pages/man3/queue.3.html}{https://man7.org/linux/man-pages/man3/queue.3.html}}, + title = {queue(7) -- Linux manual page}, + howpublished= {\url{https://man7.org/linux/man-pages/man3/queue.3.html}}, } - % see also https://man7.org/linux/man-pages/man7/queue.7.license.html - % https://man7.org/tlpi/ - % https://www.kernel.org/doc/man-pages/ +% see also https://man7.org/linux/man-pages/man7/queue.7.license.html +% https://man7.org/tlpi/ +% https://www.kernel.org/doc/man-pages/ @misc{lst:stl, - title = {std::list}, - howpublished= {\href{https://en.cppreference.com/w/cpp/container/list}{https://en.cppreference.com/w/cpp/container/list}}, + title = {std::list}, + howpublished= {\url{https://en.cppreference.com/w/cpp/container/list}}, } +@article{Blache19, + author = {Gunter Blache}, + title = {Handling Index-out-of-bounds in safety-critical embedded {C} code using model-based development}, + journal = {Software \& Systems Modeling}, + volume = 18, + year = 2019, + pages = {1795-1805}, +} + +@article{Oorschot23, + author = {van Oorschot, Paul C.}, + journal = {IEEE Security \& Privacy}, + title = {Memory Errors and Memory Safety: {C} as a Case Study}, + year = 2023, + volume = 21, + number = 2, + pages = {70-76}, +} + +@InProceedings{Ruef19, + author = {Andrew Ruef and Leonidas Lampropoulos and Ian Sweet and David Tarditi and Michael Hicks}, + title = {Achieving Safety Incrementally with {Checked C}}, + editor = {Flemming Nielson and David Sands}, + booktitle = {Principles of Security and Trust}, + publisher = {Springer International Publishing}, + address = {Cham}, + year = {2019}, + pages = {76-98}, +} + Index: doc/theses/mike_brooks_MMath/uw-ethesis.tex =================================================================== --- doc/theses/mike_brooks_MMath/uw-ethesis.tex (revision 96b0e49992f694d187be2f63a3b7938da27f5e21) +++ doc/theses/mike_brooks_MMath/uw-ethesis.tex (revision 69ab896b1b8be1526e572697e23555f39cfbd80b) @@ -129,4 +129,5 @@ urlcolor=black }}{} % end of ifthenelse (no else) +\urlstyle{sf} %\usepackage[automake,toc,abbreviations]{glossaries-extra} % Exception to the rule of hyperref being the last add-on package