Changeset 19a2890


Ignore:
Timestamp:
Dec 15, 2023, 9:30:23 AM (12 months ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
master
Children:
69ab896
Parents:
ca9d65e
Message:

small proofreading changes

Location:
doc/theses/mike_brooks_MMath
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/mike_brooks_MMath/intro.tex

    rca9d65e r19a2890  
    11\chapter{Introduction}
     2
     3\cite{Blache19}
     4\cite{Oorschot23}
     5\cite{Ruef19}
    26
    37\section{Arrays}
  • doc/theses/mike_brooks_MMath/uw-ethesis.bib

    rca9d65e r19a2890  
    44% --------------------------------------------------
    55% Cforall
     6
    67@misc{cfa:frontpage,
    7   url = {https://cforall.uwaterloo.ca/}
     8    url         = {https://cforall.uwaterloo.ca}
    89}
    910@article{cfa:typesystem,
    10   author    = {Aaron Moss and Robert Schluntz and Peter A. Buhr},
    11   title     = {{\CFA} : Adding modern programming language features to {C}},
    12   journal   = {Softw. Pract. Exp.},
    13   volume    = {48},
    14   number    = {12},
    15   pages     = {2111--2146},
    16   year      = {2018},
    17   url       = {https://doi.org/10.1002/spe.2624},
    18   doi       = {10.1002/spe.2624},
    19   timestamp = {Thu, 09 Apr 2020 17:14:14 +0200},
    20   biburl    = {https://dblp.org/rec/journals/spe/MossSB18.bib},
    21   bibsource = {dblp computer science bibliography, https://dblp.org}
     11    author    = {Aaron Moss and Robert Schluntz and Peter A. Buhr},
     12    title     = {{\CFA} : Adding modern programming language features to {C}},
     13    journal   = {Softw. Pract. Exp.},
     14    volume    = {48},
     15    number    = {12},
     16    pages     = {2111--2146},
     17    year      = {2018},
    2218}
    23 
    2419
    2520% --------------------------------------------------
     
    2722
    2823@inproceedings{arr:futhark:tytheory,
    29     author = {Henriksen, Troels and Elsman, Martin},
    30     title = {Towards Size-Dependent Types for Array Programming},
    31     year = {2021},
    32     isbn = {9781450384667},
    33     publisher = {Association for Computing Machinery},
    34     address = {New York, NY, USA},
    35     url = {https://doi.org/10.1145/3460944.3464310},
    36     doi = {10.1145/3460944.3464310},
    37     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.},
    38     booktitle = {Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming},
    39     pages = {1–14},
    40     numpages = {14},
    41     keywords = {functional programming, parallel programming, type systems},
    42     location = {Virtual, Canada},
    43     series = {ARRAY 2021}
     24    author      = {Troels Henriksen and Martin Elsman},
     25    title       = {Towards Size-Dependent Types for Array Programming},
     26    year        = {2021},
     27    publisher   = {Association for Computing Machinery},
     28    address     = {New York, NY, USA},
     29    booktitle   = {Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming},
     30    pages       = {1-14},
     31    numpages    = {14},
     32    location    = {Virtual, Canada},
     33    series      = {ARRAY 2021}
    4434}
    4535
    4636@article{arr:dex:long,
    47   author    = {Adam Paszke and
    48                Daniel D. Johnson and
    49                David Duvenaud and
    50                Dimitrios Vytiniotis and
    51                Alexey Radul and
    52                Matthew J. Johnson and
    53                Jonathan Ragan{-}Kelley and
    54                Dougal Maclaurin},
    55   title     = {Getting to the Point. Index Sets and Parallelism-Preserving Autodiff
    56                for Pointful Array Programming},
    57   journal   = {CoRR},
    58   volume    = {abs/2104.05372},
    59   year      = {2021},
    60   url       = {https://arxiv.org/abs/2104.05372},
    61   eprinttype = {arXiv},
    62   eprint    = {2104.05372},
    63   timestamp = {Mon, 25 Oct 2021 07:55:47 +0200},
    64   biburl    = {https://dblp.org/rec/journals/corr/abs-2104-05372.bib},
    65   bibsource = {dblp computer science bibliography, https://dblp.org}
     37    author      = {Adam Paszke and Daniel D. Johnson and David Duvenaud and
     38                   Dimitrios Vytiniotis and Alexey Radul and Matthew J. Johnson and
     39                   Jonathan Ragan-Kelley and Dougal Maclaurin},
     40    title       = {Getting to the Point. Index Sets and Parallelism-Preserving Autodiff
     41                   for Pointful Array Programming},
     42    publisher   = {Association for Computing Machinery},
     43    address     = {New York, NY, USA},
     44    volume      = 5,
     45    number      = {ICFP},
     46    year        = 2021,
     47    journal     = {Proc. ACM Program. Lang.},
     48    month       = {aug},
    6649}
    6750
     
    7457    title       = {\textsf{C}$\mathbf{\forall}$ Stack Evaluation Programs},
    7558    year        = 2018,
    76     howpublished= {\href{https://cforall.uwaterloo.ca/CFAStackEvaluation.zip}{https://cforall.uwaterloo.ca/\-CFAStackEvaluation.zip}},
     59    howpublished= {\url{https://cforall.uwaterloo.ca/CFAStackEvaluation.zip}},
    7760}
    7861
    7962@misc{lst:linuxq,
    80   title     = {queue(7) — Linux manual page},
    81   howpublished= {\href{https://man7.org/linux/man-pages/man3/queue.3.html}{https://man7.org/linux/man-pages/man3/queue.3.html}},
     63    title       = {queue(7) -- Linux manual page},
     64    howpublished= {\url{https://man7.org/linux/man-pages/man3/queue.3.html}},
    8265}
    83   % see also https://man7.org/linux/man-pages/man7/queue.7.license.html
    84   %          https://man7.org/tlpi/
    85   %          https://www.kernel.org/doc/man-pages/
     66% see also https://man7.org/linux/man-pages/man7/queue.7.license.html
     67%          https://man7.org/tlpi/
     68%          https://www.kernel.org/doc/man-pages/
    8669
    8770@misc{lst:stl,
    88   title     = {std::list},
    89   howpublished= {\href{https://en.cppreference.com/w/cpp/container/list}{https://en.cppreference.com/w/cpp/container/list}},
     71    title       = {std::list},
     72    howpublished= {\url{https://en.cppreference.com/w/cpp/container/list}},
    9073}
    9174
     75@article{Blache19,
     76    author      = {Gunter Blache},
     77    title       = {Handling Index-out-of-bounds in safety-critical embedded {C} code using model-based development},
     78    journal     = {Software \& Systems Modeling},
     79    volume      = 18,
     80    year        = 2019,
     81    pages       = {1795-1805},
     82}
     83
     84@article{Oorschot23,
     85    author      = {van Oorschot, Paul C.},
     86    journal     = {IEEE Security \& Privacy},
     87    title       = {Memory Errors and Memory Safety: {C} as a Case Study},
     88    year        = 2023,
     89    volume      = 21,
     90    number      = 2,
     91    pages       = {70-76},
     92}
     93
     94@InProceedings{Ruef19,
     95    author      = {Andrew Ruef and Leonidas Lampropoulos and Ian Sweet and David Tarditi and Michael Hicks},
     96    title       = {Achieving Safety Incrementally with {Checked C}},
     97    editor      = {Flemming Nielson and David Sands},
     98    booktitle   = {Principles of Security and Trust},
     99    publisher   = {Springer International Publishing},
     100    address     = {Cham},
     101    year        = {2019},
     102    pages       = {76-98},
     103}
     104
  • doc/theses/mike_brooks_MMath/uw-ethesis.tex

    rca9d65e r19a2890  
    129129    urlcolor=black
    130130}}{} % end of ifthenelse (no else)
     131\urlstyle{sf}
    131132
    132133%\usepackage[automake,toc,abbreviations]{glossaries-extra} % Exception to the rule of hyperref being the last add-on package
Note: See TracChangeset for help on using the changeset viewer.