Dr Sebastian Hunt
- Dr Sebastian Hunt
- +44 (0)20 7040 8440
Sebastian is a senior lecturer at City University London. His research lies within the area of Software and Systems Engineering. Following a first degree in physics & philosophy at the University of Bristol, he worked for a short time as a programmer before going on to study for an MSc in Computing at Imperial College, graduating with Distinction in 1986. He went on to work as a Research Assistant at Imperial while studying part time for his PhD, which he obtained in 1991. He joined City as a lecturer in 1992. His research is focussed on developing semantics and enforcement mechanisms for security policies dealing with information flow.
PhD Computing, Imperial College London, 1991
MSc Computing, Imperial College London, 1986
BSc (Hons) Physics and Philosophy, University of Bristol, 1983
2005 - present City University London, Senior Lecturer
1992 - 2005 City University London, Lecturer
1986 - 1992 Imperial College London, Research Assistant
1984 - 1985 City Express, London, Programmer
Membership of professional bodies
03/2011 British Computer Society, Educational Affiliate Employee
Programme Committee 14th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI 2013)
Programme Committee 8th International Conference on Information Systems Security (ICISS 2012)
- Hunt, S. and Sands, D. (2011). From exponential to polynomial-time security typing via principal types. European Symposium on Programming 26 Mar 2011 – 3 Apr 2011, Saarbrücken, Germany.
- Hunt, S., Askarov, A., Sabelfeld, A. and Sands, D. (2008). Termination-insensitive noninterference leaks more than just a bit. 13th European Symposium on Research in Computer Security October, Malaga, Spain.
- Hunt, S. and Clark, D. (2008). Non-interference for deterministic interactive programs. 5th International Workshop on Formal Aspects in Security and Trust (FAST2008) October, Malaga, Spain.
- Hunt, S. and Sands, D. (2008). Just forget it - The semantics and enforcement of information erasure. European Symposium on Programming 29 Mar 2008 – 6 Apr 2008, Budapest, Hungary.
- Hunt, S. and Sands, D. (2006). On flow-sensitive security types. Principles of Programming Languages 11-13 January, Charleston, South Carolina, USA.
- Hunt, S. and Mastroeni, I. (2005). The PER model of abstract non-interference. .
- Clark, D., Hankin, C. and Hunt, S. (2000). Safety of strictness analysis via term graph rewriting. .
- Hunt, S., Jampel, M., Jacquet, J.-.M. and Gilbert, D. (1996). Transformations between hclp and pcsp. Second International Conference on Principles and Practice of Constraint Programming August, Cambridge, Massachusetts, USA.
- Jampel, M. and Hunt, S. (1995). Composition in hierarchical CLP. .
- Hunt, S. and Hankin, C. (1992). Approximate fixed points in abstract interpretation. 4th European Symposium on Programming .
- Hunt, S. and Sands, D. (1991). Binding time analysis: a new perspective. Symposium on Partial Evaluation and Semantics-Based Program Manipulation .
- Hunt, S. (1991). Pers generalise projections for strictness analysis (extended abstract). Glasgow Workshop on Functional Programming 1990, Ullapool.
- Hunt, S. (1989). Frontiers and open sets in abstract interpretation. 4th Conference on Functional Programming Languages and Computer Architectures .
- Van Delft, B., Hunt, S. and Sands, D. (2015). Very static enforcement of dynamic policies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9036, pp. 32–52. doi:10.1007/978-3-662-46666-7_3.
- Del Tedesco, F., Hunt, S. and Sands, D. (2011). A semantic hierarchy for erasure policies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7093 LNCS, pp. 352–369. doi:10.1007/978-3-642-25560-1_24.
- Hunt, S., Clark, D. and 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. and Malacaria, P. (2005). Quantitative information flow, relations and polymorphic types. J LOGIC COMPUT, 15(2), pp. 181–199. doi:10.1093/logcom/exi009.
- Clark, D., Hunt, S. and Malacaria, P. (2005). Quantified Interference for a while Language. Electronic Notes in Theoretical Computer Science, 112(SPEC. ISS.), pp. 149–166.
- Hunt, S., Clark, D. and Malacaria, P. (2002). Quantitative analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science, 59(3), pp. 1–14.
- Clark, D., Hankin, C. and Hunt, S. (2002). Information flow for Algol-like languages. COMPUT LANG SYST STR, 28(1), pp. 3–28.
- Clark, D., Hunt, S. and Malacaria, P. (2001). Quantitative Analysis of the Leakage of Confidential Data. Electr. Notes Theor. Comput. Sci., 59, pp. 238–251. doi:10.1016/S1571-0661(04)00290-7.
- Hunt, S. and Hankin, C. (1994). Approximate fixed points in abstract interpretation. Science of Computer Programming, 22(3), pp. 283–306.
- Hunt, S. and Hankin, C. (1991). Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1) .