New reference

This commit is contained in:
Valentin Brandl 2019-11-19 21:18:38 +01:00
parent 65d2bc2d3a
commit 8ffcea4add
No known key found for this signature in database
GPG Key ID: 30D341DD34118D7D

View File

@ -7,6 +7,13 @@ own:
year = {2002} year = {2002}
} }
@INPROCEEDINGS{Effectiveness2014,
author={H. M. {Gisbert} and I. {Ripoll}},
booktitle={IEEE 13\textsuperscript{th} International Symposium on Network Computing and Applications},
title={On the Effectiveness of NX, SSP, RenewSSP, and ASLR against Stack Buffer Overflows},
year={2014},
}
@inproceedings{Rad2001, @inproceedings{Rad2001,
author = {Chiueh, Tzi-cker and Hsu, Fu-Hau}, author = {Chiueh, Tzi-cker and Hsu, Fu-Hau},
booktitle = {21\textsuperscript{st} International Conference on Distributed Computing Systems}, booktitle = {21\textsuperscript{st} International Conference on Distributed Computing Systems},
@ -30,15 +37,9 @@ and Harren, Matthew
and Anderson, Zachary and Anderson, Zachary
and Gay, David and Gay, David
and Necula, George C.}, and Necula, George C.},
editor={De Nicola, Rocco},
title={Dependent Types for Low-Level Programming}, title={Dependent Types for Low-Level Programming},
booktitle={Programming Languages and Systems}, booktitle={Programming Languages and Systems},
year={2007}, year={2007}
publisher={Springer Berlin Heidelberg},
address={Berlin, Heidelberg},
pages={520--535},
abstract={In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that combines dependent types and mutation for variables and for heap-allocated structures in a more flexible way than before and (2) a technique for automatically inferring dependent types for local variables. We have applied these general principles to design Deputy, a dependent type system for C that allows the user to describe bounded pointers and tagged unions. Deputy has been used to annotate and check a number of real-world C programs.},
isbn={978-3-540-71316-6}
} }
existing: existing: