On flow-sensitive security types S Hunt, D Sands ACM SIGPLAN Notices 41 (1), 79-90, 2006 | 301 | 2006 |
Termination-insensitive noninterference leaks more than just a bit A Askarov, S Hunt, A Sabelfeld, D Sands European symposium on research in computer security, 333-348, 2008 | 242 | 2008 |
A static analysis for quantifying information flow in a simple imperative language D Clark, S Hunt, P Malacaria Journal of Computer Security 15 (3), 321-371, 2007 | 233 | 2007 |
Quantitative analysis of the leakage of confidential data D Clark, S Hunt, P Malacaria Electronic Notes in Theoretical Computer Science 59 (3), 238-251, 2002 | 212 | 2002 |
Quantitative information flow, relations and polymorphic types D Clark, S Hunt, P Malacaria Journal of Logic and Computation 15 (2), 181-199, 2005 | 174 | 2005 |
Quantified interference for a while language D Clark, S Hunt, P Malacaria Electronic Notes in Theoretical Computer Science 112, 149-166, 2005 | 111 | 2005 |
Binding time analysis: A new PERspective S Hunt, D Sands Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and …, 1991 | 73 | 1991 |
Non-interference for deterministic interactive programs D Clark, S Hunt Formal Aspects in Security and Trust, 50-66, 2009 | 66 | 2009 |
Information flow for Algol-like languages D Clark, C Hankin, S Hunt Computer Languages, Systems & Structures 28 (1), 3-28, 2002 | 62 | 2002 |
Abstract interpretation of functional languages: from theory to practice S Hunt | 58 | 1991 |
Fixed points and frontiers: a new perspective S Hunt, C Hankin Journal of Functional Programming 1 (1), 91-120, 1991 | 46 | 1991 |
Just forget it–the semantics and enforcement of information erasure S Hunt, D Sands European Symposium on Programming, 239-253, 2008 | 45 | 2008 |
PERs generalise projections for strictness analysis S Hunt Functional Programming, Glasgow 1990, 114-125, 1991 | 44 | 1991 |
Very static enforcement of dynamic policies B Delft, S Hunt, D Sands International Conference on Principles of Security and Trust, 32-52, 2015 | 30 | 2015 |
Frontiers and open sets in abstract interpretation S Hunt Proceedings of the fourth international conference on Functional programming …, 1989 | 27 | 1989 |
The PER model of abstract non-interference S Hunt, I Mastroeni International Static Analysis Symposium, 171-185, 2005 | 25 | 2005 |
From exponential to polynomial-time security typing via principal types S Hunt, D Sands European Symposium on Programming, 297-316, 2011 | 21 | 2011 |
Approximate fixed points in abstract interpretation C Hankin, S Hunt European Symposium on Programming, 219-232, 1992 | 20 | 1992 |
Quantified interference: Information theory and information flow D Clark, S Hunt, P Malacaria Workshop on Issues in the Theory of Security (WITS’04), 2004 | 18 | 2004 |
A semantic hierarchy for erasure policies FD Tedesco, S Hunt, D Sands International Conference on Information Systems Security, 352-369, 2011 | 16 | 2011 |