6253 lines
194 KiB
BibTeX
6253 lines
194 KiB
BibTeX
@PREAMBLE{ {\providecommand{\noopsort}[1]{}} }
|
||
@STRING{acm = "ACM" }
|
||
@STRING{dagstuhl= "Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik" }
|
||
@STRING{elsevier= "Elsevier" }
|
||
@STRING{entcs = "ENTCS" }
|
||
@STRING{lipics = "LIPIcs" }
|
||
@STRING{lnai = "LNAI" }
|
||
@STRING{lncs = "LNCS" }
|
||
@STRING{lnm = "LNM" }
|
||
@STRING{springer= "Springer" }
|
||
|
||
@Article{ Staton11,
|
||
author = {Sam Staton},
|
||
title = {Relating coalgebraic notions of bisimulation},
|
||
journal = {Log.\ Methods Comput.\ Sci.},
|
||
year = {2011},
|
||
volume = {7}
|
||
}
|
||
|
||
@Proceedings{ 2015IEEE,
|
||
title = {2015 {IEEE} Symposium on Security and Privacy, {SP} 2015,
|
||
San Jose, CA, USA, May 17-21, 2015},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2015},
|
||
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7160813},
|
||
timestamp = {Wed, 29 Mar 2017 16:45:25 +0200}
|
||
}
|
||
|
||
@Proceedings{ 32ndIEEE,
|
||
title = {32nd {IEEE} Computer Security Foundations Symposium, {CSF}
|
||
2019, Hoboken, NJ, USA, June 25-28, 2019},
|
||
publisher = {{IEEE}},
|
||
year = {2019},
|
||
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8804915},
|
||
timestamp = {Mon, 09 Sep 2019 15:38:56 +0200}
|
||
}
|
||
|
||
@InProceedings{ WatsonAndersonEtAlUP,
|
||
title = {Capsicum: Practical Capabilities for UNIX.},
|
||
author = {Watson, Robert NM and Anderson, Jonathan and Laurie, Ben
|
||
and Kennaway, Kris}
|
||
}
|
||
|
||
@Misc{ CVE-2015-1730,
|
||
title = {{CVE}-2015-1730.},
|
||
howpublished = "Available from MITRE, {CVE-ID} {CVE}-2015-1730.",
|
||
month = jun # "~9",
|
||
year = {2015},
|
||
url = {http://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2015-1730},
|
||
urldate = {29 April 2019}
|
||
}
|
||
|
||
@Misc{ CVE-2017-7756,
|
||
title = {{CVE}-2017-7756.},
|
||
howpublished = "Available from MITRE, {CVE-ID} {CVE}-2017-7756.",
|
||
month = jun # "~11",
|
||
year = {2018},
|
||
url = {http://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2017-7756},
|
||
urldate = {29 April 2019}
|
||
}
|
||
|
||
@InProceedings{ FeiertagNeumannUP,
|
||
title = {The foundations of a provably secure operating system
|
||
(PSOS)},
|
||
author = {Feiertag, Richard J and Neumann, Peter G}
|
||
}
|
||
|
||
@Proceedings{ IEEE29th,
|
||
title = {{IEEE} 29th Computer Security Foundations Symposium, {CSF}
|
||
2016, Lisbon, Portugal, June 27 - July 1, 2016},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2016},
|
||
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7518122},
|
||
timestamp = {Mon, 19 Sep 2016 15:37:09 +0200}
|
||
}
|
||
|
||
@Manual{ Intel64,
|
||
url = {https://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-software-developer-instruction-set-reference-manual-325383.pdf},
|
||
organization = {Intel Corporation},
|
||
title = {Intel 64 and IA-32 Architectures Software Developer's
|
||
Manual},
|
||
year = 2016
|
||
}
|
||
|
||
@Manual{ MIPSArchitecture,
|
||
url = {https://s3-eu-west-1.amazonaws.com/downloads-mips/documents/MD00086-2B-MIPS32BIS-AFP-6.06.pdf},
|
||
organization = {MIPS Technologies},
|
||
title = {MIPS Architecture for Programmers Volume II-A: The MIPS32
|
||
Instruction Set Manual},
|
||
year = 2016
|
||
}
|
||
|
||
@Proceedings{ Proceedings12th,
|
||
title = {Proceedings, 12th Annual {IEEE} Symposium on Logic in
|
||
Computer Science, Warsaw, Poland, June 29 - July 2, 1997},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1997},
|
||
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4856},
|
||
timestamp = {Fri, 21 Nov 2014 14:08:56 +0100}
|
||
}
|
||
|
||
@Proceedings{ Proceedings24th,
|
||
title = {Proceedings of the 24th {IEEE} Computer Security
|
||
Foundations Symposium, {CSF} 2011, Cernay-la-Ville, France,
|
||
27-29 June, 2011},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2011},
|
||
url = {https://ieeexplore.ieee.org/xpl/conhome/5991608/proceeding},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}
|
||
}
|
||
|
||
@InProceedings{ Abadi98,
|
||
title = {Protection in programming-language translations},
|
||
author = {Abadi, Mart{\'\i}n},
|
||
booktitle = {International Colloquium on Automata, Languages, and
|
||
Programming},
|
||
pages = {868--883},
|
||
year = {1998},
|
||
organization = {Springer}
|
||
}
|
||
|
||
@InProceedings{ Abadi99,
|
||
author = {Mart{\'{\i}}n Abadi},
|
||
title = {Protection in Programming-Language Translations},
|
||
booktitle = {Secure Internet Programming, Security Issues for Mobile
|
||
and Distributed Objects},
|
||
pages = {19--34},
|
||
year = {1999},
|
||
crossref-ignore={DBLP:conf/ecoopw/1999secure},
|
||
url = {https://doi.org/10.1007/3-540-48749-2\_2},
|
||
doi = {10.1007/3-540-48749-2\_2},
|
||
timestamp = {Wed, 24 May 2017 15:40:45 +0200}
|
||
}
|
||
|
||
@InProceedings{ AbadiBudiuEtAl05,
|
||
title = {Control-flow integrity},
|
||
author = {Abadi, Mart{\'\i}n and Budiu, Mihai and Erlingsson, Ulfar
|
||
and Ligatti, Jay},
|
||
booktitle = {Proceedings of the 12th ACM conference on Computer and
|
||
communications security},
|
||
pages = {340--353},
|
||
year = {2005},
|
||
organization = {ACM}
|
||
}
|
||
|
||
@InCollection{ AbadiBudiuEtAl05a,
|
||
title = {A theory of secure control flow},
|
||
author = {Abadi, Mart{\'\i}n and Budiu, Mihai and Erlingsson, Ulfar
|
||
and Ligatti, Jay},
|
||
booktitle = {Formal Methods and Software Engineering},
|
||
pages = {111--124},
|
||
year = {2005},
|
||
publisher = {Springer}
|
||
}
|
||
|
||
@Article{ AbadiBudiuEtAl09,
|
||
author = {Abadi, Mart\'{\i}n and Budiu, Mihai and Erlingsson,
|
||
\'{U}lfar and Ligatti, Jay},
|
||
title = {Control-flow Integrity Principles, Implementations, and
|
||
Applications},
|
||
journal = {ACM Trans. Inf. Syst. Secur.},
|
||
issue_date = {October 2009},
|
||
volume = {13},
|
||
number = {1},
|
||
month = nov,
|
||
year = {2009},
|
||
pages = {4:1--4:40},
|
||
articleno = {4},
|
||
numpages = {40},
|
||
url = {http://doi.acm.org/10.1145/1609956.1609960},
|
||
doi = {10.1145/1609956.1609960},
|
||
acmid = {1609960},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ AbadiFournetEtAl00,
|
||
author = {Abadi, Mart\'{\i}n and Fournet, C{\'e}dric and Gonthier,
|
||
Georges},
|
||
title = {Authentication Primitives and their Compilation},
|
||
booktitle = {Proceedings of the 27th Symposium on Principles of
|
||
Programming Languages},
|
||
series = {POPL '00},
|
||
year = {2000},
|
||
pages = {302--315},
|
||
numpages = {14},
|
||
acmid = {325734},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@Article{ AbadiFournetEtAl02,
|
||
author = {Abadi, Mart\'{\i}n and Fournet, C{\'e}dric and Gonthier,
|
||
Georges},
|
||
title = {Secure Implementation of Channel Abstractions},
|
||
journal = {Information and Computation},
|
||
volume = {174},
|
||
year = {2002},
|
||
pages = {37--83},
|
||
numpages = {47},
|
||
acmid = {570969},
|
||
publisher = {Academic Press, Inc.}
|
||
}
|
||
|
||
@InProceedings{ AbadiFournetEtAl99,
|
||
author = {Mart\'{\i}n Abadi and C{\'e}dric Fournet and Georges
|
||
Gonthier},
|
||
title = {Secure Communications Processing for Distributed
|
||
Languages},
|
||
booktitle = {IEEE Symposium on Security and Privacy},
|
||
year = {1999},
|
||
pages = {74-88}
|
||
}
|
||
|
||
@InProceedings{ AbadiPlotkin10,
|
||
acmid = {1845421},
|
||
author = {Abadi, Mart\'{\i}n and Plotkin, Gordon},
|
||
booktitle = {CSF '10},
|
||
doi = {10.1109/CSF.2010.30},
|
||
numpages = {15},
|
||
pages = {337--351},
|
||
publisher = {IEEE},
|
||
title = {On Protection by Layout Randomization},
|
||
url = {http://dx.doi.org/10.1109/CSF.2010.30},
|
||
year = {2010}
|
||
}
|
||
|
||
@InProceedings{ AbateAmorimEtAl18,
|
||
author = {Carmine Abate and Arthur Azevedo de Amorim and Roberto
|
||
Blanco and Ana Nora Evans and Guglielmo Fachini and Catalin
|
||
Hritcu and Th{\'{e}}o Laurent and Benjamin C. Pierce and
|
||
Marco Stronati and Andrew Tolmach},
|
||
title = {When Good Components Go Bad: Formally Secure Compilation
|
||
Despite Dynamic Compromise},
|
||
booktitle = {Proceedings of the 2018 {ACM} {SIGSAC} Conference on
|
||
Computer and Communications Security, {CCS} 2018, Toronto,
|
||
ON, Canada, October 15-19, 2018},
|
||
pages = {1351--1368},
|
||
year = {2018},
|
||
url = {https://doi.org/10.1145/3243734.3243745},
|
||
doi = {10.1145/3243734.3243745},
|
||
timestamp = {Wed, 21 Nov 2018 12:44:06 +0100}
|
||
}
|
||
|
||
@Misc{ AbateBlancoEtAl18,
|
||
author = { Abate, Carmine and Blanco, Roberto and Garg, Deepak and
|
||
Hri\c{t}cu, C\u{a}t\u{a}lin and Patrignani, Marco and
|
||
Thibault, Jeremy },
|
||
title = {Exploring Robust Property Preservation for Secure
|
||
Compilation},
|
||
howpublished = {arXiv:1807.04603},
|
||
url = {https://arxiv.org/abs/1807.04603},
|
||
year = {2018}
|
||
}
|
||
|
||
@InProceedings{ AbateBlancoEtAl19,
|
||
author = {Carmine Abate and Roberto Blanco and Deepak Garg and
|
||
Catalin Hritcu and Marco Patrignani and J{\'{e}}r{\'{e}}my
|
||
Thibault},
|
||
title = {Journey Beyond Full Abstraction: Exploring Robust Property
|
||
Preservation for Secure Compilation},
|
||
booktitle = {32nd {IEEE} Computer Security Foundations Symposium, {CSF}
|
||
2019, Hoboken, NJ, USA, June 25-28, 2019},
|
||
pages = {256--271},
|
||
publisher = {{IEEE}},
|
||
year = {2019},
|
||
url = {https://doi.org/10.1109/CSF.2019.00025},
|
||
doi = {10.1109/CSF.2019.00025},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}
|
||
}
|
||
|
||
@InProceedings{ AbateBusiEtAl21,
|
||
author = {Carmine Abate and Matteo Busi and Stelios Tsampas},
|
||
editor = {Hakjoo Oh},
|
||
title = {Fully Abstract and Robust Compilation: And How to
|
||
Reconcile the Two, Abstractly},
|
||
booktitle = {19th Asian Symposium on Programming Languages and Systems,
|
||
APLAS'21},
|
||
series = lncs,
|
||
volume = {13008},
|
||
pages = {83--101},
|
||
publisher = {Springer},
|
||
year = {2021},
|
||
url = {https://doi.org/10.1007/978-3-030-89051-3\_6},
|
||
doi = {10.1007/978-3-030-89051-3\_6},
|
||
timestamp = {Sun, 02 Oct 2022 15:54:47 +0200}
|
||
}
|
||
|
||
@Article{ AbbottAltenkirchEtAl05,
|
||
author = {Michael Gordon Abbott and Thorsten Altenkirch and Neil
|
||
Ghani},
|
||
title = {Containers: Constructing strictly positive types},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {342},
|
||
number = {1},
|
||
pages = {3--27},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1016/j.tcs.2005.06.002},
|
||
doi = {10.1016/j.tcs.2005.06.002},
|
||
timestamp = {Fri, 30 Nov 2018 13:25:25 +0100}
|
||
}
|
||
|
||
@Article{ AbbottAltenkirchEtAl05a,
|
||
author = {Michael Gordon Abbott and Thorsten Altenkirch and Conor
|
||
McBride and Neil Ghani},
|
||
title = {for Data: Differentiating Data Structures},
|
||
journal = {Fundam. Inform.},
|
||
volume = {65},
|
||
number = {1-2},
|
||
pages = {1--28},
|
||
year = {2005},
|
||
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi65-1-2-02},
|
||
timestamp = {Fri, 16 Sep 2016 16:25:59 +0200}
|
||
}
|
||
|
||
@PhDThesis{ Abou-Saleh14,
|
||
author = {Faris Abou{-}Saleh},
|
||
title = {A coalgebraic semantics for imperative programming
|
||
languages},
|
||
school = {Imperial College London, {UK}},
|
||
year = {2014},
|
||
url = {http://hdl.handle.net/10044/1/13693},
|
||
timestamp = {Mon, 15 Aug 2016 18:48:06 +0200}
|
||
}
|
||
|
||
@InProceedings{ Abou-SalehPattinson11,
|
||
author = {Faris Abou{-}Saleh and Dirk Pattinson},
|
||
editor = {Michael W. Mislove and Jo{\"{e}}l Ouaknine},
|
||
title = {Towards Effects in Mathematical Operational Semantics},
|
||
booktitle = {Mathematical Foundations of Programming Semantics, {MFPS}
|
||
2011},
|
||
series = entcs,
|
||
volume = {276},
|
||
pages = {81--104},
|
||
publisher = elsevier,
|
||
year = {2011},
|
||
nourl = {https://doi.org/10.1016/j.entcs.2011.09.016},
|
||
doi = {10.1016/j.entcs.2011.09.016},
|
||
timestamp = {Mon, 08 Feb 2021 13:26:19 +0100}
|
||
}
|
||
|
||
@InProceedings{ Abou-SalehPattinson13,
|
||
author = {Faris Abou{-}Saleh and Dirk Pattinson},
|
||
editor = {Frank Pfenning},
|
||
title = {Comodels and Effects in Mathematical Operational
|
||
Semantics},
|
||
booktitle = {Foundations of Software Science and Computation Structures
|
||
- 16th International Conference, {FOSSACS} 2013, Held as
|
||
Part of the European Joint Conferences on Theory and
|
||
Practice of Software, {ETAPS} 2013, Rome, Italy, March
|
||
16-24, 2013. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7794},
|
||
pages = {129--144},
|
||
publisher = {Springer},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-642-37075-5\_9},
|
||
doi = {10.1007/978-3-642-37075-5\_9},
|
||
timestamp = {Tue, 14 May 2019 10:00:55 +0200}
|
||
}
|
||
|
||
@InCollection{ Abramsky90,
|
||
author = "S. Abramsky",
|
||
booktitle = "Research topics in Functional Programming",
|
||
publisher = "Addison Wesley",
|
||
title = "The lazy $\lambda$-calculus",
|
||
year = "1990",
|
||
pages = "65--117",
|
||
document-size = "129. 7 kbytes"
|
||
}
|
||
|
||
@Article{ AbramskyOng93,
|
||
author = {Samson Abramsky and C.{-}H. Luke Ong},
|
||
title = {Full Abstraction in the Lazy Lambda Calculus},
|
||
journal = {Inf. Comput.},
|
||
volume = {105},
|
||
number = {2},
|
||
pages = {159--267},
|
||
year = {1993},
|
||
url = {https://doi.org/10.1006/inco.1993.1044},
|
||
doi = {10.1006/inco.1993.1044},
|
||
timestamp = {Fri, 12 Feb 2021 22:15:57 +0100}
|
||
}
|
||
|
||
@InCollection{ AcetoFokkinkEtAl01,
|
||
author = {Luca Aceto and Wan J. Fokkink and Chris Verhoef},
|
||
editor = {Jan A. Bergstra and Alban Ponse and Scott A. Smolka},
|
||
title = {Structural Operational Semantics},
|
||
booktitle = {Handbook of Process Algebra},
|
||
pages = {197--292},
|
||
publisher = {North-Holland / Elsevier},
|
||
year = {2001},
|
||
url = {https://doi.org/10.1016/b978-044482830-9/50021-7},
|
||
doi = {10.1016/b978-044482830-9/50021-7},
|
||
timestamp = {Mon, 18 May 2020 10:45:13 +0200}
|
||
}
|
||
|
||
@Proceedings{ AcetoFrutos-Escrig15,
|
||
editor = {Luca Aceto and David de Frutos{-}Escrig},
|
||
title = {26th International Conference on Concurrency Theory,
|
||
{CONCUR} 2015, Madrid, Spain, September 1.4, 2015},
|
||
series = {LIPIcs},
|
||
volume = {42},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
|
||
year = {2015},
|
||
url = {http://www.dagstuhl.de/dagpub/978-3-939897-91-0},
|
||
timestamp = {Thu, 02 May 2019 17:40:11 +0200}
|
||
}
|
||
|
||
@InProceedings{ AczelMendler89,
|
||
author = {Peter Aczel and Nax Paul Mendler},
|
||
editor = {David H. Pitt and David E. Rydeheard and Peter Dybjer and
|
||
Andrew M. Pitts and Axel Poign{\'{e}}},
|
||
title = {A Final Coalgebra Theorem},
|
||
booktitle = {Category Theory and Computer Science, Manchester, UK,
|
||
September 5-8, 1989, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {389},
|
||
pages = {357--365},
|
||
publisher = {Springer},
|
||
year = {1989},
|
||
url = {https://doi.org/10.1007/BFb0018361},
|
||
doi = {10.1007/BFb0018361},
|
||
timestamp = {Tue, 14 May 2019 10:00:48 +0200}
|
||
}
|
||
|
||
@Article{ Adamek74,
|
||
author = {Ji\v{r}\'i Ad\'amek},
|
||
title = {Free algebras and automata realizations in the language of
|
||
categories},
|
||
journal = {Comment. Math. Univ. Carol.},
|
||
year = {1974},
|
||
optkey = {},
|
||
volume = {15},
|
||
number = {4},
|
||
pages = {589--602},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@Book{ AdamekHerrlichEtAl90,
|
||
author = {Ad\'amek, Ji\v{r}\'i and Herrlich, Horst and Strecker,
|
||
George E.},
|
||
alteditor = {},
|
||
title = {Abstract and Concrete Categories},
|
||
publisher = {John Wiley and Sons},
|
||
year = {1990},
|
||
optkey = {},
|
||
optvolume = {},
|
||
optnumber = {},
|
||
optseries = {},
|
||
optaddress = {},
|
||
optedition = {},
|
||
optmonth = {},
|
||
note = {Free online version:
|
||
\url{http://www.tac.mta.ca/tac/reprints/articles/17/tr17abs.html}},
|
||
optannote = {}
|
||
}
|
||
|
||
@Article{ AdamekLevyEtAl15,
|
||
author = {Jir{\'{\i}} Ad{\'{a}}mek and Paul Blain Levy and Stefan
|
||
Milius and Lawrence S. Moss and Lurdes Sousa},
|
||
title = {On Final Coalgebras of Power-Set Functors and Saturated
|
||
Trees - To George Janelidze on the Occasion of His Sixtieth
|
||
Birthday},
|
||
journal = {Applied Categorical Structures},
|
||
volume = {23},
|
||
number = {4},
|
||
pages = {609--641},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1007/s10485-014-9372-9},
|
||
doi = {10.1007/s10485-014-9372-9},
|
||
timestamp = {Fri, 30 Nov 2018 13:26:36 +0100}
|
||
}
|
||
|
||
@Article{ AdamekMiliusEtAl10,
|
||
title = {Equational Properties of Iterative Monads},
|
||
author = {Ad{\'a}mek, Ji{\v r}{\'i} and Milius, Stefan and Velebil,
|
||
Ji{\v r}{\'i}},
|
||
year = {2010},
|
||
journal = {Information and Computation},
|
||
series = {Special {{Issue}}: {{International Workshop}} on
|
||
{{Coalgebraic Methods}} in {{Computer Science}} ({{CMCS}}
|
||
2008)},
|
||
volume = {208},
|
||
number = {12},
|
||
pages = {1306--1348},
|
||
doi = {10.1016/j.ic.2009.10.006}
|
||
}
|
||
|
||
@Article{ AdamekMiliusEtAl19,
|
||
author = {Ji\v{r}\'i Ad\'amek and Stefan Milius and Lourdes Sousa
|
||
and Thorsten Wi\ss mann},
|
||
title = {On Finitary Functors},
|
||
journal = {Theory and Applications of Categories},
|
||
year = {2019},
|
||
optkey = {},
|
||
volume = {34},
|
||
number = {35},
|
||
pages = {1134--1164.},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@InProceedings{ AdamekMiliusEtAl21,
|
||
author = {Ad\'{a}mek, Ji\v{r}{\'\i} and Milius, Stefan and Moss,
|
||
Lawrence S.},
|
||
title = {{Initial Algebras Without Iteration}},
|
||
booktitle = {9th Conference on Algebra and Coalgebra in Computer
|
||
Science (CALCO 2021)},
|
||
pages = {5:1--5:20},
|
||
series = {Leibniz International Proceedings in Informatics
|
||
(LIPIcs)},
|
||
year = {2021},
|
||
volume = {211},
|
||
editor = {Gadducci, Fabio and Silva, Alexandra},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}
|
||
}
|
||
|
||
@Book{ AdamekRosicky94,
|
||
place = {Cambridge},
|
||
series = {London Mathematical Society Lecture Note Series},
|
||
title = {Locally Presentable and Accessible Categories},
|
||
doi = {10.1017/CBO9780511600579},
|
||
publisher = {Cambridge University Press},
|
||
author = {Ad\'amek, Ji\v{r}\'i and Rosick\'y, Ji\v{r}\'i},
|
||
year = {1994},
|
||
collection = {London Mathematical Society Lecture Note Series}
|
||
}
|
||
|
||
@Book{ AdamekRosickyEtAl10,
|
||
author = {Ad\'amek, Ji\v{r}\'i and Rosick\'y, Ji\v{r}\'i and Vitale,
|
||
Enrico},
|
||
alteditor = {},
|
||
title = {Algebraic Theories},
|
||
publisher = {Cambridge University Press},
|
||
year = {2010},
|
||
optkey = {},
|
||
optvolume = {},
|
||
optnumber = {},
|
||
optseries = {},
|
||
optaddress = {},
|
||
optedition = {},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@TechReport{ AdvancedMicroDevicesInc20,
|
||
author = {{Advanced Micro Devices Inc.}},
|
||
title = {{Secure Encrypted Virtualization API Version 0.24}},
|
||
year = 2020,
|
||
month = april,
|
||
url = {https://www.amd.com/system/files/TechDocs/55766_SEV-KM_API_Specification.pdf}
|
||
}
|
||
|
||
@InProceedings{ AgtenJacobsEtAl15,
|
||
author = {Pieter Agten and Bart Jacobs and Frank Piessens},
|
||
title = {Sound Modular Verification of {C} Code Executing in an
|
||
Unverified Context},
|
||
booktitle = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT}
|
||
Symposium on Principles of Programming Languages, {POPL}
|
||
2015, Mumbai, India, January 15-17, 2015},
|
||
pages = {581--594},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1145/2676726.2676972},
|
||
doi = {10.1145/2676726.2676972},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100}
|
||
}
|
||
|
||
@InProceedings{ AgtenJacobsEtAl15a,
|
||
series = {POPL '15},
|
||
title = {Sound {{Modular Verification}} of {{C Code Executing}} in
|
||
an {{Unverified Context}}},
|
||
doi = {10.1145/2676726.2676972},
|
||
booktitle = {Proceedings of the {{42Nd Annual ACM SIGPLAN}}-{{SIGACT
|
||
Symposium}} on {{Principles}} of {{Programming
|
||
Languages}}},
|
||
publisher = {{ACM}},
|
||
author = {Agten, Pieter and Jacobs, Bart and Piessens, Frank},
|
||
year = {2015},
|
||
pages = {581--594}
|
||
}
|
||
|
||
@InProceedings{ AgtenStrackxEtAl12,
|
||
author = {Pieter Agten and Raoul Strackx and Bart Jacobs and Frank
|
||
Piessens},
|
||
title = {Secure Compilation to Modern Processors},
|
||
booktitle = {25th {IEEE} Computer Security Foundations Symposium, {CSF}
|
||
2012, Cambridge, MA, USA, June 25-27, 2012},
|
||
pages = {171--185},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1109/CSF.2012.12},
|
||
doi = {10.1109/CSF.2012.12},
|
||
timestamp = {Fri, 02 Jun 2017 20:47:40 +0200}
|
||
}
|
||
|
||
@Article{ AguirreBirkedal23,
|
||
author = {Alejandro Aguirre and Lars Birkedal},
|
||
title = {Step-Indexed Logical Relations for Countable
|
||
Nondeterminism and Probabilistic Choice},
|
||
journal = {Proc. {ACM} Program. Lang.},
|
||
volume = {7},
|
||
number = {{POPL}},
|
||
pages = {33--60},
|
||
year = {2023},
|
||
doi = {10.1145/3571195}
|
||
}
|
||
|
||
@InProceedings{ Ahmed06,
|
||
author = "Ahmed, Amal",
|
||
opteditor = "Sestoft, Peter",
|
||
title = "Step-Indexed Syntactic Logical Relations for Recursive and
|
||
Quantified Types",
|
||
booktitle = "15th European Symposium on Programming (ESOP 2006)",
|
||
year = "2006",
|
||
publisher = springer,
|
||
optaddress = "Berlin, Heidelberg",
|
||
pages = "69--83",
|
||
doi = {10.1007/11693024_6},
|
||
volume = {3924},
|
||
series = lncs
|
||
}
|
||
|
||
@Proceedings{ Ahmed18,
|
||
editor = {Amal Ahmed},
|
||
title = {Programming Languages and Systems - 27th European
|
||
Symposium on Programming, {ESOP} 2018, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of
|
||
Software, {ETAPS} 2018, Thessaloniki, Greece, April 14-20,
|
||
2018, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {10801},
|
||
publisher = {Springer},
|
||
year = {2018},
|
||
url = {https://doi.org/10.1007/978-3-319-89884-1},
|
||
doi = {10.1007/978-3-319-89884-1},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@Article{ AhmedBlume08,
|
||
acmid = {1411227},
|
||
address = {New York, NY, USA},
|
||
author = {Ahmed, Amal and Blume, Matthias},
|
||
doi = {10.1145/1411203.1411227},
|
||
issue_date = {September 2008},
|
||
journal = {SIGPLAN Not.},
|
||
month = sep,
|
||
number = {9},
|
||
numpages = {12},
|
||
pages = {157--168},
|
||
publisher = {ACM},
|
||
title = {Typed closure conversion preserves observational
|
||
equivalence},
|
||
url = {http://doi.acm.org/10.1145/1411203.1411227},
|
||
volume = {43},
|
||
year = {2008}
|
||
}
|
||
|
||
@InProceedings{ AhmedBlume11,
|
||
author = {Amal Ahmed and Matthias Blume},
|
||
title = {An equivalence-preserving {CPS} translation via
|
||
multi-language semantics},
|
||
booktitle = {Proceeding of the 16th {ACM} {SIGPLAN} international
|
||
conference on Functional Programming, {ICFP} 2011, Tokyo,
|
||
Japan, September 19-21, 2011},
|
||
pages = {431--444},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1145/2034773.2034830},
|
||
doi = {10.1145/2034773.2034830},
|
||
timestamp = {Sun, 02 Jun 2019 21:13:12 +0200}
|
||
}
|
||
|
||
@InProceedings{ AhmedDreyerEtAl09,
|
||
author = {Amal Ahmed and Derek Dreyer and Andreas Rossberg},
|
||
editor = {Zhong Shao and Benjamin C. Pierce},
|
||
title = {State-dependent representation independence},
|
||
booktitle = {36th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages, ({POPL} 2009)},
|
||
pages = {340--353},
|
||
publisher = {{ACM}},
|
||
year = {2009},
|
||
doi = {10.1145/1480881.1480925}
|
||
}
|
||
|
||
@Article{ AhmedGargEtAl18,
|
||
author = {Amal Ahmed and Deepak Garg and Catalin Hritcu and Frank
|
||
Piessens},
|
||
title = {{Secure Compilation (Dagstuhl Seminar 18201)}},
|
||
pages = {1--30},
|
||
journal = {Dagstuhl Reports},
|
||
year = {2018},
|
||
volume = {8},
|
||
number = {5},
|
||
editor = {Amal Ahmed and Deepak Garg and Catalin Hritcu and Frank
|
||
Piessens},
|
||
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
|
||
address = {Dagstuhl, Germany},
|
||
url = {http://drops.dagstuhl.de/opus/volltexte/2018/9891},
|
||
urn = {urn:nbn:de:0030-drops-98911},
|
||
doi = {10.4230/DagRep.8.5.1}
|
||
}
|
||
|
||
@Article{ AhmedJamnerEtAl17,
|
||
author = {Amal Ahmed and Dustin Jamner and Jeremy G. Siek and Philip
|
||
Wadler},
|
||
title = {Theorems for free for free: parametricity, with and
|
||
without types},
|
||
journal = {Proc. {ACM} Program. Lang.},
|
||
volume = {1},
|
||
number = {{ICFP}},
|
||
pages = {39:1--39:28},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1145/3110283},
|
||
doi = {10.1145/3110283}
|
||
}
|
||
|
||
@InProceedings{ AltenkirchDanielssonEtAl17,
|
||
altauthor = {Thorsten Altenkirch and Nils Anders Danielsson and Nicolai
|
||
Kraus},
|
||
author = {Thorsten Altenkirch and Nils Danielsson and Nicolai
|
||
Kraus},
|
||
title = {Partiality, Revisited - The Partiality Monad as a Quotient
|
||
Inductive-Inductive Type},
|
||
altbooktitle = {Foundations of Software Science and Computation Structures
|
||
- 20th International Conference, {FOSSACS} 2017, Held as
|
||
Part of the European Joint Conferences on Theory and
|
||
Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April
|
||
22-29, 2017, Proceedings},
|
||
pages = {534--549},
|
||
alteditor = {Javier Esparza and Andrzej S. Murawski},
|
||
editor = {Javier Esparza and Andrzej Murawski},
|
||
booktitle = {Foundations of Software Science and Computation
|
||
Structures, {FOSSACS} 2017},
|
||
series = lncs,
|
||
volume = {10203},
|
||
year = {2017},
|
||
nourl = {https://doi.org/10.1007/978-3-662-54458-7},
|
||
timestamp = {Tue, 23 May 2017 01:08:04 +0200}
|
||
}
|
||
|
||
@InProceedings{ AltenkirchKaposi16,
|
||
author = {Thorsten Altenkirch and Ambrus Kaposi},
|
||
title = {Normalisation by Evaluation for Dependent Types},
|
||
booktitle = {1st International Conference on Formal Structures for
|
||
Computation and Deduction (FSCD 2016)},
|
||
pages = {6:1--6:16},
|
||
series = lipics,
|
||
year = {2016},
|
||
volume = {52},
|
||
opteditor = {Delia Kesner and Brigitte Pientka},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik},
|
||
optaddress = {Dagstuhl, Germany},
|
||
urn = {urn:nbn:de:0030-drops-59727},
|
||
doi = {10.4230/LIPIcs.FSCD.2016.6}
|
||
}
|
||
|
||
@InProceedings{ AltenkirchReus99,
|
||
author = {Thorsten Altenkirch and Bernhard Reus},
|
||
editor = {J{\"{o}}rg Flum and Mario Rodr{\'{\i}}guez{-}Artalejo},
|
||
title = {Monadic Presentations of Lambda Terms Using Generalized
|
||
Inductive Types},
|
||
booktitle = {Computer Science Logic, 13th International Workshop, {CSL}
|
||
'99, 8th Annual Conference of the EACSL, Madrid, Spain,
|
||
September 20-25, 1999, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1683},
|
||
pages = {453--468},
|
||
publisher = {Springer},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1007/3-540-48168-0\_32},
|
||
doi = {10.1007/3-540-48168-0\_32},
|
||
timestamp = {Tue, 14 May 2019 10:00:42 +0200}
|
||
}
|
||
|
||
@Book{ AmadioCurien98,
|
||
place = {Cambridge},
|
||
series = {Cambridge Tracts in Theoretical Computer Science},
|
||
title = {Domains and Lambda-Calculi},
|
||
publisher = {Cambridge University Press},
|
||
author = {Amadio, Roberto M. and Curien, Pierre-Louis},
|
||
year = 1998,
|
||
collection = {Cambridge Tracts in Theoretical Computer Science}
|
||
}
|
||
|
||
@PhDThesis{ AmbalSchmittEtAl20,
|
||
title = {Automatic Transformation of a Big-Step Skeletal Semantics
|
||
into Small-Step},
|
||
author = {Ambal, Guillaume and Schmitt, Alan and Lenglet,
|
||
Sergue{\"\i}},
|
||
year = {2020},
|
||
school = {Inria Rennes-Bretagne Atlantique}
|
||
}
|
||
|
||
@Article{ AnandMorrisett17,
|
||
author = {Abhishek Anand and Greg Morrisett},
|
||
title = {Revisiting Parametricity: Inductives and Uniformity of
|
||
Propositions},
|
||
journal = {CoRR},
|
||
volume = {abs/1705.01163},
|
||
year = {2017},
|
||
url = {http://arxiv.org/abs/1705.01163},
|
||
eprinttype = {arXiv},
|
||
eprint = {1705.01163},
|
||
timestamp = {Mon, 13 Aug 2018 16:46:10 +0200}
|
||
}
|
||
|
||
@Article{ AppelMcAllester01,
|
||
author = {Andrew W. Appel and David A. McAllester},
|
||
title = {An indexed model of recursive types for foundational
|
||
proof-carrying code},
|
||
journal = {{ACM} Trans. Program. Lang. Syst.},
|
||
volume = {23},
|
||
number = {5},
|
||
pages = {657--683},
|
||
year = {2001},
|
||
doi = {10.1145/504709.504712},
|
||
timestamp = {Mon, 15 Jun 2020 16:54:21 +0200}
|
||
}
|
||
|
||
@Article{ AptPlotkin86,
|
||
author = {Apt, K. R. and Plotkin, G. D.},
|
||
title = {Countable nondeterminism and random assignment},
|
||
year = 1986,
|
||
issue_date = {Oct. 1986},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = 33,
|
||
number = 4,
|
||
url = {https://doi.org/10.1145/6490.6494},
|
||
doi = {10.1145/6490.6494},
|
||
journal = {J. ACM},
|
||
month = aug,
|
||
pages = {724–767},
|
||
numpages = 44
|
||
}
|
||
|
||
@InProceedings{ ArkorFiore20,
|
||
author = {Nathanael Arkor and Marcelo Fiore},
|
||
editor = {Holger Hermanns and Lijun Zhang and Naoki Kobayashi and
|
||
Dale Miller},
|
||
title = {Algebraic models of simple type theories: {A} polynomial
|
||
approach},
|
||
booktitle = {35th Annual {ACM/IEEE} Symposium on Logic in Computer
|
||
Science, LICS'20},
|
||
pages = {88--101},
|
||
publisher = {{ACM}},
|
||
year = {2020},
|
||
url = {https://doi.org/10.1145/3373718.3394771},
|
||
doi = {10.1145/3373718.3394771},
|
||
timestamp = {Thu, 14 Oct 2021 09:50:16 +0200}
|
||
}
|
||
|
||
@Book{ Awodey10,
|
||
author = {Awodey, Steve},
|
||
title = {Category Theory},
|
||
year = {2010},
|
||
edition = {2nd},
|
||
publisher = {Oxford University Press, Inc.},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Azevedo-de-AmorimCollinsEtAl14,
|
||
author = {Azevedo de Amorim, Arthur and Collins, Nathan and DeHon,
|
||
Andr{\'e} and Demange, Delphine and Hri\c{t}cu,
|
||
C\u{a}t\u{a}lin and Pichardie, David and Pierce, Benjamin
|
||
C. and Pollack, Randy and Tolmach, Andrew},
|
||
title = {A Verified Information-flow Architecture},
|
||
booktitle = {Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on
|
||
Principles of Programming Languages},
|
||
series = {POPL '14},
|
||
year = {2014},
|
||
pages = {165--178},
|
||
numpages = {14},
|
||
url = {http://doi.acm.org/10.1145/2535838.2535839},
|
||
doi = {10.1145/2535838.2535839},
|
||
acmid = {2535839},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Bach-PoulsenMosses14,
|
||
author = {Bach Poulsen, Casper and Mosses, Peter D.},
|
||
title = {Deriving Pretty-Big-Step Semantics from Small-Step
|
||
Semantics},
|
||
year = {2014},
|
||
publisher = {Springer-Verlag},
|
||
address = {Berlin, Heidelberg},
|
||
doi = {10.1007/978-3-642-54833-8_15},
|
||
booktitle = {Proceedings of the 23rd European Symposium on Programming
|
||
Languages and Systems - Volume 8410},
|
||
pages = {270–289},
|
||
numpages = {20}
|
||
}
|
||
|
||
@Article{ Bach-PoulsenRouvoetEtAl17,
|
||
author = {Bach Poulsen, Casper and Rouvoet, Arjen and Tolmach,
|
||
Andrew and Krebbers, Robbert and Visser, Eelco},
|
||
title = {Intrinsically-typed Definitional Interpreters for
|
||
Imperative Languages},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
issue_date = {January 2018},
|
||
volume = {2},
|
||
number = {POPL},
|
||
month = dec,
|
||
year = {2017},
|
||
pages = {16:1--16:34},
|
||
articleno = {16},
|
||
numpages = {34},
|
||
url = {http://doi.acm.org/10.1145/3158104},
|
||
doi = {10.1145/3158104},
|
||
acmid = {3158104},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Baeten05,
|
||
title = {A brief history of process algebra},
|
||
journal = {Theoretical Computer Science},
|
||
volume = 335,
|
||
number = 2,
|
||
pages = {131-146},
|
||
year = 2005,
|
||
note = {Process Algebra},
|
||
doi = {https://doi.org/10.1016/j.tcs.2004.07.036},
|
||
author = {J.C.M. Baeten}
|
||
}
|
||
|
||
@InProceedings{ BaierHermanns97,
|
||
author = {Christel Baier and Holger Hermanns},
|
||
editor = {Orna Grumberg},
|
||
title = {Weak Bisimulation for Fully Probabilistic Processes},
|
||
booktitle = {Computer Aided Verification, 9th International Conference,
|
||
{CAV} '97, Haifa, Israel, June 22-25, 1997, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1254},
|
||
pages = {119--130},
|
||
publisher = {Springer},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1007/3-540-63166-6\_14},
|
||
doi = {10.1007/3-540-63166-6\_14},
|
||
timestamp = {Tue, 14 May 2019 10:00:43 +0200}
|
||
}
|
||
|
||
@Proceedings{ BakkerRoeverEtAl93,
|
||
editor = {J. W. de Bakker and Willem P. de Roever and Grzegorz
|
||
Rozenberg},
|
||
title = {Sematics: Foundations and Applications, {REX} Workshop,
|
||
Beekbergen, The Netherlands, June 1-4, 1992, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {666},
|
||
publisher = {Springer},
|
||
year = {1993},
|
||
url = {https://doi.org/10.1007/3-540-56596-5},
|
||
doi = {10.1007/3-540-56596-5},
|
||
timestamp = {Tue, 14 May 2019 10:00:52 +0200}
|
||
}
|
||
|
||
@InProceedings{ BaltopoulosGordon09,
|
||
author = {Baltopoulos, Ioannis G. and Gordon, Andrew D.},
|
||
title = {Secure Compilation of a Multi-Tier Web Language},
|
||
booktitle = {Proceedings of the 4th International Workshop on Types in
|
||
Language Design and Implementation},
|
||
series = {TLDI '09},
|
||
year = {2009},
|
||
pages = {27--38},
|
||
numpages = {12},
|
||
acmid = {1481866},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@InProceedings{ BanerjeeNaumann02,
|
||
author = {Banerjee, Anindya and Naumann, David A.},
|
||
title = {Secure Information Flow and Pointer Confinement in a
|
||
Java-like Language},
|
||
booktitle = {Proceedings of the 15th IEEE Workshop on Computer Security
|
||
Foundations},
|
||
series = {CSFW '02},
|
||
year = {2002},
|
||
pages = {253--},
|
||
url = {http://dl.acm.org/citation.cfm?id=794201.795164},
|
||
acmid = {795164},
|
||
publisher = {IEEE Computer Society},
|
||
address = {Washington, DC, USA}
|
||
}
|
||
|
||
@Article{ Barr70,
|
||
author = {Michael Barr},
|
||
title = {Coequalizers and free triples},
|
||
journal = {Math.~Z.},
|
||
year = {1970},
|
||
optkey = {},
|
||
volume = {116},
|
||
optnumber = {},
|
||
pages = {307-322},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@InProceedings{ Barr70a,
|
||
author = {Micheal Barr},
|
||
title = {Relational algebras},
|
||
optcrossref = {},
|
||
optkey = {},
|
||
booktitle = {Proc.~Midwest Category Seminar},
|
||
year = {1970},
|
||
opteditor = {},
|
||
volume = {137},
|
||
optnumber = {},
|
||
series = lnm,
|
||
optpages = {},
|
||
optmonth = {},
|
||
optaddress = {},
|
||
optorganization={},
|
||
publisher = springer,
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@Article{ Barr92,
|
||
title = "Algebraically compact functors",
|
||
journal = "Journal of Pure and Applied Algebra",
|
||
volume = "82",
|
||
number = "3",
|
||
pages = "211 - 231",
|
||
year = "1992",
|
||
doi = "https://doi.org/10.1016/0022-4049(92)90169-G",
|
||
url = "http://www.sciencedirect.com/science/article/pii/002240499290169G",
|
||
author = "Michael Barr"
|
||
}
|
||
|
||
@InProceedings{ BarresiRazaviEtAl15,
|
||
author = {Antonio Barresi and Kaveh Razavi and Mathias Payer and
|
||
Thomas R. Gross},
|
||
title = {{CAIN}: Silently Breaking {ASLR} in the Cloud},
|
||
booktitle = {9th {USENIX} Workshop on Offensive Technologies ({WOOT}
|
||
15)},
|
||
year = {2015},
|
||
address = {Washington, D.C.},
|
||
url = {https://www.usenix.org/conference/woot15/workshop-program/presentation/barresi},
|
||
publisher = {{USENIX} Association}
|
||
}
|
||
|
||
@PhDThesis{ Bartels04,
|
||
title = "On generalised coinduction and probabilistic specification
|
||
formats: Distributive laws in coalgebraic modelling",
|
||
author = "Falk Bartels",
|
||
year = "2004",
|
||
language = "English",
|
||
series = "IPA dissertation series",
|
||
number = "6",
|
||
school = "Vrije Universiteit Amsterdam"
|
||
}
|
||
|
||
@Article{ BartheBlazyEtAl19,
|
||
author = {Barthe, Gilles and Blazy, Sandrine and Gr\'{e}goire,
|
||
Benjamin and Hutin, R\'{e}mi and Laporte, Vincent and
|
||
Pichardie, David and Trieu, Alix},
|
||
title = {Formal Verification of a Constant-Time Preserving C
|
||
Compiler},
|
||
year = {2019},
|
||
issue_date = {January 2020},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {4},
|
||
number = {POPL},
|
||
url = {https://doi.org/10.1145/3371075},
|
||
doi = {10.1145/3371075},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
month = dec,
|
||
articleno = {7},
|
||
numpages = {30}
|
||
}
|
||
|
||
@InProceedings{ BartheGregoireEtAl18,
|
||
title = {Secure compilation of side-channel countermeasures: the
|
||
case of cryptographic “constant-time”},
|
||
author = {Barthe, Gilles and Gr{\'e}goire, Benjamin and Laporte,
|
||
Vincent},
|
||
booktitle = {2018 IEEE 31st Computer Security Foundations Symposium
|
||
(CSF)},
|
||
pages = {328--343},
|
||
year = {2018},
|
||
organization = {IEEE}
|
||
}
|
||
|
||
@InProceedings{ Basold19,
|
||
author = {Henning Basold},
|
||
editor = {Markus Roggenbach and Ana Sokolova},
|
||
title = {Coinduction in Flow: The Later Modality in Fibrations},
|
||
booktitle = {8th Conference on Algebra and Coalgebra in Computer
|
||
Science, {CALCO} 2019, June 3-6, 2019, London, United
|
||
Kingdom},
|
||
series = {LIPIcs},
|
||
volume = {139},
|
||
pages = {8:1--8:22},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2019},
|
||
url = {https://doi.org/10.4230/LIPIcs.CALCO.2019.8},
|
||
doi = {10.4230/LIPIcs.CALCO.2019.8},
|
||
timestamp = {Thu, 19 Dec 2019 09:27:29 +0100}
|
||
}
|
||
|
||
@TechReport{ BellLaPadula73,
|
||
title = {Secure computer systems: Mathematical foundations},
|
||
author = {Bell, D Elliott and LaPadula, Leonard J},
|
||
year = {1973},
|
||
institution = {DTIC Document}
|
||
}
|
||
|
||
@InProceedings{ BentonHur09,
|
||
author = {Benton, Nick and Hur, Chung-Kil},
|
||
title = {Biorthogonality, Step-Indexing and Compiler Correctness},
|
||
year = {2009},
|
||
publisher = {ACM},
|
||
optaddress = {New York, NY, USA},
|
||
doi = {10.1145/1596550.1596567},
|
||
booktitle = {14th ACM SIGPLAN International Conference on Functional
|
||
Programming (ICFP 2009)},
|
||
pages = {97–108},
|
||
numpages = {12},
|
||
optseries = {ICFP '09}
|
||
}
|
||
|
||
@Article{ BentonHurEtAl12,
|
||
author = {Nick Benton and Chung{-}Kil Hur and Andrew Kennedy and
|
||
Conor McBride},
|
||
title = {Strongly Typed Term Representations in Coq},
|
||
journal = {J. Autom. Reason.},
|
||
volume = {49},
|
||
number = {2},
|
||
pages = {141--159},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1007/s10817-011-9219-0},
|
||
doi = {10.1007/s10817-011-9219-0},
|
||
timestamp = {Wed, 02 Sep 2020 13:29:40 +0200}
|
||
}
|
||
|
||
@Book{ Bergman98,
|
||
author = {Bergman, George},
|
||
title = {An invitation to general algebra and universal
|
||
constructions},
|
||
publisher = {H. Helson},
|
||
year = {1998},
|
||
address = {Berkeley, CA}
|
||
}
|
||
|
||
@TechReport{ BergstraKlop82,
|
||
title = {Fixed point semantics in process algebras},
|
||
author = {Jan A. Bergstra and Jan Willem Klop},
|
||
year = 1982
|
||
}
|
||
|
||
@Article{ BernardyJanssonEtAl12,
|
||
author = {Jean{-}Philippe Bernardy and Patrik Jansson and Ross
|
||
Paterson},
|
||
title = {Proofs for free - Parametricity for dependent types},
|
||
journal = {J. Funct. Program.},
|
||
volume = {22},
|
||
number = {2},
|
||
pages = {107--152},
|
||
year = {2012},
|
||
doi = {10.1017/S0956796812000056}
|
||
}
|
||
|
||
@InProceedings{ Bernstein98,
|
||
author = {Karen L. Bernstein},
|
||
title = {A Congruence Theorem for Structured Operational Semantics
|
||
of Higher-Order Languages},
|
||
booktitle = {13th Annual {IEEE} Symposium on Logic in Computer Science,
|
||
LICS'98},
|
||
pages = {153--164},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1998},
|
||
url = {https://doi.org/10.1109/LICS.1998.705652},
|
||
doi = {10.1109/LICS.1998.705652},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ BessonDangEtAl18,
|
||
title = {Securing Compilation Against Memory Probing},
|
||
author = {Besson, Fr{\'e}d{\'e}ric and Dang, Alexandre and Jensen,
|
||
Thomas},
|
||
booktitle = {Proceedings of the 13th Workshop on Programming Languages
|
||
and Analysis for Security},
|
||
pages = {29--40},
|
||
year = {2018},
|
||
organization = {ACM}
|
||
}
|
||
|
||
@Article{ BirkedalBizjakEtAl13,
|
||
author = {Lars Birkedal and Ales Bizjak and Jan Schwinghammer},
|
||
title = {Step-Indexed Relational Reasoning for Countable
|
||
Nondeterminism},
|
||
journal = {Log. Methods Comput. Sci.},
|
||
volume = {9},
|
||
number = {4},
|
||
year = {2013},
|
||
doi = {10.2168/LMCS-9(4:4)2013}
|
||
}
|
||
|
||
@Article{ BirkedalMgelbergEtAl12,
|
||
author = {Lars Birkedal and Rasmus M{\o}gelberg and Jan
|
||
Schwinghammer and Kristian St{\o}vring},
|
||
title = {First Steps in Synthetic Guarded Domain Theory:
|
||
Step-Indexing in the Topos of Trees},
|
||
journal = lmcs,
|
||
volume = {8},
|
||
number = {4:1},
|
||
pages = {1--45},
|
||
year = {2012}
|
||
}
|
||
|
||
@InProceedings{ BirkedalSieczkowskiEtAl12,
|
||
author = {Lars Birkedal and Filip Sieczkowski and Jacob Thamsborg},
|
||
editor = {Patrick C{\'{e}}gielski and Arnaud Durand},
|
||
title = {A Concurrent Logical Relation},
|
||
booktitle = {26th International Workshop/21st Annual Conference of the
|
||
EACSL ({CSL} 2012)},
|
||
series = {LIPIcs},
|
||
volume = {16},
|
||
pages = {107--121},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2012},
|
||
doi = {10.4230/LIPICS.CSL.2012.107}
|
||
}
|
||
|
||
@Article{ BirkedalStvringEtAl10,
|
||
title = {The Category-Theoretic Solution of Recursive Metric-Space
|
||
Equations},
|
||
author = {Birkedal, Lars and St{\o}vring, Kristian and Thamsborg,
|
||
Jacob},
|
||
year = {2010},
|
||
optmonth = oct,
|
||
journal = {Theoretical Computer Science},
|
||
publisher = elsevier,
|
||
volume = {411},
|
||
number = {47},
|
||
pages = {4102--4122},
|
||
doi = {10.1016/j.tcs.2010.07.010}
|
||
}
|
||
|
||
@InProceedings{ BizjakBirkedal15,
|
||
author = "Bizjak, Ale{\v{s}} and Birkedal, Lars",
|
||
editor = "Pitts, Andrew",
|
||
title = "Step-Indexed Logical Relations for Probability",
|
||
booktitle = "18th International Conference on Foundations of Software
|
||
Science and Computation Structures (FoSSaCS 2015)",
|
||
year = "2015",
|
||
publisher = springer,
|
||
optaddress = "Berlin, Heidelberg",
|
||
pages = "279--294",
|
||
series = lncs,
|
||
volume = {9034},
|
||
doi = "10.1007/978-3-662-46678-0_18"
|
||
}
|
||
|
||
@Article{ BlevinsWeathersEtAl15,
|
||
author = {Blevins, Christy and Weathers, Frank and Davis, Margaret
|
||
and Witte, Tracy and Domino, Jessica},
|
||
year = {2015},
|
||
month = {11},
|
||
pages = {},
|
||
title = {The Posttraumatic Stress Disorder Checklist for DSM-5
|
||
(PCL-5): Development and Initial Psychometric Evaluation},
|
||
volume = {28},
|
||
journal = {Journal of traumatic stress},
|
||
doi = {10.1002/jts.22059}
|
||
}
|
||
|
||
@Article{ Bloom95,
|
||
author = {Bard Bloom},
|
||
title = {Structural Operational Semantics for Weak Bisimulations},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {146},
|
||
number = {1{\&}2},
|
||
pages = {25--68},
|
||
year = {1995},
|
||
url = {https://doi.org/10.1016/0304-3975(94)00152-9},
|
||
doi = {10.1016/0304-3975(94)00152-9},
|
||
timestamp = {Sun, 28 May 2017 13:20:02 +0200}
|
||
}
|
||
|
||
@Article{ BloomIstrailEtAl95,
|
||
author = {Bard Bloom and Sorin Istrail and Albert R. Meyer},
|
||
title = {Bisimulation Can't be Traced},
|
||
journal = {J. {ACM}},
|
||
volume = {42},
|
||
number = {1},
|
||
pages = {232--268},
|
||
year = {1995},
|
||
url = {https://doi.org/10.1145/200836.200876},
|
||
doi = {10.1145/200836.200876},
|
||
timestamp = {Tue, 06 Nov 2018 12:51:45 +0100}
|
||
}
|
||
|
||
@Unpublished{ BloomVandraager94,
|
||
author = "Bard Bloom and Frits Vandraager",
|
||
title = "SOS rule formats for parameterized and state-bearing
|
||
processes",
|
||
note = "\url{http://www.sws.cs.ru.nl/publications/papers/fvaan/bardfrits.ps}",
|
||
year = "1994"
|
||
}
|
||
|
||
@Proceedings{ BodkMajumdar16,
|
||
editor = {Rastislav Bod{\'{\i}}k and Rupak Majumdar},
|
||
title = {Proceedings of the 43rd Annual {ACM} {SIGPLAN-SIGACT}
|
||
Symposium on Principles of Programming Languages, {POPL}
|
||
2016, St. Petersburg, FL, USA, January 20 - 22, 2016},
|
||
publisher = {{ACM}},
|
||
year = {2016},
|
||
url = {http://dl.acm.org/citation.cfm?id=2837614},
|
||
timestamp = {Wed, 09 Mar 2016 08:11:59 +0100}
|
||
}
|
||
|
||
@InProceedings{ BonchiPetrisanEtAl14,
|
||
author = {Filippo Bonchi and Daniela Petrisan and Damien Pous and
|
||
Jurriaan Rot},
|
||
editor = {Thomas A. Henzinger and Dale Miller},
|
||
title = {Coinduction up-to in a fibrational setting},
|
||
booktitle = {Joint Meeting of the Twenty-Third {EACSL} Annual
|
||
Conference on Computer Science Logic {(CSL)} and the
|
||
Twenty-Ninth Annual {ACM/IEEE} Symposium on Logic in
|
||
Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria,
|
||
July 14 - 18, 2014},
|
||
pages = {20:1--20:9},
|
||
publisher = {{ACM}},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1145/2603088.2603149},
|
||
doi = {10.1145/2603088.2603149},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:36 +0100}
|
||
}
|
||
|
||
@InProceedings{ BonchiPetrisanEtAl15,
|
||
author = {Filippo Bonchi and Daniela Petrisan and Damien Pous and
|
||
Jurriaan Rot},
|
||
title = {Lax Bialgebras and Up-To Techniques for Weak
|
||
Bisimulations},
|
||
booktitle = {26th International Conference on Concurrency Theory,
|
||
{CONCUR} 2015, Madrid, Spain, September 1.4, 2015},
|
||
pages = {240--253},
|
||
year = {2015},
|
||
doi = {10.4230/LIPIcs.CONCUR.2015.240},
|
||
timestamp = {Thu, 02 May 2019 17:40:11 +0200}
|
||
}
|
||
|
||
@Article{ BonchiPetrisanEtAl17,
|
||
author = {Filippo Bonchi and Daniela Petrisan and Damien Pous and
|
||
Jurriaan Rot},
|
||
title = {A general account of coinduction up-to},
|
||
journal = {Acta Inf.},
|
||
volume = {54},
|
||
number = {2},
|
||
pages = {127--190},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1007/s00236-016-0271-4},
|
||
doi = {10.1007/s00236-016-0271-4},
|
||
timestamp = {Tue, 26 Jun 2018 14:09:12 +0200}
|
||
}
|
||
|
||
@Article{ BonsangueHansenEtAl15,
|
||
author = {Marcello M. Bonsangue and Helle Hvid Hansen and Alexander
|
||
Kurz and Jurriaan Rot},
|
||
title = {Presenting Distributive Laws},
|
||
journal = {Log. Methods Comput. Sci.},
|
||
volume = {11},
|
||
number = {3},
|
||
year = {2015},
|
||
url = {https://doi.org/10.2168/LMCS-11(3:2)2015},
|
||
doi = {10.2168/LMCS-11(3:2)2015},
|
||
timestamp = {Thu, 25 Jun 2020 21:29:10 +0200}
|
||
}
|
||
|
||
@InProceedings{ BonsangueMiliusEtAl12,
|
||
author = {Marcello M. Bonsangue and Stefan Milius and Jurriaan Rot},
|
||
editor = {Bas Luttik and Michel A. Reniers},
|
||
title = {On the specification of operations on the rational
|
||
behaviour of systems},
|
||
booktitle = {Proceedings Combined 19th International Workshop on
|
||
Expressiveness in Concurrency and 9th Workshop on
|
||
Structured Operational Semantics, {EXPRESS/SOS} 2012,
|
||
Newcastle upon Tyne, UK, September 3, 2012},
|
||
series = {{EPTCS}},
|
||
volume = {89},
|
||
pages = {3--18},
|
||
year = {2012},
|
||
url = {https://doi.org/10.4204/EPTCS.89.2},
|
||
doi = {10.4204/EPTCS.89.2},
|
||
timestamp = {Sat, 19 Oct 2019 19:22:54 +0200}
|
||
}
|
||
|
||
@Book{ Borceux94,
|
||
title = {Handbook of {{Categorical Algebra}}: {{Volume}} 1: {{Basic
|
||
Category Theory}}},
|
||
shorttitle = {Handbook of {{Categorical Algebra}}},
|
||
author = {Borceux, Francis},
|
||
year = {1994},
|
||
series = {Encyclopedia of {{Mathematics}} and Its {{Applications}}},
|
||
volume = {1},
|
||
publisher = {{Cambridge University Press}},
|
||
optaddress = {{Cambridge}},
|
||
doi = {10.1017/CBO9780511525858}
|
||
}
|
||
|
||
@InProceedings{ BorthelleHirschowitzEtAl20,
|
||
author = {Peio Borthelle and Tom Hirschowitz and Ambroise Lafont},
|
||
editor = {Holger Hermanns and Lijun Zhang and Naoki Kobayashi and
|
||
Dale Miller},
|
||
title = {A Cellular {Howe} Theorem},
|
||
booktitle = {35th Annual {ACM/IEEE} Symposium on Logic in Computer
|
||
Science, LICS'20},
|
||
pages = {273--286},
|
||
publisher = {{ACM}},
|
||
year = {2020},
|
||
url = {https://doi.org/10.1145/3373718.3394738},
|
||
doi = {10.1145/3373718.3394738},
|
||
timestamp = {Thu, 23 Jun 2022 19:58:49 +0200}
|
||
}
|
||
|
||
@Article{ Brengos15,
|
||
author = {Tomasz Brengos},
|
||
title = {Weak bisimulation for coalgebras over order enriched
|
||
monads},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {11},
|
||
number = {2},
|
||
year = {2015},
|
||
url = {https://doi.org/10.2168/LMCS-11(2:14)2015},
|
||
doi = {10.2168/LMCS-11(2:14)2015},
|
||
timestamp = {Tue, 14 May 2019 16:31:18 +0200}
|
||
}
|
||
|
||
@InProceedings{ Brengos18,
|
||
author = {Tomasz Brengos},
|
||
editor = {Sven Schewe and Lijun Zhang},
|
||
title = {A Coalgebraic Take on Regular and omega-Regular Behaviour
|
||
for Systems with Internal Moves},
|
||
booktitle = {29th International Conference on Concurrency Theory,
|
||
{CONCUR} 2018, September 4-7, 2018, Beijing, China},
|
||
series = {LIPIcs},
|
||
volume = {118},
|
||
pages = {25:1--25:18},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2018},
|
||
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2018.25},
|
||
doi = {10.4230/LIPIcs.CONCUR.2018.25},
|
||
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}
|
||
}
|
||
|
||
@Article{ BrengosMiculanEtAl15,
|
||
author = {Tomasz Brengos and Marino Miculan and Marco Peressotti},
|
||
title = {Behavioural equivalences for coalgebras with unobservable
|
||
moves},
|
||
journal = {J. Log. Algebraic Methods Program.},
|
||
volume = {84},
|
||
number = {6},
|
||
pages = {826--852},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1016/j.jlamp.2015.09.002},
|
||
doi = {10.1016/j.jlamp.2015.09.002},
|
||
timestamp = {Sat, 22 Feb 2020 19:18:11 +0100}
|
||
}
|
||
|
||
@InProceedings{ Brookes93,
|
||
author = {Stephen D. Brookes},
|
||
title = {Full Abstraction for a Shared Variable Parallel Language},
|
||
booktitle = {Proceedings of the Eighth Annual Symposium on Logic in
|
||
Computer Science {(LICS} '93), Montreal, Canada, June
|
||
19-23, 1993},
|
||
pages = {98--109},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1993},
|
||
url = {https://doi.org/10.1109/LICS.1993.287596},
|
||
doi = {10.1109/LICS.1993.287596},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ BudiuErlingssonEtAl06,
|
||
author = {Budiu, Mihai and Erlingsson, \'{U}lfar and Abadi,
|
||
Mart\'{\i}n},
|
||
title = {Architectural Support for Software-based Protection},
|
||
booktitle = {Proceedings of the 1st Workshop on Architectural and
|
||
System Support for Improving Software Dependability},
|
||
series = {ASID '06},
|
||
year = {2006},
|
||
pages = {42--51},
|
||
numpages = {10},
|
||
url = {http://doi.acm.org/10.1145/1181309.1181316},
|
||
doi = {10.1145/1181309.1181316},
|
||
acmid = {1181316},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Proceedings{ Caires19,
|
||
editor = {Lu{\'{\i}}s Caires},
|
||
title = {Programming Languages and Systems - 28th European
|
||
Symposium on Programming, {ESOP} 2019, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of
|
||
Software, {ETAPS} 2019, Prague, Czech Republic, April 6-11,
|
||
2019, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {11423},
|
||
publisher = {Springer},
|
||
year = {2019},
|
||
url = {https://doi.org/10.1007/978-3-030-17184-1},
|
||
doi = {10.1007/978-3-030-17184-1},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@Article{ Capretta05,
|
||
author = {Venanzio Capretta},
|
||
title = {General recursion via coinductive types},
|
||
altjournal = {Logical Methods in Computer Science},
|
||
journal = {Log.\ Meth.\ Comput.\ Sci.},
|
||
volume = {1},
|
||
number = {2},
|
||
year = {2005}
|
||
}
|
||
|
||
@Article{ CarboniLackEtAl93,
|
||
title = {Introduction to Extensive and Distributive Categories},
|
||
author = {Carboni, Aurelio and Lack, Stephen and Walters, R. F. C.},
|
||
year = {1993},
|
||
month = feb,
|
||
journal = {Journal of Pure and Applied Algebra},
|
||
volume = {84},
|
||
number = {2},
|
||
pages = {145--158},
|
||
doi = {10.1016/0022-4049(93)90035-R}
|
||
}
|
||
|
||
@InProceedings{ CarterKecklerEtAl94,
|
||
author = {Carter, Nicholas P. and Keckler, Stephen W. and Dally,
|
||
William J.},
|
||
title = {Hardware Support for Fast Capability-based Addressing},
|
||
booktitle = {Proceedings of the Sixth International Conference on
|
||
Architectural Support for Programming Languages and
|
||
Operating Systems},
|
||
series = {ASPLOS VI},
|
||
year = {1994},
|
||
pages = {319--327},
|
||
numpages = {9},
|
||
url = {http://doi.acm.org/10.1145/195473.195579},
|
||
doi = {10.1145/195473.195579},
|
||
acmid = {195579},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Proceedings{ ChakravartyHuEtAl11,
|
||
editor = {Manuel M. T. Chakravarty and Zhenjiang Hu and Olivier
|
||
Danvy},
|
||
title = {Proceeding of the 16th {ACM} {SIGPLAN} international
|
||
conference on Functional Programming, {ICFP} 2011, Tokyo,
|
||
Japan, September 19-21, 2011},
|
||
publisher = {{ACM}},
|
||
year = {2011},
|
||
timestamp = {Thu, 22 Sep 2011 12:22:33 +0200}
|
||
}
|
||
|
||
@InProceedings{ ChapmanUustaluEtAl15,
|
||
author = {James Chapman and Tarmo Uustalu and Niccol{\`{o}} Veltri},
|
||
title = {Quotienting the Delay Monad by Weak Bisimilarity},
|
||
altbooktitle = {Theoretical Aspects of Computing - {ICTAC} 2015 - 12th
|
||
International Colloquium Cali, Colombia, October 29-31,
|
||
2015, Proceedings},
|
||
booktitle = {Theoretical Aspects of Computing, {ICTAC} 2015},
|
||
pages = {110--125},
|
||
year = {2015},
|
||
volume = {9399},
|
||
publisher = {Springer},
|
||
series = lncs
|
||
}
|
||
|
||
@Article{ ChapmanUustaluEtAl19,
|
||
title = {Quotienting the delay monad by weak bisimilarity},
|
||
volume = {29},
|
||
number = {1},
|
||
journal = {Mathematical Structures in Computer Science},
|
||
publisher = {Cambridge University Press},
|
||
author = {James Chapman and Tarmo Uustalu and Niccol{\`{o}} Veltri},
|
||
year = {2019},
|
||
pages = {67–92}
|
||
}
|
||
|
||
@InProceedings{ ChisnallDavisEtAl17,
|
||
title = {{{CHERI JNI}}: {{Sinking}} the {{Java Security Model}}
|
||
into the {{C}}},
|
||
booktitle = {International {{Conference}} on {{Architectural Support}}
|
||
for {{Programming Languages}} and {{Operating Systems}}},
|
||
publisher = {{ACM}},
|
||
doi = {10.1145/3037697.3037725},
|
||
author = {Chisnall, David and Davis, Brooks and Gudka, Khilan and
|
||
Brazdil, David and Joannou, Alexandre and Woodruff,
|
||
Jonathan and Markettos, A. Theodore and Maste, J. Edward
|
||
and Norton, Robert and Son, Stacey and Roe, Michael and
|
||
Moore, Simon W. and Neumann, Peter G. and Laurie, Ben and
|
||
Watson, Robert N.M.},
|
||
year = {2017},
|
||
pages = {569--583}
|
||
}
|
||
|
||
@Article{ ChisnallGargEtAl22,
|
||
author = {Chisnall, David and Garg, Deepak and Hritcu, Catalin and
|
||
Payer, Mathias},
|
||
title = {{Secure Compilation (Dagstuhl Seminar 21481)}},
|
||
pages = {173--204},
|
||
journal = {Dagstuhl Reports},
|
||
year = {2022},
|
||
volume = {11},
|
||
number = {10},
|
||
editor = {Chisnall, David and Garg, Deepak and Hritcu, Catalin and
|
||
Payer, Mathias},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
|
||
address = {Dagstuhl, Germany},
|
||
url = {https://drops.dagstuhl.de/opus/volltexte/2022/15933},
|
||
urn = {urn:nbn:de:0030-drops-159332},
|
||
doi = {10.4230/DagRep.11.10.173}
|
||
}
|
||
|
||
@InProceedings{ ChisnallRothwellEtAl15,
|
||
title = {Beyond the PDP-11: Architectural support for a memory-safe
|
||
C abstract machine},
|
||
author = {Chisnall, David and Rothwell, Colin and Watson, Robert NM
|
||
and Woodruff, Jonathan and Vadera, Munraj and Moore, Simon
|
||
W and Roe, Michael and Davis, Brooks and Neumann, Peter G},
|
||
booktitle = {ACM SIGPLAN Notices},
|
||
volume = {50},
|
||
number = {4},
|
||
pages = {117--130},
|
||
year = {2015},
|
||
organization = {ACM}
|
||
}
|
||
|
||
@Proceedings{ Chong12,
|
||
editor = {Stephen Chong},
|
||
title = {25th {IEEE} Computer Security Foundations Symposium, {CSF}
|
||
2012, Cambridge, MA, USA, June 25-27, 2012},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2012},
|
||
url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6265867},
|
||
timestamp = {Fri, 13 May 2016 11:46:54 +0200}
|
||
}
|
||
|
||
@Article{ ChowCorrellEtAl87,
|
||
author = {Chow, F. and Correll, S. and Himelstein, M. and Killian,
|
||
E. and Weber, L.},
|
||
title = {How Many Addressing Modes Are Enough?},
|
||
journal = {SIGPLAN Not.},
|
||
issue_date = {Oct. 1987},
|
||
volume = {22},
|
||
number = {10},
|
||
month = oct,
|
||
year = {1987},
|
||
pages = {117--121},
|
||
numpages = {5},
|
||
url = {http://doi.acm.org/10.1145/36205.36193},
|
||
doi = {10.1145/36205.36193},
|
||
acmid = {36193},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Ciobaca13,
|
||
author = "Ciob{\^a}c{\u{a}}, {\cedilla{S}}tefan",
|
||
editor = "Johnsen, Einar Broch and Petre, Luigia",
|
||
title = "From Small-Step Semantics to Big-Step Semantics,
|
||
Automatically",
|
||
booktitle = "Integrated Formal Methods",
|
||
year = "2013",
|
||
publisher = "Springer Berlin Heidelberg",
|
||
address = "Berlin, Heidelberg",
|
||
pages = "347--361"
|
||
}
|
||
|
||
@Article{ ClarksonSchneider10,
|
||
author = {Clarkson, Michael R. and Schneider, Fred B.},
|
||
title = {Hyperproperties},
|
||
journal = {J. Comput. Secur.},
|
||
volume = {18},
|
||
number = {6},
|
||
year = {2010},
|
||
pages = {1157--1210},
|
||
numpages = {54},
|
||
acmid = {1891830},
|
||
publisher = {IOS Press}
|
||
}
|
||
|
||
@Article{ Cockett93,
|
||
author = {J. Robin B. Cockett},
|
||
title = {Introduction to Distributive Categories},
|
||
journal = {Mathematical Structures in Computer Science},
|
||
volume = {3},
|
||
number = {3},
|
||
pages = {277--307},
|
||
year = {1993},
|
||
url = {https://doi.org/10.1017/S0960129500000232},
|
||
doi = {10.1017/S0960129500000232},
|
||
timestamp = {Sun, 28 May 2017 13:25:36 +0200}
|
||
}
|
||
|
||
@InProceedings{ CorradiniGroe-RhodeEtAl98,
|
||
author = {Andrea Corradini and Martin Gro{\ss}e{-}Rhode and Reiko
|
||
Heckel},
|
||
editor = {Bart Jacobs and Larry Moss and Horst Reichel and Jan J. M.
|
||
M. Rutten},
|
||
title = {Structured Transition Systems as Lax Coalgebras},
|
||
booktitle = {First Workshop on Coalgebraic Methods in Computer Science,
|
||
{CMCS} 1998, Lisbon, Portugal, March 28-29, 1998},
|
||
series = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {11},
|
||
pages = {22--41},
|
||
publisher = {Elsevier},
|
||
year = {1998},
|
||
url = {https://doi.org/10.1016/S1571-0661(04)00051-9},
|
||
doi = {10.1016/S1571-0661(04)00051-9},
|
||
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200}
|
||
}
|
||
|
||
@Article{ CostanDevadas16,
|
||
author = {Victor Costan and Srinivas Devadas},
|
||
title = {Intel {SGX} Explained},
|
||
journal = {{IACR} Cryptology ePrint Archive},
|
||
volume = {2016},
|
||
pages = {86},
|
||
year = {2016},
|
||
url = {http://eprint.iacr.org/2016/086},
|
||
timestamp = {Tue, 14 Aug 2018 17:08:21 +0200}
|
||
}
|
||
|
||
@InProceedings{ CostanLebedevEtAl16,
|
||
author = {Victor Costan and Ilia A. Lebedev and Srinivas Devadas},
|
||
editor = {Thorsten Holz and Stefan Savage},
|
||
title = {Sanctum: Minimal Hardware Extensions for Strong Software
|
||
Isolation},
|
||
booktitle = {25th {USENIX} Security Symposium, {USENIX} Security 16,
|
||
Austin, TX, USA, August 10-12, 2016},
|
||
pages = {857--874},
|
||
publisher = {{USENIX} Association},
|
||
year = {2016},
|
||
url = {https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/costan},
|
||
timestamp = {Mon, 05 Sep 2016 15:43:05 +0200}
|
||
}
|
||
|
||
@Article{ Crary19,
|
||
author = {Crary, Karl},
|
||
title = {Fully Abstract Module Compilation},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
issue_date = {January 2019},
|
||
volume = {3},
|
||
number = {POPL},
|
||
month = jan,
|
||
year = {2019},
|
||
pages = {10:1--10:29},
|
||
articleno = {10},
|
||
numpages = {29},
|
||
url = {http://doi.acm.org/10.1145/3290323},
|
||
doi = {10.1145/3290323},
|
||
acmid = {3290323},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Crstea10,
|
||
author = {Corina C{\^{\i}}rstea},
|
||
editor = {Bart Jacobs and Milad Niqui and Jan J. M. M. Rutten and
|
||
Alexandra Silva},
|
||
title = {Generic Infinite Traces and Path-Based Coalgebraic
|
||
Temporal Logics},
|
||
booktitle = {Proceedings of the Tenth Workshop on Coalgebraic Methods
|
||
in Computer Science, {CMCS} 2010, Paphos, Cyprus, March
|
||
26-28, 2010},
|
||
series = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {264},
|
||
number = {2},
|
||
pages = {83--103},
|
||
publisher = {Elsevier},
|
||
year = {2010},
|
||
url = {https://doi.org/10.1016/j.entcs.2010.07.015},
|
||
doi = {10.1016/j.entcs.2010.07.015},
|
||
timestamp = {Thu, 16 Jan 2020 11:02:39 +0100}
|
||
}
|
||
|
||
@Article{ CuijpersReniers05,
|
||
author = {Pieter J. L. Cuijpers and Michel A. Reniers},
|
||
title = {Hybrid process algebra},
|
||
journal = {J. Log. Algebr. Program.},
|
||
volume = {62},
|
||
number = {2},
|
||
pages = {191--245},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1016/j.jlap.2004.02.001},
|
||
doi = {10.1016/j.jlap.2004.02.001},
|
||
timestamp = {Sun, 28 May 2017 13:17:34 +0200}
|
||
}
|
||
|
||
@Article{ Curry30,
|
||
url = {http://www.jstor.org/stable/2370619},
|
||
author = {H. B. Curry},
|
||
journal = {Am. J. Math.},
|
||
number = {3},
|
||
pages = {509--536},
|
||
publisher = {Johns Hopkins University Press},
|
||
title = {Grundlagen der Kombinatorischen {L}ogik},
|
||
urldate = {2022-05-18},
|
||
volume = {52},
|
||
year = {1930}
|
||
}
|
||
|
||
@InProceedings{ DagninoGavazzo22,
|
||
author = {Francesco Dagnino and Francesco Gavazzo},
|
||
opteditor = {Amy P. Felty},
|
||
title = {A Fibrational Tale of Operational Logical Relations},
|
||
booktitle = {7th International Conference on Formal Structures for
|
||
Computation and Deduction (FSCD 2022)},
|
||
series = lipics,
|
||
volume = {228},
|
||
pages = {3:1--3:21},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2022},
|
||
doi = {10.4230/LIPIcs.FSCD.2022.3},
|
||
timestamp = {Wed, 07 Dec 2022 23:13:59 +0100}
|
||
}
|
||
|
||
@Article{ DagninoGavazzo23,
|
||
title = {A {Fibrational Tale} of {Operational Logical Relations}:
|
||
{Pure}, {Effectful} and {Differential}},
|
||
shorttitle = {A {Fibrational Tale} of {Operational Logical Relations}},
|
||
author = {Dagnino, Francesco and Gavazzo, Francesco},
|
||
year = {2023},
|
||
journal = {CoRR},
|
||
optmonth = mar,
|
||
eprint = {2303.03271},
|
||
primaryclass = {cs},
|
||
publisher = {{arXiv}},
|
||
doi = {10.48550/arXiv.2303.03271},
|
||
archiveprefix = {arxiv}
|
||
}
|
||
|
||
@Article{ Dal-LagoGavazzo21,
|
||
author = {Dal Lago, Ugo and Gavazzo, Francesco},
|
||
title = {Differential Logical Relations, Part II Increments and
|
||
Derivatives},
|
||
year = {2021},
|
||
optissue_date = {Dec 2021},
|
||
publisher = {Elsevier Science Publishers Ltd.},
|
||
address = {GBR},
|
||
volume = {895},
|
||
number = {C},
|
||
doi = {10.1016/j.tcs.2021.09.027},
|
||
journal = {Theor. Comput. Sci.},
|
||
optmonth = {Dec},
|
||
pages = {34–47},
|
||
numpages = {14}
|
||
}
|
||
|
||
@InProceedings{ Dal-LagoGavazzoEtAl17,
|
||
author = {Dal Lago, Ugo and Gavazzo, Francesco and Levy, Paul
|
||
Blain},
|
||
title = {Effectful applicative bisimilarity: Monads, relators, and
|
||
{H}owe's method},
|
||
booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer
|
||
Science (LICS 2017)},
|
||
pages = {1--12},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2017},
|
||
doi = {10.1109/LICS.2017.8005117},
|
||
timestamp = {Fri, 27 Mar 2020 08:47:04 +0100}
|
||
}
|
||
|
||
@InProceedings{ Danielsson12,
|
||
author = {Danielsson, Nils Anders},
|
||
title = {Operational semantics using the partiality monad},
|
||
year = {2012},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
url = {https://doi.org/10.1145/2364527.2364546},
|
||
doi = {10.1145/2364527.2364546},
|
||
booktitle = {Proceedings of the 17th ACM SIGPLAN International
|
||
Conference on Functional Programming},
|
||
pages = {127–138},
|
||
numpages = {12},
|
||
series = {ICFP 2012}
|
||
}
|
||
|
||
@Book{ Dash13,
|
||
author = {Dash, Pradyumna},
|
||
title = {Getting Started with Oracle VM VirtualBox},
|
||
year = {2013},
|
||
publisher = {Packt Publishing}
|
||
}
|
||
|
||
@InProceedings{ De-AmorimDenesEtAl15,
|
||
title = {Micro-policies: Formally verified, tag-based security
|
||
monitors},
|
||
author = {De Amorim, Arthur Azevedo and D{\'e}nes, Maxime and
|
||
Giannarakis, Nick and Hritcu, Catalin and Pierce, Benjamin
|
||
C and Spector-Zabusky, Antal and Tolmach, Andrew},
|
||
booktitle = {Security and Privacy (SP), 2015 IEEE Symposium on},
|
||
pages = {813--830},
|
||
year = {2015},
|
||
organization = {IEEE}
|
||
}
|
||
|
||
@Proceedings{ DeAngelisFedyukovichEtAl19,
|
||
editor = {Emanuele {De Angelis} and Grigory Fedyukovich and Nikos
|
||
Tzevelekos and Mattias Ulbrich},
|
||
title = {Proceedings of the Sixth Workshop on Horn Clauses for
|
||
Verification and Synthesis and Third Workshop on Program
|
||
Equivalence and Relational Reasoning, HCVS/PERR@ETAPS 2019,
|
||
Prague, Czech Republic, 6-7th April 2019},
|
||
series = {{EPTCS}},
|
||
volume = {296},
|
||
year = {2019},
|
||
url = {https://doi.org/10.4204/EPTCS.296},
|
||
doi = {10.4204/EPTCS.296},
|
||
timestamp = {Tue, 08 Oct 2019 16:56:57 +0200}
|
||
}
|
||
|
||
@Article{ deBruijn72,
|
||
title = {Lambda calculus notation with nameless dummies, a tool for
|
||
automatic formula manipulation, with application to the
|
||
Church-Rosser theorem},
|
||
journal = {Indagationes Mathematicae (Proceedings)},
|
||
volume = 75,
|
||
number = 5,
|
||
pages = {381-392},
|
||
year = 1972,
|
||
doi = {https://doi.org/10.1016/1385-7258(72)90034-0},
|
||
author = {N.G {de Bruijn}}
|
||
}
|
||
|
||
@Article{ DeliguoroPiperno95,
|
||
title = {Nondeterministic Extensions of Untyped $\lambda$-Calculus},
|
||
journal = {Information and Computation},
|
||
volume = {122},
|
||
number = {2},
|
||
pages = {149-177},
|
||
year = {1995},
|
||
doi = {https://doi.org/10.1006/inco.1995.1145},
|
||
url = {https://www.sciencedirect.com/science/article/pii/S0890540185711455},
|
||
author = {U. Deliguoro and A. Piperno}
|
||
}
|
||
|
||
@Article{ DennisVan-Horn66,
|
||
title = {Programming semantics for multiprogrammed computations},
|
||
author = {Dennis, Jack B and Van Horn, Earl C},
|
||
journal = {Communications of the ACM},
|
||
volume = {9},
|
||
number = {3},
|
||
pages = {143--155},
|
||
year = {1966},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@InProceedings{ DeviettiBlundellEtAl08,
|
||
title = {Hardbound: architectural support for spatial safety of the
|
||
C programming language},
|
||
author = {Devietti, Joe and Blundell, Colin and Martin, Milo MK and
|
||
Zdancewic, Steve},
|
||
booktitle = {ACM SIGARCH Computer Architecture News},
|
||
volume = {36},
|
||
number = {1},
|
||
pages = {103--114},
|
||
year = {2008},
|
||
organization = {ACM}
|
||
}
|
||
|
||
@InProceedings{ DevrieseBirkedalEtAl16,
|
||
author = {Dominique Devriese and Lars Birkedal and Frank Piessens},
|
||
title = {Reasoning about Object Capabilities with Logical Relations
|
||
and Effect Parametricity},
|
||
booktitle = {{IEEE} European Symposium on Security and Privacy,
|
||
EuroS{\&}P 2016, Saarbr{\"{u}}cken, Germany, March 21-24,
|
||
2016},
|
||
pages = {147--162},
|
||
year = {2016},
|
||
url = {http://dx.doi.org/10.1109/EuroSP.2016.22},
|
||
doi = {10.1109/EuroSP.2016.22},
|
||
timestamp = {Sun, 05 Jun 2016 10:00:11 +0200}
|
||
}
|
||
|
||
@InProceedings{ DevriesePatrignaniEtAl16,
|
||
author = {Dominique Devriese and Marco Patrignani and Frank
|
||
Piessens},
|
||
title = {Fully-abstract compilation by approximate
|
||
back-translation},
|
||
booktitle = {43rd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles
|
||
of Programming Languages, {POPL} 2016},
|
||
pages = {164--177},
|
||
year = {2016},
|
||
crossref-ignore={DBLP:conf/popl/2016},
|
||
doi = {10.1145/2837614.2837618}
|
||
}
|
||
|
||
@Article{ Dezani-CiancagliniEtAl98,
|
||
author = {Dezani-Ciancaglini, Mariangiola and de'Liguoro, Ugo and
|
||
Piperno, Adolfo},
|
||
title = {A Filter Model for Concurrent Lambda-Calculus},
|
||
journal = {SIAM Journal on Computing},
|
||
volume = {27},
|
||
number = {5},
|
||
pages = {1376-1419},
|
||
year = {1998},
|
||
doi = {10.1137/S0097539794275860},
|
||
url = {
|
||
|
||
https://doi.org/10.1137/S0097539794275860
|
||
|
||
},
|
||
eprint = {
|
||
|
||
https://doi.org/10.1137/S0097539794275860
|
||
|
||
}
|
||
}
|
||
|
||
@Article{ DhawanHritcuEtAl15,
|
||
author = {Dhawan, Udit and Hritcu, Catalin and Rubin, Raphael and
|
||
Vasilakis, Nikos and Chiricescu, Silviu and Smith, Jonathan
|
||
M. and Knight,Jr., Thomas F. and Pierce, Benjamin C. and
|
||
DeHon, Andre},
|
||
title = {Architectural Support for Software-Defined Metadata
|
||
Processing},
|
||
journal = {SIGARCH Comput. Archit. News},
|
||
issue_date = {March 2015},
|
||
volume = {43},
|
||
number = {1},
|
||
month = mar,
|
||
year = {2015},
|
||
pages = {487--502},
|
||
numpages = {16},
|
||
url = {http://doi.acm.org/10.1145/2786763.2694383},
|
||
doi = {10.1145/2786763.2694383},
|
||
acmid = {2694383},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Di-GianantonioHonsellEtAl08,
|
||
author = "Di Gianantonio, Pietro and Honsell, Furio and Lenisa,
|
||
Marina",
|
||
editor = "Amadio, Roberto",
|
||
title = "RPO, Second-Order Contexts, and $\lambda$-Calculus",
|
||
booktitle = "Foundations of Software Science and Computational
|
||
Structures",
|
||
year = "2008",
|
||
publisher = "Springer Berlin Heidelberg",
|
||
address = "Berlin, Heidelberg"
|
||
}
|
||
|
||
@InProceedings{ DreyerAhmedEtAl09,
|
||
author = {Dreyer, Derek and Ahmed, Amal and Birkedal, Lars},
|
||
booktitle = {24th Annual IEEE Symposium on Logic In Computer Science
|
||
(LICS 2009)},
|
||
title = {Logical Step-Indexed Logical Relations},
|
||
year = {2009},
|
||
publisher = {IEEE Computer Society},
|
||
optvolume = {},
|
||
optnumber = {},
|
||
pages = {71-80},
|
||
doi = {10.1109/LICS.2009.34}
|
||
}
|
||
|
||
@Article{ DreyerAhmedEtAl11,
|
||
author = {Derek Dreyer and Amal Ahmed and Lars Birkedal},
|
||
title = {Logical Step-Indexed Logical Relations},
|
||
journal = {Log. Methods Comput. Sci.},
|
||
volume = {7},
|
||
number = {2},
|
||
year = {2011},
|
||
doi = {10.2168/LMCS-7(2:16)2011}
|
||
}
|
||
|
||
@Article{ DreyerNeisEtAl12,
|
||
author = {Derek Dreyer and Georg Neis and Lars Birkedal},
|
||
title = {The impact of higher-order state and control effects on
|
||
local relational reasoning},
|
||
journal = {J. Funct. Program.},
|
||
volume = {22},
|
||
number = {4-5},
|
||
pages = {477--528},
|
||
year = {2012},
|
||
doi = {10.1017/S095679681200024X}
|
||
}
|
||
|
||
@InProceedings{ DSilvaPayerEtAl15,
|
||
title = {The correctness-security gap in compiler optimization},
|
||
author = {D'Silva, Vijay and Payer, Mathias and Song, Dawn},
|
||
booktitle = {2015 IEEE Security and Privacy Workshops},
|
||
pages = {73--87},
|
||
year = {2015},
|
||
organization = {IEEE}
|
||
}
|
||
|
||
@Article{ EilenbergMacLane45,
|
||
title = {General theory of natural equivalences},
|
||
author = {Eilenberg, Samuel and MacLane, Saunders},
|
||
journal = {Transactions of the American Mathematical Society},
|
||
volume = {58},
|
||
number = {2},
|
||
pages = {231--294},
|
||
year = {1945},
|
||
publisher = {JSTOR}
|
||
}
|
||
|
||
@TechReport{ El-Korashy16,
|
||
author = {El-Korashy, Akram},
|
||
title = {{A Formal Model for Capability Machines: An Illustrative
|
||
Case Study towards Secure Compilation to CHERI}},
|
||
year = 2016,
|
||
month = september,
|
||
url = {https://people.mpi-sws.org/~elkorashy/},
|
||
institution = {{Max-Planck Institute for Software Systems,
|
||
Saarbr\"ucken}}
|
||
}
|
||
|
||
@Article{ El-KorashyTsampasEtAl20,
|
||
author = {Akram El{-}Korashy and Stelios Tsampas and Marco
|
||
Patrignani and Dominique Devriese and Deepak Garg and Frank
|
||
Piessens},
|
||
title = {CapablePtrs: Securely Compiling Partial Programs using the
|
||
Pointers-as-Capabilities Principle},
|
||
journal = {CoRR},
|
||
volume = {abs/2005.05944},
|
||
year = {2020},
|
||
url = {https://arxiv.org/abs/2005.05944},
|
||
archiveprefix = {arXiv},
|
||
eprint = {2005.05944},
|
||
timestamp = {Thu, 14 May 2020 16:56:02 +0200},
|
||
note = {Submitted for publication at CSF 2021}
|
||
}
|
||
|
||
@InProceedings{ ErlingssonSchneider00,
|
||
author = {Erlingsson, \'{U}lfar and Schneider, Fred B.},
|
||
title = {SASI Enforcement of Security Policies: A Retrospective},
|
||
booktitle = {Proceedings of the 1999 Workshop on New Security
|
||
Paradigms},
|
||
series = {NSPW '99},
|
||
year = {2000},
|
||
pages = {87--95},
|
||
numpages = {9},
|
||
url = {http://doi.acm.org/10.1145/335169.335201},
|
||
doi = {10.1145/335169.335201},
|
||
acmid = {335201},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Fabry74,
|
||
author = {Fabry, R. S.},
|
||
title = {Capability-based Addressing},
|
||
journal = {Commun. ACM},
|
||
issue_date = {July 1974},
|
||
volume = {17},
|
||
number = {7},
|
||
month = jul,
|
||
year = {1974},
|
||
pages = {403--412},
|
||
numpages = {10},
|
||
url = {http://doi.acm.org/10.1145/361011.361070},
|
||
doi = {10.1145/361011.361070},
|
||
acmid = {361070},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@PhDThesis{ Feist17,
|
||
author = {Josselin Feist},
|
||
title = {Finding the needle in the heap : combining binary analysis
|
||
techniques to trigger use-after-free. (Analyses de code
|
||
binaire pour la d{\'{e}}tection et le d{\'{e}}clenchement
|
||
de use-after-free)},
|
||
school = {Grenoble Alpes University, France},
|
||
year = {2017},
|
||
url = {https://tel.archives-ouvertes.fr/tel-01681707},
|
||
timestamp = {Fri, 09 Feb 2018 20:55:33 +0100}
|
||
}
|
||
|
||
@InProceedings{ Felleisen91,
|
||
author = {Felleisen, Matthias},
|
||
title = {On the Expressive Power of Programming Languages},
|
||
booktitle = {Selected Papers from the Symposium on 3rd European
|
||
Symposium on Programming},
|
||
series = {ESOP '90},
|
||
year = {1991},
|
||
pages = {35--75},
|
||
numpages = {41},
|
||
acmid = {138493},
|
||
publisher = {Elsevier North-Holland, Inc.},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ FilardoGutsteinEtAl20,
|
||
title = {Cornucopia: Temporal Safety for CHERI Heaps},
|
||
author = {Filardo, Nathaniel Wesley and Gutstein, Brett F and
|
||
Woodruff, Jonathan and Ainsworth, Sam and Paul-Trifu,
|
||
Lucian and Davis, Brooks and Xia, Hongyan and Napierala,
|
||
Edward Tomasz and Richardson, Alexander and Baldwin, John
|
||
and others},
|
||
booktitle = {2020 IEEE Symposium on Security and Privacy (SP). Los
|
||
Alamitos, CA, USA: IEEE Computer Society},
|
||
pages = {1507--1524},
|
||
year = {2020}
|
||
}
|
||
|
||
@Article{ FilloKecklerEtAl97,
|
||
title = {The m-machine multicomputer},
|
||
author = {Fillo, Marco and Keckler, Stephen W and Dally, William J
|
||
and Carter, Nicholas P and Chang, Andrew and Gurevich,
|
||
Yevgeny and Lee, Whay S},
|
||
journal = {International Journal of Parallel Programming},
|
||
volume = {25},
|
||
number = {3},
|
||
pages = {183--212},
|
||
year = {1997},
|
||
publisher = {Springer}
|
||
}
|
||
|
||
@InProceedings{ Fiore05,
|
||
author = {Marcelo P. Fiore},
|
||
opteditor = {Vladimiro Sassone},
|
||
title = {Mathematical Models of Computational and Combinatorial
|
||
Structures},
|
||
booktitle = {8th International Conference on Foundations of Software
|
||
Science and Computational Structures (FOSSACS 2005)},
|
||
series = lncs,
|
||
volume = {3441},
|
||
pages = {25--46},
|
||
publisher = springer,
|
||
year = {2005},
|
||
doi = {10.1007/978-3-540-31982-5\_2},
|
||
timestamp = {Tue, 14 May 2019 10:00:55 +0200}
|
||
}
|
||
|
||
@InProceedings{ Fiore07,
|
||
title = {A mathematical theory of substitution and its applications
|
||
to syntax and semantics},
|
||
author = {Fiore, Marcelo},
|
||
year = {2007},
|
||
note = {Invited tutorial for the Workshop on Mathematical Theories
|
||
of Abstraction, Substitution and Naming in Computer
|
||
Science, ICMS.}
|
||
}
|
||
|
||
@InProceedings{ Fiore08,
|
||
author = {Marcelo P. Fiore},
|
||
title = {Second-Order and Dependently-Sorted Abstract Syntax},
|
||
booktitle = {23d Annual {IEEE} Symposium on Logic in Computer Science
|
||
(LICS 2008)},
|
||
pages = {57--68},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2008},
|
||
doi = {10.1109/LICS.2008.38},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ Fiore22,
|
||
author = {Marcelo Fiore},
|
||
title = {Semantic analysis of normalisation by evaluation for typed
|
||
lambda calculus},
|
||
journal = {Math. Struct. Comput. Sci.},
|
||
volume = {32},
|
||
number = {8},
|
||
pages = {1028--1065},
|
||
year = {2022},
|
||
doi = {10.1017/S0960129522000263},
|
||
timestamp = {Tue, 21 Mar 2023 21:14:23 +0100}
|
||
}
|
||
|
||
@InProceedings{ FioreHur10,
|
||
author = {Marcelo P. Fiore and Chung{-}Kil Hur},
|
||
opteditor = {Anuj Dawar and Helmut Veith},
|
||
title = {Second-Order Equational Logic (Extended Abstract)},
|
||
booktitle = {24th International Workshop on Computer Science Logic (CSL
|
||
2010)},
|
||
series = lncs,
|
||
volume = {6247},
|
||
pages = {320--335},
|
||
publisher = springer,
|
||
year = {2010},
|
||
doi = {10.1007/978-3-642-15205-4\_26},
|
||
timestamp = {Tue, 14 May 2019 10:00:42 +0200}
|
||
}
|
||
|
||
@InProceedings{ FiorePlotkin94,
|
||
author = {Marcelo P. Fiore and Gordon D. Plotkin},
|
||
title = {An Axiomatization of Computationally Adequate Domain
|
||
Theoretic Models of {FPC}},
|
||
booktitle = {9th Annual Symposium on Logic in Computer Science ({LICS}
|
||
'94)},
|
||
pages = {92--102},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1994},
|
||
doi = {10.1109/LICS.1994.316083}
|
||
}
|
||
|
||
@InProceedings{ FiorePlotkinEtAl99,
|
||
author = {Marcelo P. Fiore and Gordon D. Plotkin and Daniele Turi},
|
||
title = {Abstract Syntax and Variable Binding},
|
||
booktitle = {14th Annual {IEEE} Symposium on Logic in Computer Science
|
||
(LICS 1999)},
|
||
pages = {193--202},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1999},
|
||
doi = {10.1109/LICS.1999.782615},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ FioreStaton06,
|
||
author = {Marcelo P. Fiore and Sam Staton},
|
||
title = {A Congruence Rule Format for Name-Passing Process Calculi
|
||
from Mathematical Structural Operational Semantics},
|
||
booktitle = {21st Annual {IEEE} Symposium on Logic in Computer Science,
|
||
LICS'06},
|
||
pages = {49--58},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1109/LICS.2006.7},
|
||
doi = {10.1109/LICS.2006.7},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ FioreStaton10,
|
||
title = {Positive structural operational semantics and monotone
|
||
distributive laws},
|
||
author = {Fiore, Marcelo and Staton, Sam},
|
||
year = {2010}
|
||
}
|
||
|
||
@Article{ FioreSzamozvancev22,
|
||
author = {Fiore, Marcelo and Szamozvancev, Dmitrij},
|
||
title = {Formal Metatheory of Second-Order Abstract Syntax},
|
||
year = {2022},
|
||
issue_date = {January 2022},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {6},
|
||
number = {POPL},
|
||
url = {https://doi.org/10.1145/3498715},
|
||
doi = {10.1145/3498715},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
month = {jan},
|
||
articleno = {53},
|
||
numpages = {29}
|
||
}
|
||
|
||
@InProceedings{ FioreTuri01,
|
||
author = {Marcelo P. Fiore and Daniele Turi},
|
||
title = {Semantics of Name and Value Passing},
|
||
booktitle = {16th Annual {IEEE} Symposium on Logic in Computer Science
|
||
(LICS 2001)},
|
||
pages = {93--104},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2001},
|
||
doi = {10.1109/LICS.2001.932486},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ FiroreTuri01,
|
||
author = {Firore, M. and Turi, D.},
|
||
booktitle = {Proceedings 16th Annual IEEE Symposium on Logic in
|
||
Computer Science},
|
||
title = {Semantics of name and value passing},
|
||
year = 2001,
|
||
pages = {93-104},
|
||
doi = {10.1109/LICS.2001.932486}
|
||
}
|
||
|
||
@InProceedings{ ForsterSchaferEtAl19,
|
||
author = {Forster, Yannick and Sch\"{a}fer, Steven and Spies, Simon
|
||
and Stark, Kathrin},
|
||
title = {Call-by-push-value in Coq: operational, equational, and
|
||
denotational theory},
|
||
year = {2019},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
url = {https://doi.org/10.1145/3293880.3294097},
|
||
doi = {10.1145/3293880.3294097},
|
||
booktitle = {Proceedings of the 8th ACM SIGPLAN International
|
||
Conference on Certified Programs and Proofs},
|
||
pages = {118–131},
|
||
numpages = {14},
|
||
series = {CPP 2019}
|
||
}
|
||
|
||
@InProceedings{ FournetSwamyEtAl13,
|
||
author = {C{\'{e}}dric Fournet and Nikhil Swamy and Juan Chen and
|
||
Pierre{-}{\'{E}}variste Dagand and Pierre{-}Yves Strub and
|
||
Benjamin Livshits},
|
||
title = {Fully abstract compilation to JavaScript},
|
||
booktitle = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on
|
||
Principles of Programming Languages, {POPL} '13, Rome,
|
||
Italy - January 23 - 25, 2013},
|
||
pages = {371--384},
|
||
year = {2013},
|
||
crossref-ignore={DBLP:conf/popl/2013},
|
||
url = {https://doi.org/10.1145/2429069.2429114},
|
||
doi = {10.1145/2429069.2429114},
|
||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100}
|
||
}
|
||
|
||
@InBook{ Fox12,
|
||
author = "Fox, Anthony",
|
||
editor = "Beringer, Lennart and Felty, Amy",
|
||
title = "Directions in ISA Specification",
|
||
booktitle = "Interactive Theorem Proving: Third International
|
||
Conference, ITP 2012, Princeton, NJ, USA, August 13-15,
|
||
2012. Proceedings",
|
||
year = "2012",
|
||
publisher = "Springer Berlin Heidelberg",
|
||
address = "Berlin, Heidelberg",
|
||
pages = "338--344",
|
||
doi = "10.1007/978-3-642-32347-8_23",
|
||
url = "http://dx.doi.org/10.1007/978-3-642-32347-8_23"
|
||
}
|
||
|
||
@InBook{ Fox15,
|
||
author = {Fox, Anthony},
|
||
editor = "Urban, Christian and Zhang, Xingyuan",
|
||
title = "Improved Tool Support for Machine-Code Decompilation in
|
||
HOL4",
|
||
booktitle = "Interactive Theorem Proving: 6th International Conference,
|
||
ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings",
|
||
year = "2015",
|
||
publisher = "Springer International Publishing",
|
||
address = "Cham",
|
||
pages = "187--202",
|
||
doi = "10.1007/978-3-319-22102-1_12",
|
||
url = "http://dx.doi.org/10.1007/978-3-319-22102-1_12"
|
||
}
|
||
|
||
@InProceedings{ GallagherHermenegildoEtAl20,
|
||
title = {From big-step to small-step semantics and back with
|
||
interpreter specialisation},
|
||
volume = {320},
|
||
doi = {10.4204/EPTCS.320.4},
|
||
booktitle = {Electronic Proceedings in Theoretical Computer Science,
|
||
EPTCS},
|
||
publisher = {Open Publishing Association},
|
||
author = {Gallagher, John P. and Hermenegildo, Manuel and Kafle,
|
||
Bishoksan and Klemen, Maximiliano and García, Pedro López
|
||
and Morales, José},
|
||
year = {2020},
|
||
pages = {50-64}
|
||
}
|
||
|
||
@Proceedings{ GarrigueKellerEtAl16,
|
||
editor = {Jacques Garrigue and Gabriele Keller and Eijiro Sumii},
|
||
title = {Proceedings of the 21st {ACM} {SIGPLAN} International
|
||
Conference on Functional Programming, {ICFP} 2016, Nara,
|
||
Japan, September 18-22, 2016},
|
||
publisher = {{ACM}},
|
||
year = {2016},
|
||
doi = {10.1145/2951913},
|
||
timestamp = {Tue, 06 Nov 2018 16:59:25 +0100}
|
||
}
|
||
|
||
@Article{ GeorgesGueneauEtAl23,
|
||
author = {Georges, A\"{\i}na Linn and Gu\'{e}neau, Arma\"{e}l and
|
||
Van Strydonck, Thomas and Timany, Amin and Trieu, Alix and
|
||
Devriese, Dominique and Birkedal, Lars},
|
||
title = {Cerise: Program Verification on a Capability Machine in
|
||
the Presence of Untrusted Code},
|
||
year = {2023},
|
||
publisher = acm,
|
||
optaddress = {New York, NY, USA},
|
||
doi = {10.1145/3623510},
|
||
journal = {J. ACM},
|
||
optmonth = {sep}
|
||
}
|
||
|
||
@Unpublished{ GeorgesGuéneauEtAl21,
|
||
author = {Aïna Linn Georges and Armaël Guéneau and Alix Trieu and
|
||
Lars Birkedal},
|
||
title = {Toward Complete Stack Safety for Capability Machines},
|
||
year = {2021},
|
||
note = {unpublished}
|
||
}
|
||
|
||
@Article{ GeYaromEtAl18,
|
||
author = {Qian Ge and Yuval Yarom and David Cock and Gernot Heiser},
|
||
title = {A survey of microarchitectural timing attacks and
|
||
countermeasures on contemporary hardware},
|
||
journal = {J. Cryptographic Engineering},
|
||
year = {2018},
|
||
volume = {8},
|
||
number = {1},
|
||
pages = {1--27},
|
||
doi = {10.1007/s13389-016-0141-6}
|
||
}
|
||
|
||
@InProceedings{ GhaniLuthEtAl01,
|
||
author = {Neil Ghani and Christoph L{\"{u}}th and Federico De Marchi
|
||
and John Power},
|
||
editor = {Andrea Corradini and Marina Lenisa and Ugo Montanari},
|
||
title = {Algebras, Coalgebras, Monads and Comonads},
|
||
booktitle = {Coalgebraic Methods in Computer Science, {CMCS} 2001, a
|
||
Satellite Event of {ETAPS} 2001, Genova, Italy, April 6-7,
|
||
2001},
|
||
series = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {44},
|
||
number = {1},
|
||
pages = {128--145},
|
||
publisher = {Elsevier},
|
||
year = {2001},
|
||
url = {https://doi.org/10.1016/S1571-0661(04)80905-8},
|
||
doi = {10.1016/S1571-0661(04)80905-8},
|
||
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200}
|
||
}
|
||
|
||
@Proceedings{ GiacobazziCousot13,
|
||
editor = {Roberto Giacobazzi and Radhia Cousot},
|
||
title = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on
|
||
Principles of Programming Languages, {POPL} '13, Rome,
|
||
Italy - January 23 - 25, 2013},
|
||
publisher = {{ACM}},
|
||
year = {2013},
|
||
url = {http://dl.acm.org/citation.cfm?id=2429069},
|
||
timestamp = {Fri, 18 Jan 2013 17:48:28 +0100}
|
||
}
|
||
|
||
@InProceedings{ GiarrussoStefanescoEtAl20,
|
||
author = {Giarrusso, Paolo G. and Stefanesco, L\'{e}o and Timany,
|
||
Amin and Birkedal, Lars and Krebbers, Robbert},
|
||
title = {Scala Step-by-Step: Soundness for DOT with Step-Indexed
|
||
Logical Relations in Iris},
|
||
booktitle = {25th ACM SIGPLAN International Conference on Functional
|
||
Programming (ICFP 2020)},
|
||
year = {2020},
|
||
issue_date = {August 2020},
|
||
publisher = acm,
|
||
optaddress = {New York, NY, USA},
|
||
volume = {4},
|
||
optnumber = {ICFP},
|
||
doi = {10.1145/3408996},
|
||
series = {Proc. ACM Program. Lang.},
|
||
optmonth = {aug},
|
||
articleno = {114},
|
||
numpages = {29}
|
||
}
|
||
|
||
@Book{ GirardTaylorEtAl89,
|
||
title = {Proofs and types},
|
||
author = {Girard, Jean-Yves and Taylor, Paul and Lafont, Yves},
|
||
volume = {7},
|
||
year = {1989},
|
||
publisher = {Cambridge University Press}
|
||
}
|
||
|
||
@Article{ Glabbeek11,
|
||
author = {Rob J. van Glabbeek},
|
||
title = {On cool congruence formats for weak bisimulations},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {412},
|
||
number = {28},
|
||
pages = {3283--3302},
|
||
year = {2011},
|
||
doi = {10.1016/j.tcs.2011.02.036},
|
||
timestamp = {Sun, 28 May 2017 13:20:00 +0200}
|
||
}
|
||
|
||
@InProceedings{ Glabbeek93,
|
||
author = {Rob J. van Glabbeek},
|
||
editor = {Maurice Nivat and Charles Rattray and Teodor Rus and
|
||
Giuseppe Scollo},
|
||
title = {Full Abstraction in Structural Operational Semantics
|
||
(Extended Abstract)},
|
||
booktitle = {Algebraic Methodology and Software Technology {(AMAST}
|
||
'93), Proceedings of the Third International Conference on
|
||
Methodology and Software Technology, University of Twente,
|
||
Enschede, The Netherlands, 21-25 June, 1993},
|
||
series = {Workshops in Computing},
|
||
pages = {75--82},
|
||
publisher = {Springer},
|
||
year = {1993},
|
||
timestamp = {Tue, 18 Feb 2003 11:00:12 +0100}
|
||
}
|
||
|
||
@Article{ GoguenJames-ThatcherEtAl77,
|
||
author = {Joseph Goguen and James Thatcher, and Eric Wagner},
|
||
title = {An initial algebra approach to the specification,
|
||
correctness and implementation of abstract data types},
|
||
year = {1977},
|
||
editor = {Raymond T. Yeh},
|
||
journal = {Current Trends in Programming Methodology},
|
||
publisher = {Prentice Hall}
|
||
}
|
||
|
||
@InProceedings{ Goncharov21,
|
||
author = {Goncharov, Sergey},
|
||
title = {{Uniform Elgot Iteration in Foundations}},
|
||
booktitle = {48th International Colloquium on Automata, Languages, and
|
||
Programming (ICALP 2021)},
|
||
pages = {131:1--131:16},
|
||
series = {LIPIcs},
|
||
year = {2021},
|
||
volume = {198},
|
||
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
|
||
noaddress = {Dagstuhl, Germany}
|
||
}
|
||
|
||
@InProceedings{ GoncharovMiliusEtAl22,
|
||
author = {Sergey Goncharov and Stefan Milius and Lutz Schr{\"{o}}der
|
||
and Stelios Tsampas and Henning Urbat},
|
||
editor = {Amy P. Felty},
|
||
title = {Stateful Structural Operational Semantics},
|
||
booktitle = {7th International Conference on Formal Structures for
|
||
Computation and Deduction, FSCD'22},
|
||
series = {LIPIcs},
|
||
volume = {228},
|
||
pages = {30:1--30:19},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2022},
|
||
url = {https://doi.org/10.4230/LIPIcs.FSCD.2022.30},
|
||
doi = {10.4230/LIPIcs.FSCD.2022.30},
|
||
timestamp = {Sun, 02 Oct 2022 16:01:34 +0200}
|
||
}
|
||
|
||
@Article{ GoncharovMiliusEtAl23,
|
||
title = {Towards a Higher-Order Mathematical Operational
|
||
Semantics},
|
||
author = {Sergey Goncharov and Stefan Milius and Lutz Schröder and
|
||
Stelios Tsampas and Henning Urbat},
|
||
journal = {Proc. {ACM} Program. Lang.},
|
||
volume = {7},
|
||
number = {{POPL}},
|
||
pages = {632--658},
|
||
year = {2023},
|
||
url = {https://doi.org/10.1145/3571215},
|
||
doi = {10.1145/3571215}
|
||
}
|
||
|
||
@InProceedings{ GoncharovMiliusEtAl24,
|
||
author = {Sergey Goncharov and Stefan Milius and Stelios Tsampas and
|
||
Henning Urbat},
|
||
title = {Bialgebraic Reasoning on Higher-Order Program
|
||
Equivalence},
|
||
year = "2024",
|
||
publisher = {IEEE Computer Society Press},
|
||
booktitle = {39th Annual ACM/IEEE Symposium on Logic in Computer
|
||
Science (LICS 2024)},
|
||
doi = {10.1145/3661814.3662099},
|
||
note = {Preprint: \url{https://arxiv.org/abs/2402.00625}}
|
||
}
|
||
|
||
@Article{ GoncharovMiliusEtAl24a,
|
||
author = {Goncharov, Sergey and Milius, Stefan and Schröder, Lutz
|
||
and Tsampas, Stelios and Urbat, Henning},
|
||
title = {Higher-Order Mathematical Operational Semantics},
|
||
publisher = {Cambridge University Press},
|
||
journal = {CoRR},
|
||
year = 2024
|
||
}
|
||
|
||
@InProceedings{ GoncharovPattinson14,
|
||
author = {Sergey Goncharov and Dirk Pattinson},
|
||
editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt
|
||
and Elias Koutsoupias},
|
||
title = {Coalgebraic Weak Bisimulation from Recursive Equations
|
||
over Monads},
|
||
booktitle = {Proc.~41st International Colloquium on Automata,
|
||
Languages, and Programming, {ICALP~2014}},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8573},
|
||
pages = {196--207},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
url = {https://doi.org/10.1007/978-3-662-43951-7\_17},
|
||
doi = {10.1007/978-3-662-43951-7\_17},
|
||
notimestamp = {Sat, 19 Oct 2019 20:37:18 +0200}
|
||
}
|
||
|
||
@InProceedings{ GoncharovSantamariaEtAl24,
|
||
author = "Goncharov, Sergey and Santamaria, Alessio and
|
||
Schr{\"o}der, Lutz and Tsampas, Stelios and Urbat, Henning",
|
||
editor = "Kobayashi, Naoki and Worrell, James",
|
||
title = "Logical Predicates in Higher-Order Mathematical
|
||
Operational Semantics",
|
||
booktitle = "Foundations of Software Science and Computation
|
||
Structures",
|
||
year = "2024",
|
||
publisher = "Springer Nature Switzerland",
|
||
address = "Cham",
|
||
pages = "47--69"
|
||
}
|
||
|
||
@Article{ GoncharovSchroderEtAl18,
|
||
author = {Sergey Goncharov and Lutz Schr{\"{o}}der and Christoph
|
||
Rauch and Julian Jakob},
|
||
title = {Unguarded Recursion on Coinductive Resumptions},
|
||
journal = {Log.\ Methods Comput.\ Sci.},
|
||
volume = {14},
|
||
number = {3},
|
||
year = {2018},
|
||
timestamp = {Thu, 18 Jun 2020 22:15:48 +0200}
|
||
}
|
||
|
||
@Article{ Gordon99,
|
||
author = {Andrew D. Gordon},
|
||
title = {Bisimilarity as a Theory of Functional Programming},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {228},
|
||
number = {1-2},
|
||
pages = {5--47},
|
||
year = {1999},
|
||
opturl = {https://doi.org/10.1016/S0304-3975(98)00353-3},
|
||
doi = {10.1016/S0304-3975(98)00353-3},
|
||
timestamp = {Sun, 28 May 2017 13:20:07 +0200}
|
||
}
|
||
|
||
@InBook{ Gordon99a,
|
||
author = {Gordon, A. D.},
|
||
title = {Operational Equivalences for Untyped and Polymorphic
|
||
Object Calculi},
|
||
year = {1999},
|
||
publisher = {Cambridge University Press},
|
||
address = {USA},
|
||
booktitle = {Higher Order Operational Techniques in Semantics},
|
||
pages = {9–54},
|
||
numpages = {46}
|
||
}
|
||
|
||
@Book{ GordonPitts99,
|
||
editor = {Gordon, Andrew D. and Pitts, Andrew M.},
|
||
title = {Higher Order Operational Techniques in Semantics},
|
||
year = {1999},
|
||
publisher = {Cambridge University Press},
|
||
address = {USA}
|
||
}
|
||
|
||
@Article{ GorlaNestman14,
|
||
author = {Gorla, Daniele and Nestman, Uwe},
|
||
journal = {Math Struct Comp Science},
|
||
title = {Full Abstraction for Expressiveness: History, Myths and
|
||
Facts},
|
||
year = {2014}
|
||
}
|
||
|
||
@Article{ Goubault-LarrecqLasotaEtAl08,
|
||
author = {Jean Goubault{-}Larrecq and Slawomir Lasota and David
|
||
Nowak},
|
||
title = {Logical relations for monadic types},
|
||
journal = {Math. Struct. Comput. Sci.},
|
||
volume = {18},
|
||
number = {6},
|
||
pages = {1169--1217},
|
||
year = {2008},
|
||
doi = {10.1017/S0960129508007172}
|
||
}
|
||
|
||
@Article{ GrooteMousaviEtAl06,
|
||
author = {Jan Friso Groote and Mohammad Reza Mousavi and Michel A.
|
||
Reniers},
|
||
title = {A Hierarchy of {SOS} Rule Formats},
|
||
journal = {Electron. Notes Theor. Comput. Sci.},
|
||
volume = {156},
|
||
number = {1},
|
||
pages = {3--25},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1016/j.entcs.2005.11.077},
|
||
doi = {10.1016/j.entcs.2005.11.077},
|
||
timestamp = {Sat, 11 Jul 2020 10:44:59 +0200}
|
||
}
|
||
|
||
@Article{ GrooteVaandrager92,
|
||
author = {Jan Friso Groote and Frits W. Vaandrager},
|
||
title = {Structured Operational Semantics and Bisimulation as a
|
||
Congruence},
|
||
journal = {Inf. Comput.},
|
||
volume = {100},
|
||
number = {2},
|
||
pages = {202--260},
|
||
year = {1992},
|
||
url = {https://doi.org/10.1016/0890-5401(92)90013-6},
|
||
doi = {10.1016/0890-5401(92)90013-6},
|
||
timestamp = {Thu, 18 May 2017 09:54:22 +0200}
|
||
}
|
||
|
||
@Book{ Gunter92,
|
||
title = {Semantics of Programming Languages: Structures and
|
||
Techniques},
|
||
author = {Gunter, C.A.},
|
||
lccn = {92010172},
|
||
series = {Foundations of computing series},
|
||
year = {1992},
|
||
publisher = {London}
|
||
}
|
||
|
||
@Misc{ Guy-Eric-Schalnat17,
|
||
title = {libpng 1.6.34},
|
||
author = {Guy Eric Schalnat, Andreas Eric Dilger, Glenn
|
||
Randers-Pehrson},
|
||
year = {2017},
|
||
url = {http://www.libpng.org/pub/png/libpng.html}
|
||
}
|
||
|
||
@Article{ HamidShaoEtAl03,
|
||
title = {A syntactic approach to foundational proof-carrying code},
|
||
author = {Hamid, Nadeem A and Shao, Zhong and Trifonov, Valery and
|
||
Monnier, Stefan and Ni, Zhaozhong},
|
||
journal = {Journal of Automated Reasoning},
|
||
volume = {31},
|
||
number = {3-4},
|
||
pages = {191--229},
|
||
year = {2003},
|
||
publisher = {Springer}
|
||
}
|
||
|
||
@Article{ HasuoJacobsEtAl07,
|
||
author = {Ichiro Hasuo and Bart Jacobs and Ana Sokolova},
|
||
title = {Generic Trace Semantics via Coinduction},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {3},
|
||
number = {4},
|
||
year = {2007},
|
||
url = {https://doi.org/10.2168/LMCS-3(4:11)2007},
|
||
doi = {10.2168/LMCS-3(4:11)2007},
|
||
timestamp = {Sat, 20 May 2017 00:22:52 +0200}
|
||
}
|
||
|
||
@Book{ Heinrich94,
|
||
title = {MIPS R4000 Microprocessor User's manual},
|
||
author = {Heinrich, Joe},
|
||
year = {1994}
|
||
}
|
||
|
||
@InProceedings{ HennessyPlotkin79,
|
||
author = {Matthew Hennessy and Gordon D. Plotkin},
|
||
editor = {Jir{\'{\i}} Becv{\'{a}}r},
|
||
title = {Full Abstraction for a Simple Parallel Programming
|
||
Language},
|
||
booktitle = {Mathematical Foundations of Computer Science 1979,
|
||
Proceedings, 8th Symposium, Olomouc, Czechoslovakia,
|
||
September 3-7, 1979},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {74},
|
||
pages = {108--120},
|
||
publisher = {Springer},
|
||
year = {1979},
|
||
url = {https://doi.org/10.1007/3-540-09526-8\_8},
|
||
doi = {10.1007/3-540-09526-8\_8},
|
||
timestamp = {Tue, 14 May 2019 10:00:37 +0200}
|
||
}
|
||
|
||
@PhDThesis{ Hermida93,
|
||
title = {Fibrations, logical predicates and indeterminates},
|
||
author = {Hermida, Claudio Alberto},
|
||
year = {1993},
|
||
school = {University of Edinburgh},
|
||
url = {https://era.ed.ac.uk/handle/1842/14057}
|
||
}
|
||
|
||
@Article{ HermidaJacobs98,
|
||
title = {Structural {Induction} and {Coinduction} in a {Fibrational
|
||
Setting}},
|
||
author = {Hermida, Claudio and Jacobs, Bart},
|
||
year = {1998},
|
||
optmonth = sep,
|
||
journal = {Information and Computation},
|
||
volume = {145},
|
||
number = {2},
|
||
pages = {107--152},
|
||
doi = {10.1006/inco.1998.2725}
|
||
}
|
||
|
||
@Article{ HermidaReddyEtAl14,
|
||
author = {Claudio Hermida and Uday S. Reddy and Edmund P. Robinson},
|
||
title = {Logical Relations and Parametricity - {A} {{R}}eynolds
|
||
Programme for Category Theory and Programming Languages},
|
||
journal = {Electron. Notes Theor. Comput. Sci.},
|
||
volume = {303},
|
||
pages = {149--180},
|
||
year = {2014},
|
||
doi = {10.1016/j.entcs.2014.02.008}
|
||
}
|
||
|
||
@Book{ HindleySeldin08,
|
||
title = {Lambda-{{Calculus}} and {{Combinators}}: {{An
|
||
Introduction}}},
|
||
shorttitle = {Lambda-{{Calculus}} and {{Combinators}}},
|
||
author = {Hindley, J. Roger and Seldin, Jonathan P.},
|
||
year = {2008},
|
||
edition = {2},
|
||
publisher = {{Cambridge University Press}},
|
||
optaddress = {{Cambridge}},
|
||
doi = {10.1017/CBO9780511809835}
|
||
}
|
||
|
||
@Book{ HindleySeldin08a,
|
||
title = {Lambda-calculus and Combinators, an Introduction},
|
||
author = {Hindley, J Roger and Seldin, Jonathan P},
|
||
volume = {2},
|
||
year = {2008},
|
||
publisher = {Cambridge University Press Cambridge}
|
||
}
|
||
|
||
@InProceedings{ Hirschowitz19,
|
||
author = {Tom Hirschowitz},
|
||
title = {Familial monads and structural operational semantics},
|
||
booktitle = {46th ACM-SIGACT Symposium on Principles of Programming
|
||
Languages, POPL'19},
|
||
volume = {3},
|
||
publisher = {ACM},
|
||
optnumber = {{POPL}},
|
||
pages = {21:1--21:28},
|
||
year = {2019},
|
||
url = {https://doi.org/10.1145/3290334},
|
||
doi = {10.1145/3290334},
|
||
timestamp = {Thu, 23 Jun 2022 20:05:10 +0200}
|
||
}
|
||
|
||
@InProceedings{ HirschowitzHirschowitzEtAl22,
|
||
author = "Hirschowitz, Andr{\'e} and Hirschowitz, Tom and Lafont,
|
||
Ambroise and Maggesi, Marco",
|
||
opteditor = "Bouyer, Patricia and Schr{\"o}der, Lutz",
|
||
title = "Variable binding and substitution for (nameless) dummies",
|
||
booktitle = "25th International Conference on Foundations of Software
|
||
Science and Computation Structures (FOSSACS 2022)",
|
||
year = "2022",
|
||
publisher = springer,
|
||
series = lncs,
|
||
volume = {13242},
|
||
optaddress = "Cham",
|
||
pages = "389--408",
|
||
doi = "/10.1007/978-3-030-99253-8_20"
|
||
}
|
||
|
||
@Article{ HirschowitzLafont22,
|
||
author = {Tom Hirschowitz and Ambroise Lafont},
|
||
title = {A categorical framework for congruence of applicative
|
||
bisimilarity in higher-order languages},
|
||
journal = {Log. Methods Comput. Sci.},
|
||
volume = {18},
|
||
number = {3},
|
||
year = {2022},
|
||
url = {https://doi.org/10.46298/lmcs-18(3:37)2022},
|
||
doi = {10.46298/lmcs-18(3:37)2022},
|
||
timestamp = {Thu, 13 Oct 2022 16:02:18 +0200}
|
||
}
|
||
|
||
@Article{ Hoare69,
|
||
author = {Hoare, C. A. R.},
|
||
title = {An Axiomatic Basis for Computer Programming},
|
||
journal = {Commun. ACM},
|
||
issue_date = {Oct. 1969},
|
||
volume = {12},
|
||
number = {10},
|
||
month = oct,
|
||
year = {1969},
|
||
pages = {576--580},
|
||
numpages = {5},
|
||
url = {http://doi.acm.org/10.1145/363235.363259},
|
||
doi = {10.1145/363235.363259},
|
||
acmid = {363259},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Hoare78,
|
||
author = {Hoare, C. A. R.},
|
||
title = {Communicating sequential processes},
|
||
year = 1978,
|
||
issue_date = {Aug. 1978},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = 21,
|
||
number = 8,
|
||
url = {https://doi.org/10.1145/359576.359585},
|
||
doi = {10.1145/359576.359585},
|
||
journal = {Commun. ACM},
|
||
month = aug,
|
||
pages = {666–677},
|
||
numpages = 12
|
||
}
|
||
|
||
@Book{ Hoare85,
|
||
author = {C. A. R. Hoare},
|
||
title = {Communicating Sequential Processes},
|
||
publisher = {Prentice-Hall},
|
||
year = {1985},
|
||
timestamp = {Thu, 03 Jan 2002 11:51:40 +0100}
|
||
}
|
||
|
||
@InProceedings{ Howe89,
|
||
author = {Douglas J. Howe},
|
||
title = {Equality In Lazy Computation Systems},
|
||
booktitle = {4th Annual Symposium on Logic in Computer Science (LICS
|
||
1989)},
|
||
pages = {198--203},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1989},
|
||
doi = {10.1109/LICS.1989.39174},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ Howe96,
|
||
author = {Douglas J. Howe},
|
||
title = {Proving Congruence of Bisimulation in Functional
|
||
Programming Languages},
|
||
journal = {Inf. Comput.},
|
||
volume = {124},
|
||
number = {2},
|
||
pages = {103--112},
|
||
year = {1996},
|
||
doi = {10.1006/inco.1996.0008},
|
||
timestamp = {Thu, 18 May 2017 09:54:17 +0200}
|
||
}
|
||
|
||
@InProceedings{ HurDreyer11,
|
||
author = {Chung{-}Kil Hur and Derek Dreyer},
|
||
editor = {Thomas Ball and Mooly Sagiv},
|
||
title = {A kripke logical relation between {ML} and assembly},
|
||
booktitle = {38th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages, ({POPL} 2011)},
|
||
pages = {133--146},
|
||
publisher = {{ACM}},
|
||
year = {2011},
|
||
doi = {10.1145/1926385.1926402}
|
||
}
|
||
|
||
@InProceedings{ HurDreyerEtAl12,
|
||
author = {Chung{-}Kil Hur and Derek Dreyer and Georg Neis and Viktor
|
||
Vafeiadis},
|
||
editor = {John Field and Michael Hicks},
|
||
title = {The marriage of bisimulations and Kripke logical
|
||
relations},
|
||
booktitle = {39th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
|
||
Programming Languages {(POPL)} 2012) USA, January 22-28,
|
||
2012},
|
||
pages = {59--72},
|
||
publisher = {{ACM}},
|
||
year = {2012},
|
||
doi = {10.1145/2103656.2103666}
|
||
}
|
||
|
||
@Book{ ISO17,
|
||
author = "{ISO}",
|
||
title = "{ISO\slash IEC 14882:2017 Information technology ---
|
||
Programming languages --- C++}",
|
||
publisher = pub-iso,
|
||
address = pub-iso:adr,
|
||
edition = "Fifth",
|
||
pages = "1605",
|
||
month = dec,
|
||
year = "2017",
|
||
url = "https://www.iso.org/standard/68564.html",
|
||
remark = "Revises ISO/IEC 14882:2014."
|
||
}
|
||
|
||
@Book{ ISO18,
|
||
author = "{ISO}",
|
||
title = "{ISO\slash IEC 9899:2018 Information technology ---
|
||
Programming languages --- C}",
|
||
publisher = pub-iso,
|
||
address = pub-iso:adr,
|
||
month = jun,
|
||
year = "2018",
|
||
url = "https://www.iso.org/standard/74528.html"
|
||
}
|
||
|
||
@Article{ Jacobs04,
|
||
author = {Bart Jacobs},
|
||
title = {Trace Semantics for Coalgebras},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {106},
|
||
pages = {167--184},
|
||
year = {2004},
|
||
url = {https://doi.org/10.1016/j.entcs.2004.02.031},
|
||
doi = {10.1016/j.entcs.2004.02.031},
|
||
timestamp = {Sun, 28 May 2017 13:22:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ Jacobs06,
|
||
author = {Bart Jacobs},
|
||
editor = {Kokichi Futatsugi and Jean{-}Pierre Jouannaud and
|
||
Jos{\'{e}} Meseguer},
|
||
title = {A Bialgebraic Review of Deterministic Automata, Regular
|
||
Expressions and Languages},
|
||
booktitle = {Algebra, Meaning, and Computation, Essays Dedicated to
|
||
Joseph A. Goguen on the Occasion of His 65th Birthday},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4060},
|
||
pages = {375--404},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1007/11780274\_20},
|
||
doi = {10.1007/11780274\_20},
|
||
timestamp = {Tue, 14 May 2019 10:00:52 +0200}
|
||
}
|
||
|
||
@Book{ Jacobs16,
|
||
author = {Bart Jacobs},
|
||
title = {{Introduction to Coalgebra: Towards Mathematics of States
|
||
and Observation}},
|
||
series = {Cambridge Tracts in Theoretical Computer Science},
|
||
volume = {59},
|
||
publisher = {Cambridge University Press},
|
||
year = {2016},
|
||
doi = {10.1017/CBO9781316823187},
|
||
timestamp = {Tue, 16 May 2017 14:01:42 +0200}
|
||
}
|
||
|
||
@Article{ Jacobs95,
|
||
author = {Bart Jacobs},
|
||
title = {Parameters and Parametrization in Specification, Using
|
||
Distributive Categories},
|
||
journal = {Fundam. Inform.},
|
||
volume = {24},
|
||
number = {3},
|
||
pages = {209--250},
|
||
year = {1995},
|
||
url = {https://doi.org/10.3233/FI-1995-2431},
|
||
doi = {10.3233/FI-1995-2431},
|
||
timestamp = {Sat, 20 May 2017 00:23:05 +0200}
|
||
}
|
||
|
||
@Book{ Jacobs99,
|
||
author = "B. Jacobs",
|
||
title = "Categorical Logic and Type Theory",
|
||
publisher = "North Holland",
|
||
series = "Studies in Logic and the Foundations of Mathematics",
|
||
number = "141",
|
||
year = "1999"
|
||
}
|
||
|
||
@InProceedings{ JacobsTimany20,
|
||
title = {Fully Abstract from Static to Gradual},
|
||
author = {K. Jacobs and A. Timany},
|
||
year = {2020}
|
||
}
|
||
|
||
@InProceedings{ JagadeesanPitcherEtAl11,
|
||
author = {Radha Jagadeesan and Corin Pitcher and Julian Rathke and
|
||
James Riely},
|
||
title = {Local Memory via Layout Randomization},
|
||
booktitle = {Proceedings of the 24th {IEEE} Computer Security
|
||
Foundations Symposium, {CSF} 2011, Cernay-la-Ville, France,
|
||
27-29 June, 2011},
|
||
pages = {161--174},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1109/CSF.2011.18},
|
||
doi = {10.1109/CSF.2011.18},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}
|
||
}
|
||
|
||
@InProceedings{ JangLeeEtAl16,
|
||
author = {Jang, Yeongjin and Lee, Sangho and Kim, Taesoo},
|
||
title = {Breaking Kernel Address Space Layout Randomization with
|
||
Intel TSX},
|
||
booktitle = {Proceedings of the 2016 ACM SIGSAC Conference on Computer
|
||
and Communications Security},
|
||
series = {CCS '16},
|
||
year = {2016},
|
||
pages = {380--392},
|
||
numpages = {13},
|
||
url = {http://doi.acm.org/10.1145/2976749.2978321},
|
||
doi = {10.1145/2976749.2978321},
|
||
acmid = {2978321},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Misc{ Jean-loup-Gailly17,
|
||
title = {zlib 1.2.11},
|
||
author = {Jean-loup Gailly, Mark Adler},
|
||
year = {2017},
|
||
url = {https://zlib.net/}
|
||
}
|
||
|
||
@InProceedings{ JeffreyRathke02,
|
||
author = {Alan Jeffrey and Julian Rathke},
|
||
title = {A Fully Abstract May Testing Semantics for Concurrent
|
||
Objects},
|
||
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS}
|
||
2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings},
|
||
pages = {101--112},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1109/LICS.2002.1029820},
|
||
doi = {10.1109/LICS.2002.1029820},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ JeffreyRathke05,
|
||
author = {Jeffrey, Alan and Rathke, Julian },
|
||
title = {A fully abstract may testing semantics for concurrent
|
||
objects},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {338},
|
||
number = {1-3},
|
||
pages = {17--63},
|
||
year = {2005},
|
||
url = {http://dx.doi.org/10.1016/j.tcs.2004.10.012},
|
||
doi = {10.1016/j.tcs.2004.10.012},
|
||
timestamp = {Thu, 21 Jul 2005 16:06:18 +0200}
|
||
}
|
||
|
||
@InProceedings{ JeffreyRathke05a,
|
||
author = {Alan Jeffrey and Julian Rathke},
|
||
editor = {Shmuel Sagiv},
|
||
title = {Java Jr: Fully Abstract Trace Semantics for a Core Java
|
||
Language},
|
||
booktitle = {Programming Languages and Systems, 14th European Symposium
|
||
on Programming,ESOP 2005, Held as Part of the Joint
|
||
European Conferences on Theory and Practice of Software,
|
||
{ETAPS} 2005, Edinburgh, UK, April 4-8, 2005, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3444},
|
||
pages = {423--438},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1007/978-3-540-31987-0\_29},
|
||
doi = {10.1007/978-3-540-31987-0\_29},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@InProceedings{ JeffreyRathke05b,
|
||
author = {Jeffrey, Alan and Rathke, Julian },
|
||
title = {{Java Jr}: Fully Abstract Trace Semantics for a Core
|
||
{Java} Language},
|
||
booktitle = {14th European Symposium on Programming},
|
||
shortbooktitle= {ESOP},
|
||
pages = {423--438},
|
||
year = {2005},
|
||
optee = {http://dx.doi.org/10.1007/978-3-540-31987-0_29},
|
||
doi = {10.1007/978-3-540-31987-0_29},
|
||
editor = {Shmuel Sagiv},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3444},
|
||
publisher = {Springer},
|
||
opturl = {http://ect.bell-labs.com/who/ajeffrey/papers/esop05.pdf}
|
||
}
|
||
|
||
@InProceedings{ JiangLiangEtAl19,
|
||
author = {Jiang, Hanru and Liang, Hongjin and Xiao, Siyang and Zha,
|
||
Junpeng and Feng, Xinyu},
|
||
title = {Towards Certified Separate Compilation for Concurrent
|
||
Programs},
|
||
booktitle = {Proceedings of the 40th ACM SIGPLAN Conference on
|
||
Programming Language Design and Implementation},
|
||
series = {PLDI 2019},
|
||
year = {2019},
|
||
pages = {111--125},
|
||
numpages = {15},
|
||
url = {http://doi.acm.org/10.1145/3314221.3314595},
|
||
doi = {10.1145/3314221.3314595},
|
||
acmid = {3314595},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ JimenezMammarEtAl09,
|
||
title = {Software Vulnerabilities, Prevention and Detection
|
||
Methods: A Review1},
|
||
author = {Jimenez, Willy and Mammar, Amel and Cavalli, Ana},
|
||
journal = {Security in Model-Driven Architecture},
|
||
pages = {6},
|
||
year = {2009}
|
||
}
|
||
|
||
@InProceedings{ JimMorrisettEtAl02,
|
||
title = {Cyclone: A Safe Dialect of C},
|
||
author = {Jim, Trevor and Morrisett, J Greg and Grossman, Dan and
|
||
Hicks, Michael W and Cheney, James and Wang, Yanling},
|
||
booktitle = {Proceedings of the General Track of the annual conference
|
||
on USENIX Annual Technical Conference},
|
||
pages = {275--288},
|
||
year = {2002},
|
||
organization = {USENIX Association}
|
||
}
|
||
|
||
@Book{ JirAdamekJirRosickyEtAl11,
|
||
author = {Ji\v{r}\'\i\ Ad\'{a}mek and Ji\v{r}\'\i\ Rosick\'y and
|
||
Enrico Vitale},
|
||
alteditor = {},
|
||
title = {Algebraic Theories},
|
||
publisher = {Cambridge University Press},
|
||
year = {2011},
|
||
optkey = {},
|
||
optvolume = {},
|
||
optnumber = {},
|
||
optseries = {},
|
||
optaddress = {},
|
||
optedition = {},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@InProceedings{ JoannouWoodruffEtAl17,
|
||
title = {Efficient {{Tagged Memory}}},
|
||
doi = {10.1109/ICCD.2017.112},
|
||
booktitle = {{{IEEE International Conference}} on {{Computer Design}}
|
||
({{ICCD}})},
|
||
publisher = {{IEEE}},
|
||
author = {Joannou, A. and Woodruff, J. and Kovacsics, R. and Moore,
|
||
S. W. and Bradbury, A. and Xia, H. and Watson, R. N. M. and
|
||
Chisnall, D. and Roe, M. and Davis, B. and Napierala, E.
|
||
and Baldwin, J. and Gudka, K. and Neumann, P. G. and
|
||
Mazzinghi, A. and Richardson, A. and Son, S. and Markettos,
|
||
A. T.},
|
||
month = nov,
|
||
year = {2017}
|
||
}
|
||
|
||
@InProceedings{ JohannSimpsonEtAl10,
|
||
author = {Johann, Patricia and Simpson, Alex and Voigtländer,
|
||
Janis},
|
||
booktitle = {25th Annual IEEE Symposium on Logic in Computer Science
|
||
(LICS 2010)},
|
||
title = {A Generic Operational Metatheory for Algebraic Effects},
|
||
year = {2010},
|
||
volume = {},
|
||
number = {},
|
||
publisher = {IEEE Computer Society},
|
||
pages = {209-218},
|
||
doi = {10.1109/LICS.2010.29}
|
||
}
|
||
|
||
@Article{ JuglaretHritcu15,
|
||
title = {Secure Compilation Using Micro-Policies},
|
||
author = {Juglaret, Yannis and Hritcu, Catalin},
|
||
publisher = {Citeseer},
|
||
series = {Workshop on Foundations of Computer Security (FCS)},
|
||
year = {2015}
|
||
}
|
||
|
||
@Article{ JuglaretHritcuEtAl15,
|
||
archiveprefix = {arXiv},
|
||
eprinttype = {arxiv},
|
||
eprint = {1510.00697},
|
||
title = {Towards a {{Fully Abstract Compiler Using
|
||
Micro}}-{{Policies}}: {{Secure Compilation}} for {{Mutually
|
||
Distrustful Components}}},
|
||
shorttitle = {Towards a {{Fully Abstract Compiler Using
|
||
Micro}}-{{Policies}}},
|
||
author = {Juglaret, Yannis and Hritcu, Catalin and {de Amorim},
|
||
Arthur Azevedo and Pierce, Benjamin C. and
|
||
{Spector-Zabusky}, Antal and Tolmach, Andrew},
|
||
month = oct,
|
||
year = {2015}
|
||
}
|
||
|
||
@Article{ JuglaretHritcuEtAl16,
|
||
author = {Yannis Juglaret and Catalin Hritcu and Arthur Azevedo de
|
||
Amorim and Benjamin C. Pierce},
|
||
title = {Beyond Full Abstraction: Formalizing the Security
|
||
Guarantees of Low-Level Compartmentalization},
|
||
journal = {CoRR},
|
||
volume = {abs/1602.04503},
|
||
year = {2016},
|
||
url = {http://arxiv.org/abs/1602.04503},
|
||
timestamp = {Tue, 01 Mar 2016 17:47:25 +0100}
|
||
}
|
||
|
||
@InProceedings{ JuglaretHritcuEtAl16a,
|
||
author = {Yannis Juglaret and Catalin Hritcu and Arthur Azevedo de
|
||
Amorim and Boris Eng and Benjamin C. Pierce},
|
||
title = {Beyond Good and Evil: Formalizing the Security Guarantees
|
||
of Compartmentalizing Compilation},
|
||
booktitle = {{IEEE} 29th Computer Security Foundations Symposium, {CSF}
|
||
2016, Lisbon, Portugal, June 27 - July 1, 2016},
|
||
pages = {45--60},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1109/CSF.2016.11},
|
||
doi = {10.1109/CSF.2016.11},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}
|
||
}
|
||
|
||
@Article{ JungTix98,
|
||
title = "The Troublesome Probabilistic Powerdomain ",
|
||
journal = "Electronic Notes in Theoretical Computer Science ",
|
||
volume = "13",
|
||
pages = "70--91",
|
||
year = "1998",
|
||
author = "Achim Jung and Regina Tix"
|
||
}
|
||
|
||
@InProceedings{ Kahn87,
|
||
author = {Gilles Kahn},
|
||
editor = {Franz{-}Josef Brandenburg and Guy Vidal{-}Naquet and
|
||
Martin Wirsing},
|
||
title = {Natural Semantics},
|
||
booktitle = {{STACS} 87, 4th Annual Symposium on Theoretical Aspects of
|
||
Computer Science, Passau, Germany, February 19-21, 1987,
|
||
Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {247},
|
||
pages = {22--39},
|
||
publisher = {Springer},
|
||
year = {1987},
|
||
url = {https://doi.org/10.1007/BFb0039592},
|
||
doi = {10.1007/BFb0039592},
|
||
timestamp = {Tue, 14 May 2019 10:00:48 +0200}
|
||
}
|
||
|
||
@PhDThesis{ Katsumata05,
|
||
author = {Shin{-}ya Katsumata},
|
||
title = {A generalisation of pre-logical predicates and its
|
||
applications},
|
||
school = {University of Edinburgh},
|
||
year = {2005},
|
||
url = {http://hdl.handle.net/1842/850}
|
||
}
|
||
|
||
@Article{ Keller76,
|
||
author = {Robert M. Keller},
|
||
title = {Formal Verification of Parallel Programs},
|
||
journal = {Commun. {ACM}},
|
||
volume = {19},
|
||
number = {7},
|
||
pages = {371--384},
|
||
year = {1976},
|
||
url = {https://doi.org/10.1145/360248.360251},
|
||
doi = {10.1145/360248.360251},
|
||
timestamp = {Tue, 06 Nov 2018 12:51:40 +0100}
|
||
}
|
||
|
||
@InProceedings{ KellerLasson12,
|
||
author = {Chantal Keller and Marc Lasson},
|
||
editor = {Patrick C{\'{e}}gielski and Arnaud Durand},
|
||
title = {Parametricity in an Impredicative Sort},
|
||
booktitle = {Computer Science Logic - 26th International Workshop/21st
|
||
Annual Conference of the EACSL, ({CSL} 2012)},
|
||
series = {LIPIcs},
|
||
volume = {16},
|
||
pages = {381--395},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2012}
|
||
}
|
||
|
||
@Article{ Kelly69,
|
||
title = {Monomorphisms, {{Epimorphisms}}, and {{Pull-Backs}}},
|
||
author = {Kelly, G. M.},
|
||
year = {1969},
|
||
month = feb,
|
||
journal = {Journal of the Australian Mathematical Society},
|
||
volume = {9},
|
||
number = {1-2},
|
||
pages = {124--142},
|
||
doi = {10/fk54sh},
|
||
urldate = {2019-10-29},
|
||
langid = {english}
|
||
}
|
||
|
||
@Article{ Kelly80,
|
||
author = {Kelly, G.M.},
|
||
year = {1980},
|
||
month = {08},
|
||
pages = {1 - 83},
|
||
title = {A unified treatment of transfinite constructions for free
|
||
algebras, free monoids, colimits, associated sheaves, and
|
||
so on},
|
||
volume = {22},
|
||
journal = {Bulletin of the Australian Mathematical Society},
|
||
doi = {10.1017/S0004972700006353}
|
||
}
|
||
|
||
@Article{ KellyPower93,
|
||
title = {Adjunctions whose counits are coequalizers, and
|
||
presentations of finitary enriched monads},
|
||
journal = {Journal of Pure and Applied Algebra},
|
||
volume = {89},
|
||
number = {1},
|
||
pages = {163-179},
|
||
year = {1993},
|
||
doi = {https://doi.org/10.1016/0022-4049(93)90092-8},
|
||
url = {https://www.sciencedirect.com/science/article/pii/0022404993900928},
|
||
author = {G.M. Kelly and A.J. Power}
|
||
}
|
||
|
||
@Article{ Kennedy06,
|
||
author = {Andrew Kennedy},
|
||
title = {Securing the .NET programming model},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {364},
|
||
number = {3},
|
||
pages = {311--317},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1016/j.tcs.2006.08.014},
|
||
doi = {10.1016/j.tcs.2006.08.014},
|
||
timestamp = {Wed, 14 Nov 2018 10:33:34 +0100}
|
||
}
|
||
|
||
@Book{ KennedyAllen01,
|
||
title = {Optimizing compilers for modern architectures: a
|
||
dependence-based approach},
|
||
author = {Kennedy, Ken and Allen, John R},
|
||
year = {2001},
|
||
publisher = {Morgan Kaufmann Publishers Inc.}
|
||
}
|
||
|
||
@Article{ Klin11,
|
||
author = {Bartek Klin},
|
||
title = {Bialgebras for structural operational semantics: An
|
||
introduction},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {412},
|
||
number = {38},
|
||
pages = {5043--5069},
|
||
year = {2011},
|
||
url = {https://doi.org/10.1016/j.tcs.2011.03.023},
|
||
doi = {10.1016/j.tcs.2011.03.023},
|
||
timestamp = {Sun, 28 May 2017 13:20:00 +0200}
|
||
}
|
||
|
||
@InProceedings{ KlinNachyla15,
|
||
author = {Bartek Klin and Beata Nachyla},
|
||
title = {Presenting Morphisms of Distributive Laws},
|
||
booktitle = {6th Conference on Algebra and Coalgebra in Computer
|
||
Science, CALCO'15},
|
||
pages = {190--204},
|
||
year = {2015},
|
||
series = {LIPIcs},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
|
||
crossref-ignore={DBLP:conf/calco/2015},
|
||
url = {https://doi.org/10.4230/LIPIcs.CALCO.2015.190},
|
||
doi = {10.4230/LIPIcs.CALCO.2015.190},
|
||
timestamp = {Thu, 23 Aug 2018 15:56:17 +0200}
|
||
}
|
||
|
||
@InProceedings{ KlinSassone08,
|
||
author = {Bartek Klin and Vladimiro Sassone},
|
||
editor = {Roberto M. Amadio},
|
||
title = {Structural Operational Semantics for Stochastic Process
|
||
Calculi},
|
||
booktitle = {11th International Conference Foundations of Software
|
||
Science and Computational Structures, FOSSACS'08},
|
||
series = lncs,
|
||
volume = {4962},
|
||
pages = {428--442},
|
||
publisher = {Springer},
|
||
year = {2008},
|
||
url = {https://doi.org/10.1007/978-3-540-78499-9\_30},
|
||
doi = {10.1007/978-3-540-78499-9\_30},
|
||
timestamp = {Sun, 25 Oct 2020 22:38:53 +0100}
|
||
}
|
||
|
||
@Article{ Kock72,
|
||
author = "Anders Kock",
|
||
title = "Strong Functors and Monoidal Monads",
|
||
journal = "Archiv der Mathematik",
|
||
volume = "23",
|
||
number = "1",
|
||
pages = "113--120",
|
||
year = "1972"
|
||
}
|
||
|
||
@Proceedings{ KurzLenisaEtAl09,
|
||
editor = {Alexander Kurz and Marina Lenisa and Andrzej Tarlecki},
|
||
title = {Algebra and Coalgebra in Computer Science, Third
|
||
International Conference, {CALCO} 2009, Udine, Italy,
|
||
September 7-10, 2009. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {5728},
|
||
publisher = {Springer},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/978-3-642-03741-2},
|
||
doi = {10.1007/978-3-642-03741-2},
|
||
timestamp = {Tue, 14 May 2019 10:00:51 +0200}
|
||
}
|
||
|
||
@Article{ KurzVelebil16,
|
||
title = {Relation Lifting, a Survey},
|
||
author = {Kurz, Alexander and Velebil, Ji{\v r}{\'i}},
|
||
year = {2016},
|
||
optmonth = jun,
|
||
journal = {Journal of Logical and Algebraic Methods in Programming},
|
||
series = {Relational and Algebraic Methods in Computer Science},
|
||
volume = {85},
|
||
number = {4},
|
||
pages = {475--499},
|
||
doi = {10.1016/j.jlamp.2015.08.002},
|
||
langid = {english}
|
||
}
|
||
|
||
@InProceedings{ LagoGavazzo22,
|
||
author = {Ugo Dal Lago and Francesco Gavazzo},
|
||
title = {Effectful program distancing},
|
||
booktitle = {49th Annual ACM SIGPLAN Symposium on Principles of
|
||
Programming Languages (POPL 2022)},
|
||
series = {Proc. {ACM} Program. Lang.},
|
||
volume = {6},
|
||
optnumber = {{POPL}},
|
||
pages = {1--30},
|
||
year = {2022},
|
||
doi = {10.1145/3498680},
|
||
timestamp = {Wed, 07 Dec 2022 23:04:15 +0100}
|
||
}
|
||
|
||
@InProceedings{ LagoGavazzoEtAl19,
|
||
author = {Ugo Dal Lago and Francesco Gavazzo and Akira Yoshimizu},
|
||
title = {{Differential Logical Relations, Part I: The Simply-Typed
|
||
Case}},
|
||
booktitle = {46th International Colloquium on Automata, Languages, and
|
||
Programming (ICALP 2019)},
|
||
pages = {111:1--111:14},
|
||
series = lipics,
|
||
year = {2019},
|
||
volume = {132},
|
||
opteditor = {Christel Baier and Ioannis Chatzigiannakis and Paola
|
||
Flocchini and Stefano Leonardi},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik},
|
||
optaddress = {Dagstuhl, Germany},
|
||
urn = {urn:nbn:de:0030-drops-106879},
|
||
doi = {10.4230/LIPIcs.ICALP.2019.111}
|
||
}
|
||
|
||
@Article{ LagoZorzi12,
|
||
author = {Lago, Ugo Dal and Zorzi, Margherita},
|
||
title = {Probabilistic operational semantics for the lambda
|
||
calculus},
|
||
journal = {RAIRO - Theoretical Informatics and Applications -
|
||
Informatique Th\'eorique et Applications},
|
||
pages = {413--450},
|
||
publisher = {EDP-Sciences},
|
||
volume = {46},
|
||
number = {3},
|
||
year = {2012},
|
||
doi = {10.1051/ita/2012012},
|
||
zbl = {1279.68183},
|
||
language = {en},
|
||
url = {http://www.numdam.org/articles/10.1051/ita/2012012/}
|
||
}
|
||
|
||
@InBook{ Laird07,
|
||
title = "A fully abstract trace semantics for general references",
|
||
author = "J. Laird",
|
||
year = "2007",
|
||
month = "7",
|
||
doi = "10.1007/978-3-540-73420-8_58",
|
||
language = "English",
|
||
series = "Lecture Notes in Computer Science (including subseries
|
||
Lecture Notes in Artificial Intelligence and Lecture Notes
|
||
in Bioinformatics)",
|
||
publisher = "Springer Verlag",
|
||
pages = "667--679",
|
||
editor = "L. Arge and C. Cachin and T. Jurdziński and A. Tarlecki",
|
||
booktitle = "Automata, Languages and Programming"
|
||
}
|
||
|
||
@InProceedings{ Laird16,
|
||
author = {Laird, James},
|
||
title = {{Weighted Relational Models for Mobility}},
|
||
booktitle = {1st International Conference on Formal Structures for
|
||
Computation and Deduction (FSCD 2016)},
|
||
pages = {24:1--24:15},
|
||
series = {Leibniz International Proceedings in Informatics
|
||
(LIPIcs)},
|
||
year = {2016},
|
||
volume = {52},
|
||
editor = {Kesner, Delia and Pientka, Brigitte},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
|
||
address = {Dagstuhl, Germany},
|
||
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.24},
|
||
urn = {urn:nbn:de:0030-drops-59982},
|
||
doi = {10.4230/LIPIcs.FSCD.2016.24}
|
||
}
|
||
|
||
@Article{ Lambek68,
|
||
author = {Lambek, Joachim},
|
||
title = {A Fixpoint Theorem for Complete Categories},
|
||
journal = {Math.~Z.},
|
||
year = {1968},
|
||
optkey = {},
|
||
volume = {103},
|
||
optnumber = {},
|
||
pages = {151--161},
|
||
optmonth = {},
|
||
optnote = {},
|
||
optannote = {}
|
||
}
|
||
|
||
@Article{ Lampson74,
|
||
author = {Lampson, Butler W.},
|
||
title = {Protection},
|
||
journal = {SIGOPS Oper. Syst. Rev.},
|
||
issue_date = {January 1974},
|
||
volume = {8},
|
||
number = {1},
|
||
month = jan,
|
||
year = {1974},
|
||
pages = {18--24},
|
||
numpages = {7},
|
||
url = {http://doi.acm.org/10.1145/775265.775268},
|
||
doi = {10.1145/775265.775268},
|
||
acmid = {775268},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ LarmuseauPatrignaniEtAl15,
|
||
author = {Larmuseau, Adriaan and Patrignani, Marco and Clarke,
|
||
Dave},
|
||
title = {A Secure Compiler for {ML} Modules},
|
||
booktitle = {Programming Languages and Systems - 13th Asian Symposium,
|
||
{APLAS} 2015, Pohang, South Korea, November 30 - December
|
||
2, 2015, Proceedings},
|
||
pages = {29--48},
|
||
year = {2015},
|
||
url = {http://dx.doi.org/10.1007/978-3-319-26529-2_3},
|
||
doi = {10.1007/978-3-319-26529-2_3},
|
||
timestamp = {Wed, 09 Dec 2015 19:21:03 +0100}
|
||
}
|
||
|
||
@InProceedings{ Lassen05,
|
||
author = {S{\o}ren B. Lassen},
|
||
title = {Eager Normal Form Bisimulation},
|
||
booktitle = {20th {IEEE} Symposium on Logic in Computer Science,
|
||
LICS'05},
|
||
pages = {345--354},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1109/LICS.2005.15},
|
||
doi = {10.1109/LICS.2005.15},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ Lassen06,
|
||
title = {Normal Form Simulation for McCarthy's Amb},
|
||
journal = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {155},
|
||
pages = {445-465},
|
||
year = {2006},
|
||
note = {Proceedings of the 21st Annual Conference on Mathematical
|
||
Foundations of Programming Semantics (MFPS XXI)},
|
||
doi = {https://doi.org/10.1016/j.entcs.2005.11.068},
|
||
url = {https://www.sciencedirect.com/science/article/pii/S1571066106002052},
|
||
author = {Soren B. Lassen}
|
||
}
|
||
|
||
@PhDThesis{ Lassen98,
|
||
title = {Relational Reasoning about Functions and Nondeterminism},
|
||
author = {Lassen, Søren B.},
|
||
year = {1998},
|
||
school = {Aarhus University},
|
||
url = {https://www.brics.dk/DS/98/2/BRICS-DS-98-2.pdf}
|
||
}
|
||
|
||
@Article{ Lawvere64,
|
||
author = {Lawvere, Bill},
|
||
title = {An Elementary Theory of the Category of Sets},
|
||
journal = {Proceedings of the National Academy of Sciences of the
|
||
United States of America},
|
||
volume = 52,
|
||
year = 1964,
|
||
pages = {1506--1511}
|
||
}
|
||
|
||
@InProceedings{ LengletSchmitt15,
|
||
author = {Sergue{\"{\i}} Lenglet and Alan Schmitt},
|
||
editor = {Luca Aceto and David de Frutos{-}Escrig},
|
||
title = {Howe's Method for Contextual Semantics},
|
||
booktitle = {26th International Conference on Concurrency Theory,
|
||
{CONCUR} 2015, Madrid, Spain, September 1.4, 2015},
|
||
series = {LIPIcs},
|
||
volume = {42},
|
||
pages = {212--225},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2015},
|
||
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2015.212},
|
||
doi = {10.4230/LIPIcs.CONCUR.2015.212},
|
||
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}
|
||
}
|
||
|
||
@Article{ LenisaPowerEtAl00,
|
||
author = {Marina Lenisa and John Power and Hiroshi Watanabe},
|
||
title = {Distributivity for endofunctors, pointed and co-pointed
|
||
endofunctors, monads and comonads},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {33},
|
||
pages = {230--260},
|
||
year = {2000},
|
||
url = {https://doi.org/10.1016/S1571-0661(05)80350-0},
|
||
doi = {10.1016/S1571-0661(05)80350-0},
|
||
timestamp = {Fri, 21 Dec 2018 08:26:25 +0100}
|
||
}
|
||
|
||
@Article{ LenisaPowerEtAl04,
|
||
author = {Marina Lenisa and John Power and Hiroshi Watanabe},
|
||
title = {Category theory for operational semantics},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {327},
|
||
number = {1-2},
|
||
pages = {135--154},
|
||
year = {2004},
|
||
url = {https://doi.org/10.1016/j.tcs.2004.07.024},
|
||
doi = {10.1016/j.tcs.2004.07.024},
|
||
timestamp = {Fri, 21 Dec 2018 08:26:19 +0100}
|
||
}
|
||
|
||
@Article{ Leroy09,
|
||
title = {Formal verification of a realistic compiler},
|
||
author = {Leroy, Xavier},
|
||
journal = {Communications of the ACM},
|
||
volume = {52},
|
||
number = {7},
|
||
pages = {107--115},
|
||
year = {2009},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@Article{ Leroy09a,
|
||
author = "Leroy, Xavier",
|
||
title = "A Formally Verified Compiler Back-end",
|
||
journal = "Journal of Automated Reasoning",
|
||
year = "2009",
|
||
month = "Nov",
|
||
day = "04",
|
||
volume = "43",
|
||
number = "4",
|
||
pages = "363",
|
||
doi = "10.1007/s10817-009-9155-4",
|
||
url = "https://doi.org/10.1007/s10817-009-9155-4"
|
||
}
|
||
|
||
@Article{ LeroyGrall08,
|
||
author = {Xavier Leroy and Herv{\'{e}} Grall},
|
||
title = {Coinductive big-step operational semantics},
|
||
journal = {CoRR},
|
||
volume = {abs/0808.0586},
|
||
year = {2008},
|
||
opturl = {http://arxiv.org/abs/0808.0586},
|
||
eprinttype = {arXiv},
|
||
eprint = {0808.0586},
|
||
timestamp = {Mon, 13 Aug 2018 16:46:54 +0200}
|
||
}
|
||
|
||
@PhDThesis{ Levy01,
|
||
author = {Paul Blain Levy},
|
||
title = {Call-by-push-value},
|
||
school = {Queen Mary University of London, {UK}},
|
||
year = {2001},
|
||
url = {https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369233}
|
||
}
|
||
|
||
@Article{ Levy06,
|
||
author = {Paul Blain Levy},
|
||
title = {Call-by-push-value: Decomposing call-by-value and
|
||
call-by-name},
|
||
journal = {High. Order Symb. Comput.},
|
||
volume = {19},
|
||
number = {4},
|
||
pages = {377--414},
|
||
year = {2006},
|
||
doi = {10.1007/S10990-006-0480-6}
|
||
}
|
||
|
||
@InProceedings{ Levy06a,
|
||
author = {Paul Blain Levy},
|
||
editor = {Neil Ghani and John Power},
|
||
title = {Infinitary {H}owe's Method},
|
||
booktitle = {Proceedings of the Eighth Workshop on Coalgebraic Methods
|
||
in Computer Science, {CMCS} 2006, Vienna, Austria, March
|
||
25-27, 2006},
|
||
series = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {164},
|
||
number = {1},
|
||
pages = {85--104},
|
||
publisher = {Elsevier},
|
||
year = {2006},
|
||
url = {https://doi.org/10.1016/j.entcs.2006.06.006},
|
||
doi = {10.1016/j.entcs.2006.06.006},
|
||
timestamp = {Thu, 16 Jan 2020 11:02:39 +0100}
|
||
}
|
||
|
||
@Book{ Levy14,
|
||
title = {Capability-based computer systems},
|
||
author = {Levy, Henry M},
|
||
year = {2014},
|
||
publisher = {Digital Press}
|
||
}
|
||
|
||
@Article{ Levy22,
|
||
author = {Paul Blain Levy},
|
||
title = {Call-by-push-value},
|
||
journal = {{ACM} {SIGLOG} News},
|
||
volume = {9},
|
||
number = {2},
|
||
pages = {7--29},
|
||
year = {2022},
|
||
doi = {10.1145/3537668.3537670}
|
||
}
|
||
|
||
@Book{ Levy84,
|
||
author = {Levy, Henry M.},
|
||
title = {Capability-Based Computer Systems},
|
||
year = {1984},
|
||
publisher = {Butterworth-Heinemann},
|
||
address = {Newton, MA, USA}
|
||
}
|
||
|
||
@Article{ LevyPowerEtAl03,
|
||
altauthor = {Paul Blain Levy and John Power and Hayo Thielecke},
|
||
author = {Paul Levy and John Power and Hayo Thielecke},
|
||
title = {Modelling environments in call-by-value programming
|
||
languages},
|
||
journal = {Inf.\ Comput.},
|
||
volume = {185},
|
||
number = {2},
|
||
pages = {182--210},
|
||
year = {2003},
|
||
timestamp = {Fri, 12 Feb 2021 22:15:52 +0100}
|
||
}
|
||
|
||
@Proceedings{ LieMannanEtAl18,
|
||
editor = {David Lie and Mohammad Mannan and Michael Backes and
|
||
XiaoFeng Wang},
|
||
title = {Proceedings of the 2018 {ACM} {SIGSAC} Conference on
|
||
Computer and Communications Security, {CCS} 2018, Toronto,
|
||
ON, Canada, October 15-19, 2018},
|
||
publisher = {{ACM}},
|
||
year = {2018},
|
||
url = {http://dl.acm.org/citation.cfm?id=3243734},
|
||
timestamp = {Wed, 31 Oct 2018 17:23:34 +0100}
|
||
}
|
||
|
||
@Book{ Mac-Lane78,
|
||
title = {Categories for the {{Working Mathematician}}},
|
||
author = {Mac Lane, S.},
|
||
year = {1978},
|
||
series = {Graduate {{Texts}} in {{Mathematics}}},
|
||
edition = {2},
|
||
volume = {5},
|
||
publisher = springer,
|
||
optaddress = {{New York}},
|
||
url = {http://link.springer.com/10.1007/978-1-4757-4721-8},
|
||
langid = {english}
|
||
}
|
||
|
||
@Book{ Mac-LaneMoerdijk94,
|
||
title = {Sheaves in {{Geometry}} and {{Logic}}: {{A First
|
||
Introduction}} to {{Topos Theory}}},
|
||
shorttitle = {Sheaves in {{Geometry}} and {{Logic}}},
|
||
author = {Mac Lane, Saunders and Moerdijk, Ieke},
|
||
year = {1994},
|
||
series = {Universitext},
|
||
publisher = {{Springer}},
|
||
optaddress = {{New York, NY}},
|
||
doi = {10.1007/978-1-4612-0927-0},
|
||
langid = {english}
|
||
}
|
||
|
||
@InProceedings{ MaffeisMitchellEtAl10,
|
||
title = {Object capabilities and isolation of untrusted web
|
||
applications},
|
||
author = {Maffeis, Sergio and Mitchell, John C and Taly, Ankur},
|
||
booktitle = {2010 IEEE Symposium on Security and Privacy},
|
||
pages = {125--140},
|
||
year = {2010},
|
||
organization = {IEEE}
|
||
}
|
||
|
||
@Article{ MaillardHritcuEtAl20,
|
||
author = {Kenji Maillard and Catalin Hritcu and Exequiel Rivas and
|
||
Antoine Van Muylder},
|
||
title = {The next 700 relational program logics},
|
||
journal = {Proc. {ACM} Program. Lang.},
|
||
volume = {4},
|
||
number = {{POPL}},
|
||
pages = {4:1--4:33},
|
||
year = {2020},
|
||
url = {https://doi.org/10.1145/3371072},
|
||
doi = {10.1145/3371072},
|
||
timestamp = {Mon, 15 Jun 2020 16:49:17 +0200}
|
||
}
|
||
|
||
@InProceedings{ MaillardMellies15,
|
||
author = {Kenji Maillard and Paul{-}Andr{\'{e}} Melli{\`{e}}s},
|
||
title = {A Fibrational Account of Local States},
|
||
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer
|
||
Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015},
|
||
pages = {402--413},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1109/LICS.2015.45},
|
||
doi = {10.1109/LICS.2015.45},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Book{ Manes76,
|
||
title = {Algebraic Theories},
|
||
author = {Manes, E.},
|
||
series = {Applied Mathematical Sciences},
|
||
year = {1976},
|
||
publisher = {Springer New York}
|
||
}
|
||
|
||
@Article{ MartiVenema15,
|
||
author = {Johannes Marti and Yde Venema},
|
||
title = {Lax extensions of coalgebra functors and their logic},
|
||
journal = {J.\ Comput.\ Syst.\ Sci.},
|
||
volume = {81},
|
||
number = {5},
|
||
pages = {880--900},
|
||
year = {2015},
|
||
nourl = {https://doi.org/10.1016/j.jcss.2014.12.006},
|
||
doi = {10.1016/j.jcss.2014.12.006},
|
||
timestamp = {Tue, 16 Feb 2021 14:04:07 +0100}
|
||
}
|
||
|
||
@Misc{ Mcbride01,
|
||
author = {Conor Mcbride},
|
||
title = {The Derivative of a Regular Type is its Type of One-Hole
|
||
Contexts (Extended Abstract)},
|
||
year = {2001}
|
||
}
|
||
|
||
@InCollection{ McCarthy59,
|
||
title = {A Basis for a Mathematical Theory of Computation.},
|
||
editor = {P. Braffort and D. Hirschberg},
|
||
series = {Studies in Logic and the Foundations of Mathematics},
|
||
publisher = {Elsevier},
|
||
volume = {26},
|
||
pages = {33-70},
|
||
year = {1959},
|
||
booktitle = {Computer Programming and Formal Systems},
|
||
doi = {https://doi.org/10.1016/S0049-237X(09)70099-0},
|
||
url = {https://www.sciencedirect.com/science/article/pii/S0049237X09700990},
|
||
author = {John McCarthy}
|
||
}
|
||
|
||
@InProceedings{ McKeenAlexandrovichEtAl13,
|
||
author = {McKeen, Frank and Alexandrovich, Ilya and Berenzon, Alex
|
||
and Rozas, Carlos V. and Shafi, Hisham and Shanbhogue,
|
||
Vedvyas and Savagaonkar, Uday R.},
|
||
title = {Innovative instructions and software model for isolated
|
||
execution},
|
||
booktitle = {HASP '13},
|
||
year = {2013},
|
||
pages = {10:1--10:1},
|
||
articleno = {10},
|
||
numpages = {1},
|
||
url = {http://doi.acm.org/10.1145/2487726.2488368},
|
||
doi = {10.1145/2487726.2488368},
|
||
acmid = {2488368},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@InProceedings{ MemarianMatthiesenEtAl16,
|
||
author = {Memarian, Kayvan and Matthiesen, Justus and Lingard, James
|
||
and Nienhuis, Kyndylan and Chisnall, David and Watson,
|
||
Robert N. M. and Sewell, Peter},
|
||
title = {Into the Depths of C: Elaborating the De Facto Standards},
|
||
booktitle = {Proceedings of the 37th ACM SIGPLAN Conference on
|
||
Programming Language Design and Implementation},
|
||
series = {PLDI '16},
|
||
year = {2016},
|
||
pages = {1--15},
|
||
numpages = {15},
|
||
url = {http://doi.acm.org/10.1145/2908080.2908081},
|
||
doi = {10.1145/2908080.2908081},
|
||
acmid = {2908081},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ MettlerWagnerEtAl10,
|
||
added-at = {2011-08-31T00:00:00.000+0200},
|
||
author = {Mettler, Adrian and Wagner, David and Close, Tyler},
|
||
booktitle = {NDSS},
|
||
interhash = {7e470467c3807a91d3397c39a2f9f4e8},
|
||
intrahash = {82c572b84149e7fa155053f90bfeca95},
|
||
publisher = {The Internet Society},
|
||
timestamp = {2011-09-01T11:33:11.000+0200},
|
||
title = {Joe-E: A Security-Oriented Subset of Java.},
|
||
url = {http://dblp.uni-trier.de/db/conf/ndss/ndss2010.html#MettlerWC10},
|
||
year = 2010
|
||
}
|
||
|
||
@Article{ MeyerovichRabkin13,
|
||
title = {Empirical analysis of programming language adoption},
|
||
author = {Meyerovich, Leo A and Rabkin, Ariel S},
|
||
journal = {ACM SIGPLAN Notices},
|
||
volume = {48},
|
||
number = {10},
|
||
pages = {1--18},
|
||
year = {2013},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@Article{ MiculanPeressotti16,
|
||
author = {Marino Miculan and Marco Peressotti},
|
||
title = {Structural operational semantics for non-deterministic
|
||
processes with quantitative aspects},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {655},
|
||
pages = {135--154},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1016/j.tcs.2016.01.012},
|
||
doi = {10.1016/j.tcs.2016.01.012},
|
||
timestamp = {Wed, 17 Feb 2021 22:01:42 +0100}
|
||
}
|
||
|
||
@Article{ MiliusLitak17,
|
||
author = {Stefan Milius and Tadeusz Litak},
|
||
title = {Guard Your Daggers and Traces: Properties of Guarded
|
||
(Co-)recursion},
|
||
year = 2017,
|
||
volume = 150,
|
||
doi = {10.3233/FI-2017-1475},
|
||
pages = {407--449},
|
||
journal = {Fundamenta Informaticae},
|
||
url = {http://arxiv.org/abs/1603.05214},
|
||
note = {special issue FiCS'13 edited by David Baelde, Arnaud
|
||
Carayol, Ralph Matthes and Igor Walukiewicz}
|
||
}
|
||
|
||
@TechReport{ MillerSamuelEtAl08,
|
||
author = {Miller, Mark S. and Samuel, Mike and Laurie, Ben and Awad,
|
||
Ihab and Stay, Mike},
|
||
howpublished = {\url{http://code.google.com/p/google-caja/downloads/detail?name=caja-spec-2008-06-07.pdf}},
|
||
institution = {Google Inc.},
|
||
key = {caja},
|
||
month = jun,
|
||
organization = {Google Inc.},
|
||
posted-at = {2010-08-13 03:52:04},
|
||
publisher = {Google Inc.},
|
||
title = {{Caja - Safe active content in sanitized JavaScript}},
|
||
year = {2008}
|
||
}
|
||
|
||
@TechReport{ MillerYeeEtAl03,
|
||
author = {Mark Miller and Ka-Ping Yee and Jonathan Shapiro and
|
||
Combex Inc},
|
||
title = {Capability Myths Demolished},
|
||
institution = {},
|
||
year = {2003}
|
||
}
|
||
|
||
@Article{ Milner78,
|
||
title = {A theory of type polymorphism in programming},
|
||
journal = {Journal of Computer and System Sciences},
|
||
volume = {17},
|
||
number = {3},
|
||
pages = {348-375},
|
||
year = {1978},
|
||
doi = {10.1016/0022-0000(78)90014-4},
|
||
author = {Robin Milner}
|
||
}
|
||
|
||
@Book{ Milner80,
|
||
author = {Robin Milner},
|
||
title = {A Calculus of Communicating Systems},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {92},
|
||
publisher = {Springer},
|
||
year = {1980},
|
||
url = {https://doi.org/10.1007/3-540-10235-3},
|
||
doi = {10.1007/3-540-10235-3},
|
||
timestamp = {Tue, 16 May 2017 14:01:44 +0200}
|
||
}
|
||
|
||
@Article{ Milner83,
|
||
title = {Calculi for synchrony and asynchrony},
|
||
journal = {Theoretical Computer Science},
|
||
volume = 25,
|
||
number = 3,
|
||
pages = {267-310},
|
||
year = 1983,
|
||
doi = {https://doi.org/10.1016/0304-3975(83)90114-7},
|
||
author = {Robin Milner}
|
||
}
|
||
|
||
@Book{ Milner89,
|
||
author = {Robin Milner},
|
||
title = {Communication and concurrency},
|
||
series = {{PHI} Series in computer science},
|
||
publisher = {Prentice Hall},
|
||
year = {1989},
|
||
timestamp = {Wed, 27 Apr 2011 17:30:28 +0200}
|
||
}
|
||
|
||
@Book{ Milner99,
|
||
author = {Robin Milner},
|
||
title = {Communicating and mobile systems - the Pi-calculus},
|
||
publisher = {Cambridge University Press},
|
||
year = 1999,
|
||
timestamp = {Wed, 20 Apr 2011 20:17:03 +0200}
|
||
}
|
||
|
||
@Book{ Milner99a,
|
||
title = {Communicating and mobile systems: the pi calculus},
|
||
author = {Milner, Robin},
|
||
year = {1999},
|
||
publisher = {Cambridge university press}
|
||
}
|
||
|
||
@Article{ MilnerParrowEtAl92,
|
||
author = {Robin Milner and Joachim Parrow and David Walker},
|
||
title = {A Calculus of Mobile Processes, {I}},
|
||
journal = {Inf. Comput.},
|
||
volume = {100},
|
||
number = {1},
|
||
pages = {1--40},
|
||
year = {1992},
|
||
url = {https://doi.org/10.1016/0890-5401(92)90008-4},
|
||
doi = {10.1016/0890-5401(92)90008-4},
|
||
timestamp = {Fri, 12 Feb 2021 22:17:04 +0100}
|
||
}
|
||
|
||
@Article{ MilnerWeyhrauch72,
|
||
title = {Proving compiler correctness in a mechanized logic},
|
||
author = {Milner, Robin and Weyhrauch, Richard},
|
||
journal = {Machine Intelligence},
|
||
volume = {7},
|
||
number = {3},
|
||
pages = {51--70},
|
||
year = {1972}
|
||
}
|
||
|
||
@Article{ Mitchell93,
|
||
title = {On abstraction and the expressive power of programming
|
||
languages},
|
||
author = {Mitchell, John C},
|
||
journal = {Science of Computer Programming},
|
||
volume = {21},
|
||
number = {2},
|
||
pages = {141--163},
|
||
year = {1993},
|
||
publisher = {Elsevier}
|
||
}
|
||
|
||
@Book{ Mitchell96,
|
||
author = {John C. Mitchell},
|
||
title = {Foundations for programming languages},
|
||
series = {Foundation of computing series},
|
||
publisher = {{MIT} Press},
|
||
year = {1996},
|
||
timestamp = {Wed, 27 Apr 2011 17:30:32 +0200}
|
||
}
|
||
|
||
@Article{ Moggi91,
|
||
author = {Eugenio Moggi},
|
||
title = {Notions of Computation and Monads},
|
||
journal = {Inf. Comput.},
|
||
volume = {93},
|
||
number = {1},
|
||
pages = {55--92},
|
||
year = {1991},
|
||
url = {https://doi.org/10.1016/0890-5401(91)90052-4},
|
||
doi = {10.1016/0890-5401(91)90052-4},
|
||
timestamp = {Wed, 25 Sep 2019 17:54:39 +0200}
|
||
}
|
||
|
||
@Proceedings{ MoggiRosolini97,
|
||
editor = {Eugenio Moggi and Giuseppe Rosolini},
|
||
title = {Category Theory and Computer Science, 7th International
|
||
Conference, {CTCS} '97, Santa Margherita Ligure, Italy,
|
||
September 4-6, 1997, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1290},
|
||
publisher = {Springer},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1007/BFb0026977},
|
||
doi = {10.1007/BFb0026977},
|
||
timestamp = {Tue, 14 May 2019 10:00:48 +0200}
|
||
}
|
||
|
||
@PhDThesis{ Morris-Jr69,
|
||
title = {Lambda-calculus models of programming languages.},
|
||
author = {Morris Jr, James Hiram},
|
||
year = {1969},
|
||
school = {Massachusetts Institute of Technology}
|
||
}
|
||
|
||
@PhDThesis{ Morris68,
|
||
timestamp = {2017-01-25T21:04:25Z},
|
||
title = {Lambda-Calculus Models of Programming Languages},
|
||
school = {Massachusetts Institute of Technology},
|
||
author = {Morris, James H.},
|
||
year = {1968}
|
||
}
|
||
|
||
@Article{ Morris73,
|
||
author = {Morris,Jr., James H.},
|
||
title = {Protection in Programming Languages},
|
||
journal = {Commun. ACM},
|
||
issue_date = {Jan. 1973},
|
||
volume = {16},
|
||
number = {1},
|
||
month = jan,
|
||
year = {1973},
|
||
pages = {15--21},
|
||
numpages = {7},
|
||
url = {http://doi.acm.org/10.1145/361932.361937},
|
||
doi = {10.1145/361932.361937},
|
||
acmid = {361937},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ MorrisettWalkerEtAl99,
|
||
title = {From System F to typed assembly language},
|
||
author = {Morrisett, Greg and Walker, David and Crary, Karl and
|
||
Glew, Neal},
|
||
journal = {ACM Transactions on Programming Languages and Systems
|
||
(TOPLAS)},
|
||
volume = {21},
|
||
number = {3},
|
||
pages = {527--568},
|
||
year = {1999},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@Proceedings{ MossSobocinski15,
|
||
editor = {Lawrence S. Moss and Pawe{l} Soboci{'{n}}ski},
|
||
title = {6th Conference on Algebra and Coalgebra in Computer
|
||
Science, {CALCO} 2015, June 24-26, 2015, Nijmegen, The
|
||
Netherlands},
|
||
series = {LIPIcs},
|
||
volume = {35},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
|
||
year = {2015},
|
||
url = {http://www.dagstuhl.de/dagpub/978-3-939897-84-2},
|
||
timestamp = {Thu, 02 May 2019 17:40:15 +0200}
|
||
}
|
||
|
||
@Article{ MousaviReniers07,
|
||
author = {Mohammad Reza Mousavi and Michel A. Reniers},
|
||
title = {On Well-Foundedness and Expressiveness of Promoted Tyft:
|
||
Being Promoted Makes a Difference},
|
||
journal = {Electron. Notes Theor. Comput. Sci.},
|
||
volume = {175},
|
||
number = {1},
|
||
pages = {45--56},
|
||
year = {2007},
|
||
url = {https://doi.org/10.1016/j.entcs.2006.09.015},
|
||
doi = {10.1016/j.entcs.2006.09.015},
|
||
timestamp = {Fri, 12 Feb 2021 22:19:28 +0100}
|
||
}
|
||
|
||
@InProceedings{ MousaviReniersEtAl04,
|
||
author = {Mohammad Reza Mousavi and Michel Reniers and Jan Friso
|
||
Groote},
|
||
title = {Congruence for SOS with Data},
|
||
booktitle = {LICS},
|
||
year = {2004},
|
||
pages = {302--313},
|
||
publisher = {IEEE Computer Society Press}
|
||
}
|
||
|
||
@InProceedings{ MurrayOorschot18,
|
||
author = {Toby C. Murray and Paul C. van Oorschot},
|
||
title = {{BP:} Formal Proofs, the Fine Print and Side Effects},
|
||
booktitle = {2018 {IEEE} Cybersecurity Development, SecDev 2018,
|
||
Cambridge, MA, USA, September 30 - October 2, 2018},
|
||
pages = {1--10},
|
||
year = {2018},
|
||
url = {https://doi.org/10.1109/SecDev.2018.00009},
|
||
doi = {10.1109/SecDev.2018.00009},
|
||
timestamp = {Sun, 23 Dec 2018 08:29:10 +0100}
|
||
}
|
||
|
||
@InProceedings{ MyreenGordonEtAl08,
|
||
author = {Myreen, Magnus O. and Gordon, Michael J. C. and Slind,
|
||
Konrad},
|
||
title = {Machine-code Verification for Multiple Architectures: An
|
||
Application of Decompilation into Logic},
|
||
booktitle = {Proceedings of the 2008 International Conference on Formal
|
||
Methods in Computer-Aided Design},
|
||
series = {FMCAD '08},
|
||
year = {2008},
|
||
pages = {20:1--20:8},
|
||
articleno = {20},
|
||
numpages = {8},
|
||
url = {http://dl.acm.org/citation.cfm?id=1517424.1517444},
|
||
acmid = {1517444},
|
||
publisher = {IEEE Press},
|
||
address = {Piscataway, NJ, USA}
|
||
}
|
||
|
||
@InProceedings{ NagarakatteZhaoEtAl10,
|
||
timestamp = {2018-11-15T14:08:40Z},
|
||
series = {ISMM '10},
|
||
title = {{{CETS}}: {{Compiler Enforced Temporal Safety}} for
|
||
{{C}}},
|
||
shorttitle = {{{CETS}}},
|
||
doi = {10.1145/1806651.1806657},
|
||
booktitle = {International {{Symposium}} on {{Memory Management}}},
|
||
publisher = {{ACM}},
|
||
author = {Nagarakatte, Santosh and Zhao, Jianzhou and Martin, Milo
|
||
M.K. and Zdancewic, Steve},
|
||
year = {2010}
|
||
}
|
||
|
||
@InProceedings{ NakataUustalu09,
|
||
author = {Keiko Nakata and Tarmo Uustalu},
|
||
editor = {Stefan Berghofer and Tobias Nipkow and Christian Urban and
|
||
Makarius Wenzel},
|
||
title = {Trace-Based Coinductive Operational Semantics for While},
|
||
booktitle = {Theorem Proving in Higher Order Logics, 22nd International
|
||
Conference, TPHOLs 2009, Munich, Germany, August 17-20,
|
||
2009. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {5674},
|
||
pages = {375--390},
|
||
publisher = {Springer},
|
||
year = {2009},
|
||
url = {https://doi.org/10.1007/978-3-642-03359-9\_26},
|
||
doi = {10.1007/978-3-642-03359-9\_26},
|
||
timestamp = {Tue, 14 May 2019 10:00:48 +0200}
|
||
}
|
||
|
||
@InProceedings{ NewBowmanEtAl16,
|
||
author = {Max S. New and William J. Bowman and Amal Ahmed},
|
||
title = {Fully abstract compilation via universal embedding},
|
||
booktitle = {21st {ACM} {SIGPLAN} International Conference on
|
||
Functional Programming (ICFP 2016)},
|
||
pages = {103--116},
|
||
year = {2016},
|
||
publisher = acm,
|
||
optcrossref = {DBLP:conf/icfp/2016},
|
||
doi = {10.1145/2951913.2951941},
|
||
timestamp = {Tue, 06 Nov 2018 16:59:25 +0100}
|
||
}
|
||
|
||
@InProceedings{ NienhuisJoannouEtAl18,
|
||
title = {Proving security properties of CHERI-MIPS},
|
||
author = {Nienhuis, Kyndylan and Joannou, Alexandre and Sewell,
|
||
Peter},
|
||
booktitle = {Proceedings of the 25th Automated Reasoning Workshop
|
||
Bridging the Gap between Theory and Practice},
|
||
pages = {29},
|
||
year = {2018},
|
||
organization = {University of Cambridge}
|
||
}
|
||
|
||
@InProceedings{ NienhuisJoannouEtAl20,
|
||
title = {Rigorous engineering for hardware security: formal
|
||
modelling and proof in the CHERI design and implementation
|
||
process},
|
||
author = {Nienhuis, Kyndylan and Joannou, Alexandre and Fox, Anthony
|
||
and Roe, Michael and Bauereiss, Thomas and Campbell, Brian
|
||
and Naylor, Matthew and Norton, Robert M and Moore, Simon W
|
||
and Neumann, Peter G and others},
|
||
booktitle = {2020 IEEE Symposium on Security and Privacy (SP). Los
|
||
Alamitos, CA, USA: IEEE Computer Society},
|
||
year = {2020}
|
||
}
|
||
|
||
@InProceedings{ NoormanAgtenEtAl13,
|
||
author = {Noorman, Job and Agten, Pieter and Daniels, Wilfried and
|
||
Strackx, Raoul and Van Herrewege, Anthony and Huygens,
|
||
Christophe and Preneel, Bart and Verbauwhede, Ingrid and
|
||
Piessens, Frank},
|
||
title = {Sancus: Low-cost trustworthy extensible networked devices
|
||
with a zero-software trusted computing base},
|
||
booktitle = {22nd USENIX Security symposium},
|
||
year = {2013},
|
||
month = {August},
|
||
pages = {479--494},
|
||
publisher = {USENIX Association},
|
||
url = {https://lirias.kuleuven.be/handle/123456789/402673}
|
||
}
|
||
|
||
@Article{ NoormanBulckEtAl17,
|
||
author = {Job Noorman and Jo Van Bulck and Jan Tobias M{\"{u}}hlberg
|
||
and Frank Piessens and Pieter Maene and Bart Preneel and
|
||
Ingrid Verbauwhede and Johannes G{\"{o}}tzfried and Tilo
|
||
M{\"{u}}ller and Felix C. Freiling},
|
||
title = {Sancus 2.0: {A} Low-Cost Security Architecture for IoT
|
||
Devices},
|
||
journal = {{ACM} Trans. Priv. Secur.},
|
||
volume = {20},
|
||
number = {3},
|
||
pages = {7:1--7:33},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1145/3079763},
|
||
doi = {10.1145/3079763},
|
||
timestamp = {Mon, 26 Oct 2020 08:42:50 +0100}
|
||
}
|
||
|
||
@InProceedings{ Norell09,
|
||
author = {Norell, Ulf},
|
||
title = {Dependently Typed Programming in Agda},
|
||
booktitle = {Proceedings of the 6th International Conference on
|
||
Advanced Functional Programming},
|
||
series = {AFP'08},
|
||
year = {2009},
|
||
pages = {230--266},
|
||
numpages = {37},
|
||
url = {http://dl.acm.org/citation.cfm?id=1813347.1813352},
|
||
acmid = {1813352},
|
||
publisher = {Springer-Verlag},
|
||
address = {Berlin, Heidelberg}
|
||
}
|
||
|
||
@TechReport{ Norton16,
|
||
author = {Norton, Robert M.},
|
||
title = {{Hardware support for compartmentalisation}},
|
||
year = 2016,
|
||
month = may,
|
||
url = {http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-887.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-887}
|
||
}
|
||
|
||
@TechReport{ NortonChisnallEtAl15,
|
||
author = {Norton, Robert M. and Chisnall, David and Davis, Brooks
|
||
and Koszek, Wojciech and Moore, Simon W. and Murdoch,
|
||
Steven J. and Neumann, Peter G. and Woodruff, Jonathan },
|
||
title = {{Capability Hardware Enhanced RISC Instructions: CHERI
|
||
Programmer’s Guide}},
|
||
year = 2015,
|
||
month = sep,
|
||
url = {http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-877.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-877}
|
||
}
|
||
|
||
@PhDThesis{ Nuyts20,
|
||
title = {Contributions to Multimode and Presheaf Type Theory},
|
||
author = {Nuyts, Andreas},
|
||
year = {2020}
|
||
}
|
||
|
||
@Article{ OHearnRiecke95,
|
||
author = {Peter W. O'Hearn and Jon G. Riecke},
|
||
title = {Kripke Logical Relations and {PCF}},
|
||
journal = {Inf. Comput.},
|
||
volume = {120},
|
||
number = {1},
|
||
pages = {107--116},
|
||
year = {1995},
|
||
doi = {10.1006/inco.1995.1103},
|
||
timestamp = {Fri, 12 Feb 2021 22:16:39 +0100}
|
||
}
|
||
|
||
@Article{ OHearnTennent95,
|
||
author = {Peter W. O'Hearn and Robert D. Tennent},
|
||
title = {Parametricity and Local Variables},
|
||
journal = {J. {ACM}},
|
||
volume = {42},
|
||
number = {3},
|
||
pages = {658--709},
|
||
year = {1995},
|
||
url = {https://doi.org/10.1145/210346.210425},
|
||
doi = {10.1145/210346.210425},
|
||
timestamp = {Tue, 06 Nov 2018 12:51:44 +0100}
|
||
}
|
||
|
||
@PhDThesis{ Ong88,
|
||
title = {The Lazy Lambda Calculus: An Investigation into the
|
||
Foundations of Functional Programming},
|
||
author = {Ong, C-H Luke},
|
||
year = {1988},
|
||
school = {Imperial College London},
|
||
url = {http://hdl.handle.net/10044/1/47211}
|
||
}
|
||
|
||
@InBook{ Ong95,
|
||
author = {Ong, C.-H. L.},
|
||
title = {Correspondence between Operational and Denotational
|
||
Semantics: The Full Abstraction Problem for PCF},
|
||
year = {1995},
|
||
publisher = {Oxford University Press, Inc.},
|
||
address = {USA},
|
||
booktitle = {Handbook of Logic in Computer Science (Vol. 4): Semantic
|
||
Modelling},
|
||
pages = {269?356},
|
||
numpages = {88}
|
||
}
|
||
|
||
@InProceedings{ OwensMyreenEtAl16,
|
||
author = {Owens, Scott and Myreen, Magnus O. and Kumar, Ramana and
|
||
Tan, Yong Kiam},
|
||
title = {Functional Big-Step Semantics},
|
||
year = {2016},
|
||
publisher = {Springer-Verlag},
|
||
address = {Berlin, Heidelberg},
|
||
url = {https://doi.org/10.1007/978-3-662-49498-1_23},
|
||
doi = {10.1007/978-3-662-49498-1_23},
|
||
booktitle = {Proceedings of the 25th European Symposium on Programming
|
||
Languages and Systems - Volume 9632},
|
||
pages = {589–615},
|
||
numpages = {27}
|
||
}
|
||
|
||
@Article{ Parrow14,
|
||
author = {Parrow, Joachim},
|
||
journal = {Math Struct Comp Science},
|
||
title = {General conditions for Full Abstraction},
|
||
year = {2014}
|
||
}
|
||
|
||
@Article{ Patrignani15,
|
||
title = {The Tome of Secure Compilation: Fully Abstract Compilation
|
||
to Protected Modules Architectures},
|
||
author = {Patrignani, Marco},
|
||
year = {2015}
|
||
}
|
||
|
||
@Misc{ Patrignani20,
|
||
title = {Why Should Anyone use Colours? or, Syntax Highlighting
|
||
Beyond Code Snippets},
|
||
author = {Marco Patrignani},
|
||
year = {2020},
|
||
howpublished = {CoRR abs/2001.11334},
|
||
archiveprefix = {arXiv},
|
||
primaryclass = {cs.SE}
|
||
}
|
||
|
||
@Article{ PatrignaniAgtenEtAl15,
|
||
author = {Marco Patrignani and Pieter Agten and Raoul Strackx and
|
||
Bart Jacobs and Dave Clarke and Frank Piessens},
|
||
title = {Secure Compilation to Protected Module Architectures},
|
||
journal = {{ACM} Trans. Program. Lang. Syst.},
|
||
volume = {37},
|
||
number = {2},
|
||
pages = {6:1--6:50},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1145/2699503},
|
||
doi = {10.1145/2699503},
|
||
timestamp = {Tue, 06 Nov 2018 12:51:29 +0100}
|
||
}
|
||
|
||
@Article{ PatrignaniAhmedEtAl19,
|
||
author = {Patrignani, Marco and Ahmed, Amal and Clarke, Dave},
|
||
title = {Formal Approaches to Secure Compilation: A Survey of Fully
|
||
Abstract Compilation and Related Work},
|
||
journal = {ACM Comput. Surv.},
|
||
issue_date = {February 2019},
|
||
volume = {51},
|
||
number = {6},
|
||
month = feb,
|
||
year = {2019},
|
||
pages = {125:1--125:36},
|
||
articleno = {125},
|
||
numpages = {36},
|
||
url = {http://doi.acm.org/10.1145/3280984},
|
||
doi = {10.1145/3280984},
|
||
acmid = {3280984},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ PatrignaniClarke15,
|
||
title = {Fully abstract trace semantics for protected module
|
||
architectures},
|
||
author = {Patrignani, Marco and Clarke, Dave},
|
||
journal = {Computer Languages, Systems \& Structures},
|
||
volume = {42},
|
||
pages = {22--45},
|
||
year = {2015},
|
||
publisher = {Elsevier}
|
||
}
|
||
|
||
@InProceedings{ PatrignaniClarkeEtAl13,
|
||
author = {Marco Patrignani and Dave Clarke and Frank Piessens},
|
||
title = {Secure Compilation of Object-Oriented Components to
|
||
Protected Module Architectures},
|
||
booktitle = {Programming Languages and Systems - 11th Asian Symposium,
|
||
{APLAS} 2013, Melbourne, VIC, Australia, December 9-11,
|
||
2013. Proceedings},
|
||
pages = {176--191},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-319-03542-0\_13},
|
||
doi = {10.1007/978-3-319-03542-0\_13},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@InProceedings{ PatrignaniDevrieseEtAl16,
|
||
author = {Marco Patrignani and Dominique Devriese and Frank
|
||
Piessens},
|
||
title = {On Modular and Fully-Abstract Compilation},
|
||
booktitle = {{IEEE} 29th Computer Security Foundations Symposium, {CSF}
|
||
2016, Lisbon, Portugal, June 27 - July 1, 2016},
|
||
pages = {17--30},
|
||
year = {2016},
|
||
url = {https://doi.org/10.1109/CSF.2016.9},
|
||
doi = {10.1109/CSF.2016.9},
|
||
timestamp = {Thu, 15 Jun 2017 21:35:08 +0200}
|
||
}
|
||
|
||
@InProceedings{ PatrignaniGarg17,
|
||
author = {Patrignani, Marco and Garg, Deepak},
|
||
title = {{Secure Compilation and Hyperproperties Preservation}},
|
||
year = {2017},
|
||
pages = {},
|
||
series = {CSF 2017},
|
||
booktitle = {{Proceedings of the 30th IEEE Computer Security
|
||
Foundations Symposium {CSF} 2017, Santa Barbara, USA}}
|
||
}
|
||
|
||
@InProceedings{ PatrignaniGarg19,
|
||
author = {Marco Patrignani and Deepak Garg},
|
||
title = {Robustly Safe Compilation},
|
||
booktitle = {Programming Languages and Systems - 28th European
|
||
Symposium on Programming, {ESOP} 2019, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of
|
||
Software, {ETAPS} 2019, Prague, Czech Republic, April 6-11,
|
||
2019, Proceedings},
|
||
pages = {469--498},
|
||
year = {2019},
|
||
crossref-ignore={DBLP:conf/esop/2019},
|
||
url = {https://doi.org/10.1007/978-3-030-17184-1\_17},
|
||
doi = {10.1007/978-3-030-17184-1\_17},
|
||
timestamp = {Tue, 09 Apr 2019 14:10:11 +0200}
|
||
}
|
||
|
||
@Article{ PatrignaniMartinEtAl20,
|
||
author = {Marco Patrignani and Eric Mark Martin and Dominique
|
||
Devriese},
|
||
title = {On the Semantic Expressiveness of Recursive Types},
|
||
journal = {CoRR},
|
||
volume = {abs/2010.10859},
|
||
year = {2020},
|
||
url = {https://arxiv.org/abs/2010.10859},
|
||
archiveprefix = {arXiv},
|
||
eprint = {2010.10859},
|
||
timestamp = {Mon, 26 Oct 2020 15:39:44 +0100}
|
||
}
|
||
|
||
@InProceedings{ PatrignaniMartinEtAl21,
|
||
author = {Patrignani, Marco and Martin, Eric Mark and Devriese,
|
||
Dominique},
|
||
title = {On the Semantic Expressiveness of Recursive Types},
|
||
booktitle = {48th ACM SIGPLAN Symposium on Principles of Programming
|
||
Languages (POPL 2021)},
|
||
year = {2021},
|
||
issue_date = {January 2021},
|
||
publisher = acm,
|
||
optaddress = {New York, NY, USA},
|
||
volume = {5},
|
||
optnumber = {POPL},
|
||
doi = {10.1145/3434302},
|
||
series = {Proc. ACM Program. Lang.},
|
||
optmonth = {Jan},
|
||
articleno = {21},
|
||
numpages = {29}
|
||
}
|
||
|
||
@Article{ PattersonAhmed19,
|
||
author = {Patterson, Daniel and Ahmed, Amal},
|
||
title = {The next 700 Compiler Correctness Theorems (Functional
|
||
Pearl)},
|
||
year = {2019},
|
||
issue_date = {August 2019},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {3},
|
||
number = {ICFP},
|
||
url = {https://doi.org/10.1145/3341689},
|
||
doi = {10.1145/3341689},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
month = jul,
|
||
articleno = {85},
|
||
numpages = {29}
|
||
}
|
||
|
||
@InProceedings{ PercontiAhmed14,
|
||
author = {James T. Perconti and Amal Ahmed},
|
||
title = {Verifying an Open Compiler Using Multi-language
|
||
Semantics},
|
||
booktitle = {Programming Languages and Systems - 23rd European
|
||
Symposium on Programming, {ESOP} 2014, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of
|
||
Software, {ETAPS} 2014},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8410},
|
||
pages = {128--148},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
doi = {10.1007/978-3-642-54833-8\_8}
|
||
}
|
||
|
||
@Book{ Pierce02,
|
||
author = {Benjamin C. Pierce},
|
||
title = {Types and programming languages},
|
||
publisher = {{MIT} Press},
|
||
year = {2002},
|
||
timestamp = {Thu, 03 Feb 2011 10:51:35 +0100}
|
||
}
|
||
|
||
@InProceedings{ PiessensDevrieseEtAl16,
|
||
title = {Security guarantees for the execution infrastructure of
|
||
software applications},
|
||
author = {Piessens, Frank and Devriese, Dominique and M\"{u}hlberg,
|
||
Jan Tobias and Strackx, Raoul},
|
||
year = {2016},
|
||
series = {IEEE SecDev'16},
|
||
note = "Private communication - To appear in IEEE SecDev 2016"
|
||
}
|
||
|
||
@InProceedings{ PirogGibbons15,
|
||
title = {Monads for Behaviour},
|
||
author = {Maciej Pir{\'{o}}g and Jeremy Gibbons},
|
||
altbooktitle = {Proc. Mathematical Foundations of Programming Semantics
|
||
XXIX, MFPS 2013},
|
||
booktitle = {Mathematical Foundations of Programming Semantics, MFPS
|
||
2013},
|
||
series = entcs,
|
||
pages = {309--324},
|
||
volume = {298},
|
||
year = {2015}
|
||
}
|
||
|
||
@InProceedings{ Pitts00,
|
||
author = {Andrew M. Pitts},
|
||
editor = {Gilles Barthe and Peter Dybjer and Lu{\'{\i}}s Pinto and
|
||
Jo{\~{a}}o Saraiva},
|
||
title = {Operational Semantics and Program Equivalence},
|
||
booktitle = {Applied Semantics, International Summer School, {APPSEM}
|
||
2000, Caminha, Portugal, September 9-15, 2000, Advanced
|
||
Lectures},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {2395},
|
||
pages = {378--412},
|
||
publisher = {Springer},
|
||
year = {2000},
|
||
url = {https://doi.org/10.1007/3-540-45699-6\_8},
|
||
doi = {10.1007/3-540-45699-6\_8},
|
||
timestamp = {Fri, 17 Jul 2020 11:39:04 +0200}
|
||
}
|
||
|
||
@Article{ Pitts00a,
|
||
title = {Parametric Polymorphism and Operational Equivalence},
|
||
author = {Pitts, Andrew M.},
|
||
year = {2000},
|
||
optmonth = jun,
|
||
journal = {Mathematical Structures in Computer Science},
|
||
volume = {10},
|
||
number = {3},
|
||
pages = {321--359},
|
||
publisher = {{Cambridge University Press}},
|
||
doi = {10.1017/S0960129500003066},
|
||
langid = {english}
|
||
}
|
||
|
||
@InCollection{ Pitts04,
|
||
editor = {Pierce, Benjamin C.},
|
||
author = {Andrew M. Pitts},
|
||
chapter = {7},
|
||
title = {Typed operational reasoning},
|
||
booktitle = {Advanced Topics in Types and Programming Languages},
|
||
year = {2004},
|
||
publisher = {The MIT Press}
|
||
}
|
||
|
||
@InBook{ Pitts11,
|
||
place = {Cambridge},
|
||
series = {Cambridge Tracts in Theoretical Computer Science},
|
||
title = {Howe's method for higher-order languages},
|
||
doi = {10.1017/CBO9780511792588.006},
|
||
booktitle = {Advanced Topics in Bisimulation and Coinduction},
|
||
publisher = {Cambridge University Press},
|
||
author = {Pitts, Andrew},
|
||
editor = {Sangiorgi, Davide and Rutten, JanEditors},
|
||
year = {2011},
|
||
pages = {197232},
|
||
collection = {Cambridge Tracts in Theoretical Computer Science}
|
||
}
|
||
|
||
@InProceedings{ Pitts96,
|
||
author = {Andrew M. Pitts},
|
||
title = {Reasoning about Local Variables with Operationally-Based
|
||
Logical Relations},
|
||
booktitle = {11th Annual {IEEE} Symposium on Logic in Computer Science
|
||
(LICS 1996)},
|
||
pages = {152--163},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {1996},
|
||
doi = {10.1109/LICS.1996.561314},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}
|
||
}
|
||
|
||
@Article{ Pitts96a,
|
||
title = {Relational Properties of Domains},
|
||
journal = {Information and Computation},
|
||
volume = {127},
|
||
number = {2},
|
||
pages = {66-90},
|
||
year = {1996},
|
||
doi = {10.1006/inco.1996.0052},
|
||
author = {Andrew M. Pitts}
|
||
}
|
||
|
||
@Article{ Pitts97,
|
||
author = {Andrew M. Pitts},
|
||
title = {A Note on Logical Relations Between Semantics and Syntax},
|
||
journal = {Log. J. {IGPL}},
|
||
volume = {5},
|
||
number = {4},
|
||
pages = {589--601},
|
||
year = {1997},
|
||
url = {https://doi.org/10.1093/jigpal/5.4.589},
|
||
doi = {10.1093/jigpal/5.4.589},
|
||
timestamp = {Fri, 06 Mar 2020 22:00:08 +0100}
|
||
}
|
||
|
||
@Article{ Pitts97a,
|
||
title = {Operationally-based theories of program equivalence},
|
||
author = {Pitts, Andrew M},
|
||
journal = {Semantics and Logics of Computation},
|
||
volume = {14},
|
||
pages = {241},
|
||
year = {1997}
|
||
}
|
||
|
||
@InProceedings{ Pitts98,
|
||
author = {Andrew M. Pitts},
|
||
title = {Existential Types: Logical Relations and Operational
|
||
Equivalence},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1443},
|
||
pages = {309--326},
|
||
publisher = {Springer},
|
||
year = {1998},
|
||
doi = {10.1007/BFb0055063}
|
||
}
|
||
|
||
@InProceedings{ PittsStark93,
|
||
title = {Observable Properties of Higher Order Functions That
|
||
Dynamically Create Local Names, or: {{What}}'s New?},
|
||
shorttitle = {Observable Properties of Higher Order Functions That
|
||
Dynamically Create Local Names, Or},
|
||
booktitle = {8th International Symposium on Mathematical Foundations of
|
||
Computer Science (MFCS 1993)},
|
||
author = {Pitts, Andrew M. and Stark, Ian D. B.},
|
||
opteditor = {Borzyszkowski, Andrzej M. and Soko{\l}owski, Stefan},
|
||
year = {1993},
|
||
series = lncs,
|
||
volume = {711},
|
||
pages = {122--141},
|
||
publisher = springer,
|
||
optaddress = {{Berlin, Heidelberg}},
|
||
doi = {10.1007/3-540-57182-5_8},
|
||
langid = {english}
|
||
}
|
||
|
||
@InCollection{ PittsStark98,
|
||
author = {Andrew M. Pitts and Ian D. B. Stark},
|
||
title = {Operational Reasoning for Functions with Local State},
|
||
booktitle = {Higher Order Operational Techniques in Semantics},
|
||
editor = {Gordon, Andrew D. and Pitts, Andrew M.},
|
||
year = {1998},
|
||
pages = {227--274},
|
||
numpages = {48},
|
||
opturl = {http://dl.acm.org/citation.cfm?id=309656.309671},
|
||
acmid = {309671},
|
||
publisher = {Cambridge University Press},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Plotkin04,
|
||
author = {Gordon D. Plotkin},
|
||
title = {A structural approach to operational semantics},
|
||
journal = {J. Log. Algebr. Program.},
|
||
volume = {60-61},
|
||
pages = {17--139},
|
||
year = {2004},
|
||
timestamp = {Mon, 21 Feb 2005 12:50:35 +0100}
|
||
}
|
||
|
||
@TechReport{ Plotkin73,
|
||
title = {Lambda-Definability and Logical Relations},
|
||
author = {Plotkin, G. D.},
|
||
year = {1973},
|
||
optmonth = oct,
|
||
institution = {{University of Edinburgh}}
|
||
}
|
||
|
||
@Article{ Plotkin77,
|
||
author = {Gordon D. Plotkin},
|
||
title = {{LCF} Considered as a Programming Language},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {5},
|
||
number = {3},
|
||
pages = {223--255},
|
||
year = {1977},
|
||
url = {https://doi.org/10.1016/0304-3975(77)90044-5},
|
||
doi = {10.1016/0304-3975(77)90044-5},
|
||
timestamp = {Wed, 17 Feb 2021 22:00:26 +0100}
|
||
}
|
||
|
||
@InProceedings{ PlotkinPower01,
|
||
author = {Gordon D. Plotkin and John Power},
|
||
editor = {Furio Honsell and Marino Miculan},
|
||
title = {Adequacy for Algebraic Effects},
|
||
booktitle = {Foundations of Software Science and Computation
|
||
Structures, 4th International Conference, {FOSSACS} 2001
|
||
Held as Part of the Joint European Conferences on Theory
|
||
and Practice of Software, {ETAPS} 2001 Genova, Italy, April
|
||
2-6, 2001, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {2030},
|
||
pages = {1--24},
|
||
publisher = {Springer},
|
||
year = {2001},
|
||
doi = {10.1007/3-540-45315-6\_1}
|
||
}
|
||
|
||
@InProceedings{ PlotkinPowerEtAl00,
|
||
author = {Gordon D. Plotkin and John Power and Donald Sannella and
|
||
Robert D. Tennent},
|
||
editor = {Ugo Montanari and Jos{\'{e}} D. P. Rolim and Emo Welzl},
|
||
title = {Lax Logical Relations},
|
||
booktitle = {Automata, Languages and Programming, 27th International
|
||
Colloquium, {ICALP} 2000, Geneva, Switzerland, July 9-15,
|
||
2000, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1853},
|
||
pages = {85--102},
|
||
publisher = {Springer},
|
||
year = {2000},
|
||
url = {https://doi.org/10.1007/3-540-45022-X\_9},
|
||
doi = {10.1007/3-540-45022-X\_9},
|
||
timestamp = {Sun, 25 Jul 2021 11:54:49 +0200}
|
||
}
|
||
|
||
@InProceedings{ Popescu09,
|
||
author = {Andrei Popescu},
|
||
title = {Weak Bisimilarity Coalgebraically},
|
||
booktitle = {Algebra and Coalgebra in Computer Science, Third
|
||
International Conference, {CALCO} 2009, Udine, Italy,
|
||
September 7-10, 2009. Proceedings},
|
||
pages = {157--172},
|
||
year = {2009},
|
||
crossref-ignore={DBLP:conf/calco/2009},
|
||
url = {https://doi.org/10.1007/978-3-642-03741-2\_12},
|
||
doi = {10.1007/978-3-642-03741-2\_12},
|
||
timestamp = {Wed, 24 May 2017 08:30:19 +0200}
|
||
}
|
||
|
||
@InProceedings{ Pous05,
|
||
author = {Damien Pous},
|
||
editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and
|
||
Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung},
|
||
title = {Up-to Techniques for Weak Bisimulation},
|
||
booktitle = {Automata, Languages and Programming, 32nd International
|
||
Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15,
|
||
2005, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3580},
|
||
pages = {730--741},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
url = {https://doi.org/10.1007/11523468\_59},
|
||
doi = {10.1007/11523468\_59},
|
||
timestamp = {Tue, 14 May 2019 10:00:44 +0200}
|
||
}
|
||
|
||
@InProceedings{ Pous07,
|
||
author = {Damien Pous},
|
||
editor = {Zhong Shao},
|
||
title = {Complete Lattices and Up-To Techniques},
|
||
booktitle = {Programming Languages and Systems, 5th Asian Symposium,
|
||
{APLAS} 2007, Singapore, November 29-December 1, 2007,
|
||
Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {4807},
|
||
pages = {351--366},
|
||
publisher = {Springer},
|
||
year = {2007},
|
||
url = {https://doi.org/10.1007/978-3-540-76637-7\_24},
|
||
doi = {10.1007/978-3-540-76637-7\_24},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@InBook{ PousSangiorgi11,
|
||
place = {Cambridge},
|
||
series = {Cambridge Tracts in Theoretical Computer Science},
|
||
title = {Enhancements of the bisimulation proof method},
|
||
doi = {10.1017/CBO9780511792588.007},
|
||
booktitle = {Advanced Topics in Bisimulation and Coinduction},
|
||
publisher = {Cambridge University Press},
|
||
author = {Pous, Damien and Sangiorgi, Davide},
|
||
editor = {Sangiorgi, Davide and Rutten, JanEditors},
|
||
year = {2011},
|
||
pages = {233--289},
|
||
collection = {Cambridge Tracts in Theoretical Computer Science}
|
||
}
|
||
|
||
@InCollection{ PousSangiorgi12,
|
||
author = {Damien Pous and Davide Sangiorgi},
|
||
editor = {Davide Sangiorgi and Jan J. M. M. Rutten},
|
||
title = {Enhancements of the bisimulation proof method},
|
||
booktitle = {Advanced Topics in Bisimulation and Coinduction},
|
||
series = {Cambridge tracts in theoretical computer science},
|
||
volume = {52},
|
||
pages = {233--289},
|
||
publisher = {Cambridge University Press},
|
||
year = {2012},
|
||
timestamp = {Fri, 22 May 2020 12:03:09 +0200}
|
||
}
|
||
|
||
@InProceedings{ PowerTuri99,
|
||
author = {John Power and Daniele Turi},
|
||
editor = {Martin Hofmann and Giuseppe Rosolini and Dusko Pavlovic},
|
||
title = {A Coalgebraic Foundation for Linear Time Semantics},
|
||
booktitle = {Conference on Category Theory and Computer Science, {CTCS}
|
||
1999, Edinburgh, UK, December 10-12, 1999},
|
||
series = {Electronic Notes in Theoretical Computer Science},
|
||
volume = {29},
|
||
pages = {259--274},
|
||
publisher = {Elsevier},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1016/S1571-0661(05)80319-6},
|
||
doi = {10.1016/S1571-0661(05)80319-6},
|
||
timestamp = {Fri, 17 Jan 2020 09:41:47 +0100}
|
||
}
|
||
|
||
@Article{ PowerWatanabe99,
|
||
author = {John Power and Hiroshi Watanabe},
|
||
title = {Distributivity for a monad and a comonad},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {19},
|
||
pages = {102},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1016/S1571-0661(05)80271-3},
|
||
doi = {10.1016/S1571-0661(05)80271-3},
|
||
timestamp = {Fri, 21 Dec 2018 08:26:27 +0100}
|
||
}
|
||
|
||
@Proceedings{ RajamaniWalker15,
|
||
editor = {Sriram K. Rajamani and David Walker},
|
||
title = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT}
|
||
Symposium on Principles of Programming Languages, {POPL}
|
||
2015, Mumbai, India, January 15-17, 2015},
|
||
publisher = {{ACM}},
|
||
year = {2015},
|
||
url = {http://dl.acm.org/citation.cfm?id=2676726},
|
||
timestamp = {Sat, 20 Dec 2014 16:56:16 +0100}
|
||
}
|
||
|
||
@InProceedings{ Reynolds83,
|
||
author = {John C. Reynolds},
|
||
editor = {R. E. A. Mason},
|
||
title = {Types, Abstraction and Parametric Polymorphism},
|
||
booktitle = {Information Processing 83, Proceedings of the {IFIP} 9th
|
||
World Computer Congress, Paris, France, September 19-23,
|
||
1983},
|
||
pages = {513--523},
|
||
publisher = {North-Holland/IFIP},
|
||
year = {1983},
|
||
timestamp = {Sun, 28 Jul 2019 17:03:41 +0200}
|
||
}
|
||
|
||
@Article{ Rice53,
|
||
title = {Classes of recursively enumerable sets and their decision
|
||
problems},
|
||
author = {Rice, Henry Gordon},
|
||
journal = {Transactions of the American Mathematical Society},
|
||
volume = {74},
|
||
number = {2},
|
||
pages = {358--366},
|
||
year = {1953},
|
||
publisher = {JSTOR}
|
||
}
|
||
|
||
@Article{ RoemerBuchananEtAl12,
|
||
title = {Return-oriented programming: Systems, languages, and
|
||
applications},
|
||
author = {Roemer, Ryan and Buchanan, Erik and Shacham, Hovav and
|
||
Savage, Stefan},
|
||
journal = {ACM Transactions on Information and System Security
|
||
(TISSEC)},
|
||
volume = {15},
|
||
number = {1},
|
||
pages = {2},
|
||
year = {2012},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@Article{ RoscherBonischEtAl18,
|
||
author = {Stefan Roscher and Volker B{\"{o}}nisch and John Lee and
|
||
Dennis Zeisberg and Jochen Schweflinghaus},
|
||
title = {Integrating solutions on {IBM} {Z} with Secure Service
|
||
Container},
|
||
journal = {{IBM} J. Res. Dev.},
|
||
volume = {62},
|
||
number = {2/3},
|
||
pages = {3},
|
||
year = {2018},
|
||
url = {http://ieeexplore.ieee.org/document/8281496/},
|
||
timestamp = {Fri, 13 Mar 2020 10:54:23 +0100}
|
||
}
|
||
|
||
@Article{ RotBonchiEtAl17,
|
||
author = {Jurriaan Rot and Filippo Bonchi and Marcello M. Bonsangue
|
||
and Damien Pous and Jan Rutten and Alexandra Silva},
|
||
title = {Enhanced coalgebraic bisimulation},
|
||
journal = {Mathematical Structures in Computer Science},
|
||
volume = {27},
|
||
number = {7},
|
||
pages = {1236--1264},
|
||
year = {2017},
|
||
url = {https://doi.org/10.1017/S0960129515000523},
|
||
doi = {10.1017/S0960129515000523},
|
||
timestamp = {Sat, 19 Oct 2019 19:27:06 +0200}
|
||
}
|
||
|
||
@InProceedings{ RotBonsangueEtAl13,
|
||
author = {Jurriaan Rot and Marcello M. Bonsangue and Jan J. M. M.
|
||
Rutten},
|
||
editor = {Peter van Emde Boas and Frans C. A. Groen and Giuseppe F.
|
||
Italiano and Jerzy R. Nawrocki and Harald Sack},
|
||
title = {Coalgebraic Bisimulation-Up-To},
|
||
booktitle = {{SOFSEM} 2013: Theory and Practice of Computer Science,
|
||
39th International Conference on Current Trends in Theory
|
||
and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
|
||
Ml{\'{y}}n, Czech Republic, January 26-31, 2013. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {7741},
|
||
pages = {369--381},
|
||
publisher = {Springer},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-642-35843-2\_32},
|
||
doi = {10.1007/978-3-642-35843-2\_32},
|
||
timestamp = {Sat, 19 Oct 2019 20:01:21 +0200}
|
||
}
|
||
|
||
@Article{ RotheMasulovic02,
|
||
author = {Jan Rothe and Dragan Masulovic},
|
||
title = {Towards Weak Bisimulation For Coalgebras},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {68},
|
||
number = {1},
|
||
pages = {32--46},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1016/S1571-0661(04)80499-7},
|
||
doi = {10.1016/S1571-0661(04)80499-7},
|
||
timestamp = {Sun, 28 May 2017 13:22:54 +0200}
|
||
}
|
||
|
||
@Misc{ Rubini13,
|
||
title = {GNU-barcode 0.99},
|
||
author = {Alessandro Rubini},
|
||
year = {2013},
|
||
url = {https://www.gnu.org/software/barcode/}
|
||
}
|
||
|
||
@Article{ Rutten00,
|
||
author = {Jan J. M. M. Rutten},
|
||
title = {Universal coalgebra: a theory of systems},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {249},
|
||
number = {1},
|
||
pages = {3--80},
|
||
year = {2000},
|
||
url = {https://doi.org/10.1016/S0304-3975(00)00056-6},
|
||
doi = {10.1016/S0304-3975(00)00056-6},
|
||
timestamp = {Wed, 17 Feb 2021 21:56:36 +0100}
|
||
}
|
||
|
||
@Article{ Rutten99,
|
||
author = {Jan J. M. M. Rutten},
|
||
title = {A note on coinduction and weak bisimilarity for while
|
||
programs},
|
||
journal = {{ITA}},
|
||
volume = {33},
|
||
number = {4/5},
|
||
pages = {393--400},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1051/ita:1999125},
|
||
doi = {10.1051/ita:1999125},
|
||
timestamp = {Sun, 28 May 2017 13:19:34 +0200}
|
||
}
|
||
|
||
@InProceedings{ RuttenTuri92,
|
||
author = {Jan J. M. M. Rutten and Daniele Turi},
|
||
title = {On the Foundation of Final Semantics: Non-Standard Sets,
|
||
Metric Spaces, Partial Orders},
|
||
booktitle = {Sematics: Foundations and Applications, {REX} Workshop,
|
||
Beekbergen, The Netherlands, June 1-4, 1992, Proceedings},
|
||
pages = {477--530},
|
||
year = {1992},
|
||
url = {https://doi.org/10.1007/3-540-56596-5\_45},
|
||
doi = {10.1007/3-540-56596-5\_45},
|
||
timestamp = {Tue, 14 May 2019 10:00:52 +0200}
|
||
}
|
||
|
||
@Article{ SaltzerSchroeder75,
|
||
title = {The protection of information in computer systems},
|
||
author = {Saltzer, Jerome H and Schroeder, Michael D},
|
||
journal = {Proceedings of the IEEE},
|
||
volume = {63},
|
||
number = {9},
|
||
pages = {1278--1308},
|
||
year = {1975},
|
||
publisher = {IEEE}
|
||
}
|
||
|
||
@Book{ Sangiorgi11,
|
||
place = {Cambridge},
|
||
title = {Introduction to Bisimulation and Coinduction},
|
||
publisher = {Cambridge University Press},
|
||
author = {Sangiorgi, Davide},
|
||
year = {2011}
|
||
}
|
||
|
||
@Article{ Sangiorgi94,
|
||
author = {Davide Sangiorgi},
|
||
title = {The Lazy Lambda Calculus in a Concurrency Scenario},
|
||
journal = {Inf. Comput.},
|
||
volume = {111},
|
||
number = {1},
|
||
pages = {120--153},
|
||
year = {1994},
|
||
url = {https://doi.org/10.1006/inco.1994.1042},
|
||
doi = {10.1006/inco.1994.1042},
|
||
timestamp = {Fri, 12 Feb 2021 22:16:21 +0100}
|
||
}
|
||
|
||
@Article{ Sangiorgi96,
|
||
author = {Davide Sangiorgi},
|
||
title = {Bisimulation for Higher-Order Process Calculi},
|
||
journal = {Inf. Comput.},
|
||
volume = {131},
|
||
number = {2},
|
||
pages = {141--178},
|
||
year = {1996},
|
||
url = {https://doi.org/10.1006/inco.1996.0096},
|
||
doi = {10.1006/inco.1996.0096},
|
||
timestamp = {Fri, 12 Feb 2021 22:16:52 +0100}
|
||
}
|
||
|
||
@InProceedings{ SangiorgiKobayashiEtAl07,
|
||
author = {Davide Sangiorgi and Naoki Kobayashi and Eijiro Sumii},
|
||
title = {Environmental Bisimulations for Higher-Order Languages},
|
||
booktitle = {22nd Annual {IEEE} Symposium on Logic in Computer Science,
|
||
LICS'07},
|
||
pages = {293--302},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2007},
|
||
url = {https://doi.org/10.1109/LICS.2007.17},
|
||
doi = {10.1109/LICS.2007.17},
|
||
timestamp = {Sat, 19 Oct 2019 20:00:56 +0200}
|
||
}
|
||
|
||
@InProceedings{ SangiorgiMilner92,
|
||
author = {Davide Sangiorgi and Robin Milner},
|
||
editor = {Rance Cleaveland},
|
||
title = {The Problem of "Weak Bisimulation up to"},
|
||
booktitle = {{CONCUR} '92, Third International Conference on
|
||
Concurrency Theory, Stony Brook, NY, USA, August 24-27,
|
||
1992, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {630},
|
||
pages = {32--46},
|
||
publisher = {Springer},
|
||
year = {1992},
|
||
url = {https://doi.org/10.1007/BFb0084781},
|
||
doi = {10.1007/BFb0084781},
|
||
timestamp = {Tue, 14 May 2019 10:00:43 +0200}
|
||
}
|
||
|
||
@Book{ SangiorgiRutten11,
|
||
author = {Sangiorgi, Davide and Rutten, Jan},
|
||
title = {Advanced Topics in Bisimulation and Coinduction},
|
||
year = {2011},
|
||
publisher = {Cambridge University Press},
|
||
address = {USA},
|
||
edition = {1st}
|
||
}
|
||
|
||
@TechReport{ Scott70,
|
||
title = "Outline of a Mathematical Theory of Computation",
|
||
author = "Dana Scott",
|
||
year = "1970",
|
||
institution = "Oxford University Computing Laboratory",
|
||
month = "November",
|
||
number = "PRG02"
|
||
}
|
||
|
||
@Book{ Selinger18,
|
||
title = {Lecture Notes on the Lambda Calculus},
|
||
author = {Selinger, P.},
|
||
url = {https://books.google.be/books?id=zszdvQEACAAJ},
|
||
year = {2018},
|
||
publisher = {Lulu.com}
|
||
}
|
||
|
||
@Article{ SEV-SNP20,
|
||
title = {Strengthening VM isolation with integrity protection and
|
||
more},
|
||
author = {SEV-SNP, AMD},
|
||
year = {2020}
|
||
}
|
||
|
||
@InProceedings{ SewellMyreenEtAl13,
|
||
author = {Sewell, Thomas Arthur Leck and Myreen, Magnus O. and
|
||
Klein, Gerwin},
|
||
title = {Translation Validation for a Verified OS Kernel},
|
||
booktitle = {Proceedings of the 34th ACM SIGPLAN Conference on
|
||
Programming Language Design and Implementation},
|
||
series = {PLDI '13},
|
||
year = {2013},
|
||
pages = {471--482},
|
||
numpages = {12},
|
||
url = {http://doi.acm.org/10.1145/2491956.2462183},
|
||
doi = {10.1145/2491956.2462183},
|
||
acmid = {2462183},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ ShachamPageEtAl04,
|
||
title = {On the effectiveness of address-space randomization},
|
||
author = {Shacham, Hovav and Page, Matthew and Pfaff, Ben and Goh,
|
||
Eu-Jin and Modadugu, Nagendra and Boneh, Dan},
|
||
booktitle = {Proceedings of the 11th ACM conference on Computer and
|
||
communications security},
|
||
pages = {298--307},
|
||
year = {2004},
|
||
organization = {ACM}
|
||
}
|
||
|
||
@Proceedings{ Shan13,
|
||
editor = {Chung{-}chieh Shan},
|
||
title = {Programming Languages and Systems - 11th Asian Symposium,
|
||
{APLAS} 2013, Melbourne, VIC, Australia, December 9-11,
|
||
2013. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8301},
|
||
publisher = {Springer},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1007/978-3-319-03542-0},
|
||
doi = {10.1007/978-3-319-03542-0},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@Article{ ShapiroSmithEtAl99,
|
||
author = {Shapiro, Jonathan S. and Smith, Jonathan M. and Farber,
|
||
David J.},
|
||
title = {EROS: A Fast Capability System},
|
||
journal = {SIGOPS Oper. Syst. Rev.},
|
||
issue_date = {Dec. 1999},
|
||
volume = {33},
|
||
number = {5},
|
||
month = dec,
|
||
year = {1999},
|
||
pages = {170--185},
|
||
numpages = {16},
|
||
url = {http://doi.acm.org/10.1145/319344.319163},
|
||
doi = {10.1145/319344.319163},
|
||
acmid = {319163},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ Sieber92,
|
||
series = {London Mathematical Society Lecture Note Series},
|
||
title = {Reasoning about sequential functions via logical
|
||
relations},
|
||
doi = {10.1017/CBO9780511525902.015},
|
||
booktitle = {Applications of Categories in Computer Science:
|
||
Proceedings of the London Mathematical Society Symposium,
|
||
Durham 1991},
|
||
publisher = {Cambridge University Press},
|
||
author = {Sieber, K.},
|
||
editor = {Fourman, M. P. and Johnstone, P. T. and Pitts, A.
|
||
M.Editors},
|
||
year = {1992},
|
||
pages = {258–269}
|
||
}
|
||
|
||
@Article{ SilvaBonchiEtAl13,
|
||
author = {Alexandra Silva and Filippo Bonchi and Marcello M.
|
||
Bonsangue and Jan J. M. M. Rutten},
|
||
title = {Generalizing determinization from automata to coalgebras},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {9},
|
||
number = {1},
|
||
year = {2013},
|
||
url = {https://doi.org/10.2168/LMCS-9(1:9)2013},
|
||
doi = {10.2168/LMCS-9(1:9)2013},
|
||
timestamp = {Fri, 27 Dec 2019 21:15:13 +0100}
|
||
}
|
||
|
||
@Misc{ Simonov17,
|
||
title = {LibYAML 0.1.7},
|
||
author = {Kirill Simonov},
|
||
year = {2017},
|
||
url = {https://pyyaml.org/wiki/LibYAML}
|
||
}
|
||
|
||
@Article{ SimpsonBarua13,
|
||
title = {MemSafe: ensuring the spatial and temporal memory safety
|
||
of C at runtime},
|
||
author = {Simpson, Matthew S and Barua, Rajeev K},
|
||
journal = {Software: Practice and Experience},
|
||
volume = {43},
|
||
number = {1},
|
||
pages = {93--128},
|
||
year = {2013},
|
||
publisher = {Wiley Online Library}
|
||
}
|
||
|
||
@Misc{ Skorstengaard19,
|
||
title = {An {{Introduction}} to {{Logical Relations}}},
|
||
author = {Skorstengaard, Lau},
|
||
year = {2019},
|
||
optmonth = jul,
|
||
number = {arXiv:1907.11133},
|
||
eprint = {1907.11133},
|
||
primaryclass = {cs},
|
||
publisher = {{arXiv}},
|
||
doi = {10.48550/arXiv.1907.11133},
|
||
archiveprefix = {arxiv}
|
||
}
|
||
|
||
@InProceedings{ SkorstengaardDevrieseEtAl18,
|
||
author = {Lau Skorstengaard and Dominique Devriese and Lars
|
||
Birkedal},
|
||
title = {Reasoning About a Machine with Local Capabilities -
|
||
Provably Safe Stack and Return Pointer Management},
|
||
booktitle = {Programming Languages and Systems - 27th European
|
||
Symposium on Programming, {ESOP} 2018, Held as Part of the
|
||
European Joint Conferences on Theory and Practice of
|
||
Software, {ETAPS} 2018, Thessaloniki, Greece, April 14-20,
|
||
2018, Proceedings},
|
||
pages = {475--501},
|
||
year = {2018},
|
||
url = {https://doi.org/10.1007/978-3-319-89884-1\_17},
|
||
doi = {10.1007/978-3-319-89884-1\_17},
|
||
timestamp = {Tue, 14 May 2019 10:00:41 +0200}
|
||
}
|
||
|
||
@Article{ SkorstengaardDevrieseEtAl19,
|
||
author = {Skorstengaard, Lau and Devriese, Dominique and Birkedal,
|
||
Lars},
|
||
title = {StkTokens: Enforcing Well-bracketed Control Flow and Stack
|
||
Encapsulation Using Linear Capabilities},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
issue_date = {January 2019},
|
||
volume = {3},
|
||
number = {POPL},
|
||
month = jan,
|
||
year = {2019},
|
||
pages = {19:1--19:28},
|
||
articleno = {19},
|
||
numpages = {28},
|
||
url = {http://doi.acm.org/10.1145/3290332},
|
||
doi = {10.1145/3290332},
|
||
acmid = {3290332},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ SongLettnerEtAl18,
|
||
author = {Dokyung Song and Julian Lettner and Prabhu Rajasekaran and
|
||
Yeoul Na and Stijn Volckaert and Per Larsen and Michael
|
||
Franz},
|
||
title = {SoK: Sanitizing for Security},
|
||
journal = {CoRR},
|
||
volume = {abs/1806.04355},
|
||
year = {2018},
|
||
url = {http://arxiv.org/abs/1806.04355},
|
||
archiveprefix = {arXiv},
|
||
eprint = {1806.04355},
|
||
timestamp = {Mon, 13 Aug 2018 16:47:37 +0200}
|
||
}
|
||
|
||
@Article{ SpiesKrishnaswamiEtAl21,
|
||
author = {Spies, Simon and Krishnaswami, Neel and Dreyer, Derek},
|
||
title = {Transfinite step-indexing for termination},
|
||
year = {2021},
|
||
publisher = {Association for Computing Machinery},
|
||
address = {New York, NY, USA},
|
||
volume = {5},
|
||
number = {POPL},
|
||
doi = {10.1145/3434294},
|
||
month = {jan},
|
||
articleno = {13},
|
||
numpages = {29}
|
||
}
|
||
|
||
@Article{ Statman85,
|
||
author = {Richard Statman},
|
||
title = {Logical Relations and the Typed lambda-Calculus},
|
||
journal = {Inf. Control.},
|
||
volume = {65},
|
||
number = {2/3},
|
||
pages = {85--97},
|
||
year = {1985},
|
||
doi = {10.1016/S0019-9958(85)80001-2},
|
||
timestamp = {Mon, 18 May 2020 17:45:27 +0200}
|
||
}
|
||
|
||
@TechReport{ Staton07,
|
||
author = {Staton, Sam},
|
||
title = {{Name-passing process calculi: operational models and
|
||
structural operational semantics}},
|
||
year = 2007,
|
||
month = jun,
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-688.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
doi = {10.48456/tr-688},
|
||
number = {UCAM-CL-TR-688}
|
||
}
|
||
|
||
@InProceedings{ Staton09,
|
||
author = {Sam Staton},
|
||
editor = {Alexander Kurz and Marina Lenisa and Andrzej Tarlecki},
|
||
title = {Relating Coalgebraic Notions of Bisimulation},
|
||
booktitle = {Proc.~3rd International Conference on Algebra and
|
||
Coalgebra in Computer Science, CALCO'09},
|
||
series = lncs,
|
||
volume = {5728},
|
||
pages = {191--205},
|
||
publisher = {Springer},
|
||
year = {2009}
|
||
}
|
||
|
||
@Article{ Staton11,
|
||
author = {Sam Staton},
|
||
title = {Relating coalgebraic notions of bisimulation},
|
||
journal = {Log. Methods Comput. Sci.},
|
||
volume = {7},
|
||
number = {1},
|
||
year = {2011},
|
||
url = {https://doi.org/10.2168/LMCS-7(1:13)2011},
|
||
doi = {10.2168/LMCS-7(1:13)2011},
|
||
timestamp = {Thu, 25 Jun 2020 21:29:07 +0200}
|
||
}
|
||
|
||
@InCollection{ StrackxNoormanEtAl13,
|
||
title = {Protected software module architectures},
|
||
author = {Strackx, Raoul and Noorman, Job and Verbauwhede, Ingrid
|
||
and Preneel, Bart and Piessens, Frank},
|
||
booktitle = {ISSE 2013 Securing Electronic Business Processes},
|
||
pages = {241--251},
|
||
year = {2013},
|
||
publisher = {Springer}
|
||
}
|
||
|
||
@Article{ SuhLeeEtAl04,
|
||
author = {Suh, G. Edward and Lee, Jae W. and Zhang, David and
|
||
Devadas, Srinivas},
|
||
title = {Secure Program Execution via Dynamic Information Flow
|
||
Tracking},
|
||
journal = {SIGARCH Comput. Archit. News},
|
||
issue_date = {December 2004},
|
||
volume = {32},
|
||
number = {5},
|
||
month = oct,
|
||
year = {2004},
|
||
pages = {85--96},
|
||
numpages = {12},
|
||
url = {http://doi.acm.org/10.1145/1037947.1024404},
|
||
doi = {10.1145/1037947.1024404},
|
||
acmid = {1024404},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ SzekeresPayerEtAl13,
|
||
author = {Laszlo Szekeres and Mathias Payer and Tao Wei and Dawn
|
||
Song},
|
||
title = {SoK: Eternal War in Memory},
|
||
booktitle = {2013 {IEEE} Symposium on Security and Privacy, {SP} 2013,
|
||
Berkeley, CA, USA, May 19-22, 2013},
|
||
pages = {48--62},
|
||
year = {2013},
|
||
url = {https://doi.org/10.1109/SP.2013.13},
|
||
doi = {10.1109/SP.2013.13},
|
||
timestamp = {Fri, 26 May 2017 00:50:06 +0200}
|
||
}
|
||
|
||
@Article{ Tait67,
|
||
title = {Intensional interpretations of functionals of finite type
|
||
{I}},
|
||
author = {Tait, William W},
|
||
journal = {J.\ Symbolic Log.},
|
||
volume = {32},
|
||
number = {2},
|
||
pages = {198--212},
|
||
year = {1967},
|
||
nopublisher = {JSTOR}
|
||
}
|
||
|
||
@InProceedings{ TimanyStefanescoEtAl17,
|
||
author = {Timany, Amin and Stefanesco, L\'{e}o and Krogh-Jespersen,
|
||
Morten and Birkedal, Lars},
|
||
title = {A Logical Relation for Monadic Encapsulation of State:
|
||
Proving Contextual Equivalences in the Presence of RunST},
|
||
booktitle = {44th ACM SIGPLAN Symposium on Principles of Programming
|
||
Languages (POPL 2017)},
|
||
year = {2017},
|
||
issue_date = {January 2018},
|
||
publisher = acm,
|
||
optaddress = {New York, NY, USA},
|
||
volume = {2},
|
||
optnumber = {POPL},
|
||
doi = {10.1145/3158152},
|
||
series = {Proc. ACM Program. Lang.},
|
||
optmonth = {Dec},
|
||
articleno = {64},
|
||
numpages = {28}
|
||
}
|
||
|
||
@InProceedings{ TsampasDevrieseEtAl19,
|
||
author = {Stelios Tsampas and Dominique Devriese and Frank
|
||
Piessens},
|
||
title = {Temporal Safety for Stack Allocated Memory on Capability
|
||
Machines},
|
||
booktitle = {32nd {IEEE} Computer Security Foundations Symposium, {CSF}
|
||
2019, Hoboken, NJ, USA, June 25-28, 2019},
|
||
pages = {243--255},
|
||
year = {2019},
|
||
url = {https://doi.org/10.1109/CSF.2019.00024},
|
||
doi = {10.1109/CSF.2019.00024},
|
||
timestamp = {Fri, 13 Sep 2019 12:41:32 +0200}
|
||
}
|
||
|
||
@InProceedings{ TsampasEl-KorashyEtAl17,
|
||
title = {Towards automatic compartmentalization of C programs on
|
||
capability machines},
|
||
author = {Tsampas, Stylianos and El-Korashy, Akram and Patrignani,
|
||
Marco and Devriese, Dominique and Garg, Deepak and
|
||
Piessens, Frank},
|
||
booktitle = {Workshop on Foundations of Computer Security 2017},
|
||
pages = {1--14},
|
||
year = {2017}
|
||
}
|
||
|
||
@InProceedings{ TsampasNuytsEtAl20,
|
||
author = {Stelios Tsampas and Andreas Nuyts and Dominique Devriese
|
||
and Frank Piessens},
|
||
editor = {Daniela Petrisan and Jurriaan Rot},
|
||
title = {A Categorical Approach to Secure Compilation},
|
||
booktitle = {15th {IFIP} {WG} 1.3 International Workshop on Coalgebraic
|
||
Methods in Computer Science, CMCS'20},
|
||
series = lncs,
|
||
volume = {12094},
|
||
pages = {155--179},
|
||
publisher = {Springer},
|
||
year = {2020},
|
||
url = {https://doi.org/10.1007/978-3-030-57201-3\_9},
|
||
doi = {10.1007/978-3-030-57201-3\_9},
|
||
timestamp = {Wed, 26 Aug 2020 11:05:40 +0200}
|
||
}
|
||
|
||
@InProceedings{ TsampasWilliamsEtAl21,
|
||
author = {Stelios Tsampas and Christian Williams and Andreas Nuyts
|
||
and Dominique Devriese and Frank Piessens},
|
||
editor = {Filippo Bonchi and Simon J. Puglisi},
|
||
title = {Abstract Congruence Criteria for Weak Bisimilarity},
|
||
booktitle = {46th International Symposium on Mathematical Foundations
|
||
of Computer Science, MFCS'21},
|
||
series = {LIPIcs},
|
||
volume = {202},
|
||
pages = {88:1--88:23},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2021},
|
||
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.88},
|
||
doi = {10.4230/LIPIcs.MFCS.2021.88},
|
||
timestamp = {Wed, 25 Aug 2021 17:11:18 +0200}
|
||
}
|
||
|
||
@InProceedings{ Turi97,
|
||
author = {Daniele Turi},
|
||
title = {Categorical Modelling of Structural Operational Rules:
|
||
Case Studies},
|
||
booktitle = {Category Theory and Computer Science, 7th International
|
||
Conference, {CTCS} '97, Santa Margherita Ligure, Italy,
|
||
September 4-6, 1997, Proceedings},
|
||
pages = {127--146},
|
||
year = {1997},
|
||
crossref-ignore={DBLP:conf/ctcs/1997},
|
||
url = {https://doi.org/10.1007/BFb0026985},
|
||
doi = {10.1007/BFb0026985},
|
||
timestamp = {Mon, 22 May 2017 17:11:19 +0200}
|
||
}
|
||
|
||
@InProceedings{ TuriPlotkin97,
|
||
author = {Daniele Turi and Gordon D. Plotkin},
|
||
title = {Towards a Mathematical Operational Semantics},
|
||
booktitle = {12th Annual {IEEE} Symposium on Logic in Computer Science
|
||
(LICS 1997)},
|
||
pages = {280--291},
|
||
year = {1997},
|
||
crossref-ignore={DBLP:conf/lics/1997},
|
||
nodoi = {10.1109/LICS.1997.614955},
|
||
timestamp = {Thu, 25 May 2017 00:42:40 +0200}
|
||
}
|
||
|
||
@InProceedings{ TuronThamsborgEtAl13,
|
||
author = {Aaron Joseph Turon and Jacob Thamsborg and Amal Ahmed and
|
||
Lars Birkedal and Derek Dreyer},
|
||
editor = {Roberto Giacobazzi and Radhia Cousot},
|
||
title = {Logical relations for fine-grained concurrency},
|
||
booktitle = {40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles
|
||
of Programming Languages ({POPL} '13)},
|
||
pages = {343--356},
|
||
publisher = {{ACM}},
|
||
year = {2013},
|
||
doi = {10.1145/2429069.2429111}
|
||
}
|
||
|
||
@Article{ UrabeHasuo18,
|
||
author = {Natsuki Urabe and Ichiro Hasuo},
|
||
title = {Coalgebraic Infinite Traces and Kleisli Simulations},
|
||
journal = {Logical Methods in Computer Science},
|
||
volume = {14},
|
||
number = {3},
|
||
year = {2018},
|
||
url = {https://doi.org/10.23638/LMCS-14(3:15)2018},
|
||
doi = {10.23638/LMCS-14(3:15)2018},
|
||
timestamp = {Tue, 14 Jan 2020 15:49:24 +0100}
|
||
}
|
||
|
||
@Misc{ UrbatTsampasEtAl23,
|
||
title = {Weak Similarity in Higher-Order Mathematical Operational
|
||
Semantics},
|
||
author = {Henning Urbat and Stelios Tsampas and Sergey Goncharov and
|
||
Stefan Milius and Lutz Schröder},
|
||
year = {2023},
|
||
eprint = {2302.08200},
|
||
archiveprefix = {arXiv},
|
||
primaryclass = {cs.PL}
|
||
}
|
||
|
||
@Article{ Uustalu13,
|
||
title = "Coinductive big-step semantics for concurrency",
|
||
author = "Tarmo Uustalu",
|
||
year = "2013",
|
||
volume = "137",
|
||
pages = "63--78",
|
||
journal = "Electronic Proceedings in Theoretical Computer Science,
|
||
EPTCS",
|
||
publisher = "Open Publishing Association"
|
||
}
|
||
|
||
@InProceedings{ Van-BulckNoormanEtAl16,
|
||
author = {Van Bulck, Jo and Noorman, Job and M\"{u}hlberg, Jan
|
||
Tobias and Piessens, Frank},
|
||
title = {Towards Availability and Real-time Guarantees for
|
||
Protected Module Architectures},
|
||
booktitle = {Companion Proceedings of the 15th International Conference
|
||
on Modularity},
|
||
series = {MODULARITY Companion 2016},
|
||
year = {2016},
|
||
pages = {146--151},
|
||
numpages = {6},
|
||
url = {http://doi.acm.org/10.1145/2892664.2892693},
|
||
doi = {10.1145/2892664.2892693},
|
||
acmid = {2892693},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Van-StrydonckPiessensEtAl19,
|
||
timestamp = {2019-08-05T13:26:42Z},
|
||
title = {Linear Capabilities for Fully Abstract Compilation of
|
||
Separation-Logic-Verified Code},
|
||
volume = {ICFP},
|
||
journal = {Proc. ACM Program. Lang.},
|
||
author = {Van Strydonck, Thomas and Piessens, Frank and Devriese,
|
||
Dominique},
|
||
year = {2019},
|
||
note = {accepted}
|
||
}
|
||
|
||
@Proceedings{ VitekJensen99,
|
||
editor = {Jan Vitek and Christian Damsgaard Jensen},
|
||
title = {Secure Internet Programming, Security Issues for Mobile
|
||
and Distributed Objects},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1603},
|
||
publisher = {Springer},
|
||
year = {1999},
|
||
url = {https://doi.org/10.1007/3-540-48749-2},
|
||
doi = {10.1007/3-540-48749-2},
|
||
timestamp = {Tue, 14 May 2019 10:00:54 +0200}
|
||
}
|
||
|
||
@Article{ VolpanoIrvineEtAl96,
|
||
title = {A sound type system for secure flow analysis},
|
||
author = {Volpano, Dennis and Irvine, Cynthia and Smith, Geoffrey},
|
||
journal = {Journal of computer security},
|
||
volume = {4},
|
||
number = {2-3},
|
||
pages = {167--187},
|
||
year = {1996},
|
||
publisher = {IOS Press}
|
||
}
|
||
|
||
@InProceedings{ Wadler93,
|
||
title = {A taste of linear logic},
|
||
author = {Wadler, Philip},
|
||
booktitle = {International Symposium on Mathematical Foundations of
|
||
Computer Science},
|
||
pages = {185--210},
|
||
year = {1993},
|
||
organization = {Springer}
|
||
}
|
||
|
||
@Book{ WadlerKokkeEtAl22,
|
||
author = {Philip Wadler and Wen Kokke and Jeremy G. Siek},
|
||
title = {Programming Language Foundations in {A}gda},
|
||
year = 2022,
|
||
month = aug,
|
||
url = {https://plfa.inf.ed.ac.uk/22.08/}
|
||
}
|
||
|
||
@InProceedings{ WagnerDean01,
|
||
title = {Intrusion detection via static analysis},
|
||
author = {Wagner, David and Dean, R},
|
||
booktitle = {Security and Privacy, 2001. S\&P 2001. Proceedings. 2001
|
||
IEEE Symposium on},
|
||
pages = {156--168},
|
||
year = {2001},
|
||
organization = {IEEE}
|
||
}
|
||
|
||
@InProceedings{ WahbeLuccoEtAl93,
|
||
author = {Wahbe, Robert and Lucco, Steven and Anderson, Thomas E.
|
||
and Graham, Susan L.},
|
||
title = {Efficient Software-based Fault Isolation},
|
||
booktitle = {Proceedings of the Fourteenth ACM Symposium on Operating
|
||
Systems Principles},
|
||
series = {SOSP '93},
|
||
year = {1993},
|
||
pages = {203--216},
|
||
numpages = {14},
|
||
url = {http://doi.acm.org/10.1145/168619.168635},
|
||
doi = {10.1145/168619.168635},
|
||
acmid = {168635},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@Article{ Wand79,
|
||
author = {Mitchell Wand},
|
||
title = {Fixed-Point Constructions in Order-Enriched Categories},
|
||
journal = {Theor. Comput. Sci.},
|
||
volume = {8},
|
||
pages = {13--30},
|
||
year = {1979},
|
||
url = {https://doi.org/10.1016/0304-3975(79)90053-7},
|
||
doi = {10.1016/0304-3975(79)90053-7},
|
||
timestamp = {Sun, 28 May 2017 13:20:04 +0200}
|
||
}
|
||
|
||
@Article{ WandCulpepperEtAl18,
|
||
author = {Mitchell Wand and Ryan Culpepper and Theophilos
|
||
Giannakopoulos and Andrew Cobb},
|
||
title = {Contextual equivalence for a probabilistic language with
|
||
continuous random variables and recursion},
|
||
journal = {Proc. {ACM} Program. Lang.},
|
||
volume = {2},
|
||
number = {{ICFP}},
|
||
pages = {87:1--87:30},
|
||
year = {2018},
|
||
doi = {10.1145/3236782},
|
||
timestamp = {Thu, 16 Apr 2020 13:51:41 +0200}
|
||
}
|
||
|
||
@Article{ Watanabe02,
|
||
author = {Hiroshi Watanabe},
|
||
title = {Well-behaved Translations between Structural Operational
|
||
Semantics},
|
||
journal = {Electr. Notes Theor. Comput. Sci.},
|
||
volume = {65},
|
||
number = {1},
|
||
pages = {337--357},
|
||
year = {2002},
|
||
url = {https://doi.org/10.1016/S1571-0661(04)80372-4},
|
||
doi = {10.1016/S1571-0661(04)80372-4},
|
||
timestamp = {Sun, 28 May 2017 13:22:54 +0200}
|
||
}
|
||
|
||
@InProceedings{ WatsonNeumannEtAl12,
|
||
title = {CHERI: a research platform deconflating hardware
|
||
virtualization and protection},
|
||
author = {Watson, Robert NM and Neumann, Peter G and Woodruff,
|
||
Jonathan and Anderson, Jonathan and Anderson, Ross and
|
||
Dave, Nirav and Laurie, Ben and Moore, Simon W and Murdoch,
|
||
Steven J and Paeps, Philip and others},
|
||
booktitle = {Workshop paper, Runtime Environments, Systems, Layering
|
||
and Virtualized Environments (RESoLVE 2012)},
|
||
year = {2012}
|
||
}
|
||
|
||
@TechReport{ WatsonNeumannEtAl16,
|
||
author = {Robert N. M. Watson and Peter G. Neumann and Jonathan
|
||
Woodruff and Michael Roe and Jonathan Anderson and John
|
||
Baldwin and David Chisnall and Brooks Davis and Alexandre
|
||
Joannou and Ben Laurie and Simon W. Moore and Steven J.
|
||
Murdoch and Robert Norton and Stacey Son and Hongyan Xia},
|
||
title = {{Capability Hardware Enhanced RISC Instructions: CHERI
|
||
Instruction-Set Architecture (Version 6)}},
|
||
year = 2016,
|
||
month = june,
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-891.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-891}
|
||
}
|
||
|
||
@InCollection{ WatsonNeumannEtAl17,
|
||
title = {Balancing Disruption and Deployability in the CHERI
|
||
Instruction-Set Architecture (ISA)},
|
||
author = {Watson, Robert Nicholas and Neumann, Peter G and Moore,
|
||
Simon W},
|
||
year = {2017}
|
||
}
|
||
|
||
@TechReport{ WatsonNeumannEtAl17a,
|
||
title = {Capability hardware enhanced risc instructions: Cheri
|
||
instruction-set architecture (version 6)},
|
||
author = {Watson, Robert NM and Neumann, Peter G and Woodruff,
|
||
Jonathan and Roe, Michael and Anderson, Jonathan and
|
||
Baldwin, John and Chisnall, David and Davis, Brooks and
|
||
Joannou, Alexandre and Laurie, Ben and Moore, Simon W and
|
||
others},
|
||
year = {2017},
|
||
institution = {University of Cambridge, Computer Laboratory}
|
||
}
|
||
|
||
@TechReport{ WatsonNeumannEtAl19,
|
||
author = {Robert N. M. Watson and Peter G. Neumann and Jonathan
|
||
Woodruff and Michael Roe and Hesham Almatary and Jonathan
|
||
Anderson and John Baldwin and David Chisnall and Brooks
|
||
Davis and Nathaniel Wesley Filardo and Alexandre Joannou
|
||
and Ben Laurie and A. Theodore Markettos and Simon W. Moore
|
||
and Steven J. Murdoch and Kyndylan Nienhuis and Robert
|
||
Norton and Alex Richardson and Peter Rugg and Peter Sewell
|
||
and Stacey Son and Hongyan Xia},
|
||
title = {{Capability Hardware Enhanced RISC Instructions: CHERI
|
||
Instruction-Set Architecture (Version 7)}},
|
||
year = 2019,
|
||
month = june,
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-927.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-927}
|
||
}
|
||
|
||
@Article{ WatsonNortonEtAl16,
|
||
author = {R. N. M. Watson and R. M. Norton and J. Woodruff and S. W.
|
||
Moore and P. G. Neumann and J. Anderson and D. Chisnall and
|
||
B. Davis and B. Laurie and M. Roe and N. H. Dave and K.
|
||
Gudka and A. Joannou and A. T. Markettos and E. Maste and
|
||
S. J. Murdoch and C. Rothwell and S. D. Son and M. Vadera},
|
||
journal = {IEEE Micro},
|
||
title = {Fast Protection-Domain Crossing in the CHERI
|
||
Capability-System Architecture},
|
||
year = {2016},
|
||
volume = {36},
|
||
number = {5},
|
||
pages = {38-49},
|
||
doi = {10.1109/MM.2016.84},
|
||
month = {Sept}
|
||
}
|
||
|
||
@Article{ WatsonRichardsonEtAl20,
|
||
title = {CHERI C/C++ Programming Guide},
|
||
author = {Watson, Robert NM and Richardson, Alexander and Davis,
|
||
Brooks and Baldwin, John and Chisnall, David and Clarke,
|
||
Jessica and Filardo, Nathaniel and Moore, Simon W and
|
||
Napierala, Edward and Sewell, Peter and others},
|
||
year = {2020}
|
||
}
|
||
|
||
@InProceedings{ WatsonWoodruffEtAl15,
|
||
author = {Robert N. M. Watson and Jonathan Woodruff and Peter G.
|
||
Neumann and Simon W. Moore and Jonathan Anderson and David
|
||
Chisnall and Nirav H. Dave and Brooks Davis and Khilan
|
||
Gudka and Ben Laurie and Steven J. Murdoch and Robert M.
|
||
Norton and Michael Roe and Stacey D. Son and Munraj
|
||
Vadera},
|
||
title = {{CHERI:} {A} Hybrid Capability-System Architecture for
|
||
Scalable Software Compartmentalization},
|
||
booktitle = {2015 {IEEE} Symposium on Security and Privacy, {SP} 2015,
|
||
San Jose, CA, USA, May 17-21, 2015},
|
||
pages = {20--37},
|
||
year = {2015},
|
||
url = {https://doi.org/10.1109/SP.2015.9},
|
||
doi = {10.1109/SP.2015.9},
|
||
timestamp = {Sun, 07 Apr 2019 19:06:16 +0200}
|
||
}
|
||
|
||
@Article{ WattRennerEtAl19,
|
||
title = {CT-wasm: type-driven secure cryptography for the web
|
||
ecosystem},
|
||
author = {Watt, Conrad and Renner, John and Popescu, Natalie and
|
||
Cauligi, Sunjay and Stefan, Deian},
|
||
journal = {Proceedings of the ACM on Programming Languages},
|
||
volume = {3},
|
||
number = {POPL},
|
||
pages = {77},
|
||
year = {2019},
|
||
publisher = {ACM}
|
||
}
|
||
|
||
@InProceedings{ WilanderKamkar03,
|
||
title = {A Comparison of Publicly Available Tools for Dynamic
|
||
Buffer Overflow Prevention.},
|
||
author = {Wilander, John and Kamkar, Mariam},
|
||
booktitle = {NDSS},
|
||
volume = {3},
|
||
pages = {149--162},
|
||
year = {2003}
|
||
}
|
||
|
||
@Book{ Winskel93,
|
||
title = {The formal semantics of programming languages: an
|
||
introduction},
|
||
author = {Winskel, Glynn},
|
||
year = {1993},
|
||
publisher = {MIT press}
|
||
}
|
||
|
||
@Article{ WinskelNielsen93,
|
||
title = {Models for Concurrency},
|
||
volume = {22},
|
||
url = {https://tidsskrift.dk/daimipb/article/view/6936},
|
||
doi = {10.7146/dpb.v22i463.6936},
|
||
number = {463},
|
||
journal = {DAIMI Report Series},
|
||
author = {Winskel, Glynn and Nielsen, Mogens},
|
||
year = {1993},
|
||
month = {Nov.}
|
||
}
|
||
|
||
@InProceedings{ Winter12,
|
||
author = {Johannes Winter},
|
||
editor = {Geyong Min and Yulei Wu and Lei (Chris) Liu and Xiaolong
|
||
Jin and Stephen A. Jarvis and Ahmed Yassin Al{-}Dubai},
|
||
title = {Experimenting with {ARM} TrustZone - Or: How {I} Met
|
||
Friendly Piece of Trusted Hardware},
|
||
booktitle = {11th {IEEE} International Conference on Trust, Security
|
||
and Privacy in Computing and Communications, TrustCom 2012,
|
||
Liverpool, United Kingdom, June 25-27, 2012},
|
||
pages = {1161--1166},
|
||
publisher = {{IEEE} Computer Society},
|
||
year = {2012},
|
||
url = {https://doi.org/10.1109/TrustCom.2012.157},
|
||
doi = {10.1109/TrustCom.2012.157},
|
||
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}
|
||
}
|
||
|
||
@TechReport{ Woodruff14,
|
||
author = {Woodruff, Jonathan D.},
|
||
title = {{CHERI: A RISC capability machine for practical memory
|
||
safety}},
|
||
year = 2014,
|
||
month = jul,
|
||
url = {http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-858.pdf},
|
||
institution = {University of Cambridge, Computer Laboratory},
|
||
number = {UCAM-CL-TR-858}
|
||
}
|
||
|
||
@Article{ WoodruffJoannouEtAl19,
|
||
author = {J. {Woodruff} and A. {Joannou} and H. {Xia} and B. {Davis}
|
||
and P. G. {Neumann} and R. N. M. {Watson} and S. {Moore}
|
||
and A. {Fox} and R. {Norton} and D. {Chisnall} and A.
|
||
{Fox}},
|
||
journal = {IEEE Transactions on Computers},
|
||
title = {CHERI Concentrate: Practical Compressed Capabilities},
|
||
year = {2019},
|
||
volume = {},
|
||
number = {},
|
||
doi = {10.1109/TC.2019.2914037},
|
||
month = {}
|
||
}
|
||
|
||
@InProceedings{ WoodruffWatsonEtAl14,
|
||
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},
|
||
title = {The CHERI Capability Model: Revisiting RISC in an Age of
|
||
Risk},
|
||
booktitle = {Proceeding of the 41st Annual International Symposium on
|
||
Computer Architecuture},
|
||
series = {ISCA '14},
|
||
year = {2014},
|
||
pages = {457--468},
|
||
numpages = {12},
|
||
url = {http://dl.acm.org/citation.cfm?id=2665671.2665740},
|
||
acmid = {2665740},
|
||
publisher = {IEEE Press},
|
||
address = {Piscataway, NJ, USA}
|
||
}
|
||
|
||
@Article{ Worrell05,
|
||
title = {On the final sequence of a finitary set functor},
|
||
journal = {Theoretical Computer Science},
|
||
volume = 338,
|
||
number = 1,
|
||
pages = {184-199},
|
||
year = 2005,
|
||
doi = {https://doi.org/10.1016/j.tcs.2004.12.009},
|
||
author = {James Worrell}
|
||
}
|
||
|
||
@Article{ WulfCohenEtAl74,
|
||
author = {Wulf, W. and Cohen, E. and Corwin, W. and Jones, A. and
|
||
Levin, R. and Pierson, C. and Pollack, F.},
|
||
title = {HYDRA: The Kernel of a Multiprocessor Operating System},
|
||
journal = {Commun. ACM},
|
||
issue_date = {June 1974},
|
||
volume = {17},
|
||
number = {6},
|
||
month = jun,
|
||
year = {1974},
|
||
pages = {337--345},
|
||
numpages = {9},
|
||
url = {http://doi.acm.org/10.1145/355616.364017},
|
||
doi = {10.1145/355616.364017},
|
||
acmid = {364017},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA}
|
||
}
|
||
|
||
@InProceedings{ XiaWoodruffEtAl19,
|
||
title = {CHERIvoke: Characterising Pointer Revocation using CHERI
|
||
Capabilities for Temporal Memory Safety},
|
||
author = {Xia, Hongyan and Woodruff, Jonathan and Ainsworth, Sam and
|
||
Filardo, Nathaniel W and Roe, Michael and Richardson,
|
||
Alexander and Rugg, Peter and Neumann, Peter G and Moore,
|
||
Simon W and Watson, Robert NM and others},
|
||
booktitle = {Proceedings of the 52nd Annual IEEE/ACM International
|
||
Symposium on Microarchitecture},
|
||
pages = {545--557},
|
||
year = {2019}
|
||
}
|
||
|
||
@InProceedings{ YamadaDubut19,
|
||
author = {Akihisa Yamada and J{\'{e}}r{\'{e}}my Dubut},
|
||
editor = {John Harrison and John O'Leary and Andrew Tolmach},
|
||
title = {Complete Non-Orders and Fixed Points},
|
||
booktitle = {10th International Conference on Interactive Theorem
|
||
Proving, {ITP} 2019, September 9-12, 2019, Portland, OR,
|
||
{USA}},
|
||
series = {LIPIcs},
|
||
volume = {141},
|
||
pages = {30:1--30:16},
|
||
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
|
||
year = {2019},
|
||
url = {https://doi.org/10.4230/LIPIcs.ITP.2019.30},
|
||
doi = {10.4230/LIPIcs.ITP.2019.30},
|
||
timestamp = {Sat, 05 Sep 2020 18:04:33 +0200}
|
||
}
|
||
|
||
@article{Dubut25,
|
||
title={Aczel-mendler bisimulations in a regular category},
|
||
author={Dubut, J{\'e}r{\'e}my},
|
||
journal={Logical Methods in Computer Science},
|
||
volume={21},
|
||
year={2025},
|
||
publisher={Episciences. org}
|
||
}
|
||
|