Items where Author is "Hunt, S."
Article
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(POPL),
pp. 1987-2016.
doi: 10.1145/3571740
Thurman, N., Schifferes, S., Fletcher, R. , Newman, N., Hunt, S. & Schapals, A. K. (2016). Giving computers a nose for news: exploring the limits of story detection and verification. Digital Journalism, 4(7), pp. 838-848. doi: 10.1080/21670811.2016.1149436
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. doi: 10.3233/jcs-2007-15302
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.
In:
2021 IEEE 34th Computer Security Foundations Symposium (CSF).
2021 IEEE 34th Computer Security Foundations Symposium (CSF), 21-25 Jun 2021, Dubrovnik, Croatia.
doi: 10.1109/CSF51468.2021.00031
Hunt, S. & Sands, D. (2011). From exponential to polynomial-time security typing via principal types. In: Lecture Notes in Computer Science. European Symposium on Programming, 26 March 2011 - 3 Apr 2011, Saarbrücken, Germany.
Hunt, S. & Sands, D. (2008). Just forget it - The semantics and enforcement of information erasure. In: Lecture Notes in Computer Science. European Symposium on Programming, 29 Mar 2008 - 6 Apr 2008, Budapest, Hungary.
Hunt, S. & Clark, D. (2008). Non-interference for deterministic interactive programs. In: Proc. 5th International Workshop on Formal Aspects in Security and Trust. 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. In: Proc. 13th European Symposium on Research in Computer Security (ESORICS'08). 13th European Symposium on Research in Computer Security, Oct 2008, Malaga, Spain.
Hunt, S. & Sands, D. (2006). On flow-sensitive security types. In: ACM SIGPLAN-SIGACT. Principles of Programming Languages, 11 Jan 2006 - 13 Jan 2006, Charleston, South Carolina, USA.
Hunt, S. & Mastroeni, I. (2005). The PER model of abstract non-interference. In: Hankin, C. & Siveroni, I. (Eds.), Static Analysis. SAS 2005. Proc. Static Analysis, 12th International Symposium doi: 10.1007/11547662_13