City Research Online

Items where City Author is "Hunt, Sebastian"

Up a level
Group by: Type | No Grouping
Number of items: 14.


Hunt, S. ORCID: 0000-0001-7255-4465, Sands, D. & Stucki, S. (2023). Reconciling Shannon and Scott with a Lattice of Computable Information. Proceedings of the ACM on Programming Languages, 7, pp. 1987-2016. doi: 10.1145/3571740

Van Delft, B., Hunt, S. & Sands, D. (2015). Very static enforcement of dynamic policies. Lecture Notes in Computer Science, 9036, pp. 32-52. doi: 10.1007/978-3-662-46666-7_3

Del Tedesco, F., Hunt, S. & Sands, D. (2011). A semantic hierarchy for erasure policies. Lecture Notes in Computer Science, 7093 L, pp. 352-369. doi: 10.1007/978-3-642-25560-1_24

Hunt, S., Clark, D. & Malacaria, P. (2007). A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security, 15(3), pp. 321-371.

Clark, D., Hunt, S. & Malacaria, P. (2005). Quantified Interference for a While Language. Electronic Notes in Theoretical Computer Science, 112(SPEC), pp. 149-166. doi: 10.1016/j.entcs.2004.01.018

Hunt, S., Clark, D. & Malacaria, P. (2002). Quantitative analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science, 59(3), pp. 1-14. doi: 10.1016/S1571-0661(04)00290-7

Book Section

Hunt, S. & Sands, D. (2020). New Program Abstractions for Privacy. In: Di Pierro, A., Malacaria, A. & Nagarajan, P. (Eds.), From Lambda Calculus to Cybersecurity Through Program Analysis. . Springer. doi: 10.1007/978-3-030-41103-9_10

Conference or Workshop Item

Hunt, S. ORCID: 0000-0001-7255-4465 & Sands, D. (2021). A Quantale of Information. 2021 IEEE 34th Computer Security Foundations Symposium (CSF), 1, pp. 358-372. ISSN 2374-8303 doi: 10.1109/CSF51468.2021.00031

Hunt, S. & Sands, D. (2011). From exponential to polynomial-time security typing via principal types. Lecture Notes in Computer Science, 6602 L, pp. 297-316. ISSN 0302-9743

Hunt, S. & Sands, D. (2008). Just forget it - The semantics and enforcement of information erasure. Lecture Notes in Computer Science, 4960, pp. 239-253. ISSN 0302-9743

Hunt, S. & Clark, D. (2008). Non-interference for deterministic interactive programs. Paper presented at the 5th International Workshop on Formal Aspects in Security and Trust (FAST2008), Oct 2008, Malaga, Spain.

Hunt, S., Askarov, A., Sabelfeld, A. & Sands, D. (2008). Termination-insensitive noninterference leaks more than just a bit. Paper presented at the 13th European Symposium on Research in Computer Security, Oct 2008, Malaga, Spain.

Hunt, S. & Sands, D. (2006). On flow-sensitive security types. ACM SIGPLAN-SIGACT, 41, pp. 79-90. ISSN 0362-1340

Hunt, S. & Mastroeni, I. (2005). The PER model of abstract non-interference. In: Hankin, C. & Siveroni, I. (Eds.), Static Analysis. SAS 2005. Lecture Notes in Computer Science. (pp. 171-185). Berlin: Springer. ISBN 978-3-540-28584-7 doi: 10.1007/11547662_13

This list was generated on Fri Dec 1 02:53:11 2023 UTC.