Imperial College London

Professor Christopher Hankin Director, Institute for Security Science and Technology

Faculty of EngineeringInstitute for Security Science & Technology

Co-Director of Institute for Security Science & Technology
 
 
 
//

Contact

 

+44 (0)20 7594 7619c.hankin Website

 
 
//

Assistant

 

Ms Denise McGurk +44 (0)20 7594 8864

 
//

Location

 

Sherfield BuildingSouth Kensington Campus

//

Summary

 

Publications

Publication Type
Year
to

118 results found

Di Pierro A, Hankin C, Wiklicky H, 2010, Program Analysis Probably Counts, COMPUTER JOURNAL, Vol: 53, Pages: 871-880, ISSN: 0010-4620

JOURNAL ARTICLE

Di Pierro A, Hankin C, Wiklicky H, 2010, Probabilistic Semantics and Program Analysis, Editors: Aldini, Bernardo, Di Pierro, Wiklicky, Publisher: SPRINGER-VERLAG BERLIN, Pages: 1-+, ISBN: 978-3-642-13677-1

BOOK CHAPTER

Di Pierro A, Hankin CL, Wiklicky H, 2010, Program Analysis Probably Counts, The Computer Journal, Vol: 53, Pages: 871-880

JOURNAL ARTICLE

Hankin C, Nielson F, Nielson HR, 2010, Probabilistic Aspects: Checking Security in an Imperfect World, 5th International Symposium on Trustworthy Global Computing, Publisher: SPRINGER-VERLAG BERLIN, Pages: 348-+, ISSN: 0302-9743

CONFERENCE PAPER

Hankin C, Nielson F, Nielson HR, 2009, Advice from Belnap Policies, 22nd IEEE Computer Security Foundations Symposium, Publisher: IEEE COMPUTER SOC, Pages: 234-+

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2008, Quantifying Timing Leaks and Cost Optimisation, 10th International Conference on Information and Communications Security, Publisher: SPRINGER-VERLAG BERLIN, Pages: 81-+, ISSN: 0302-9743

CONFERENCE PAPER

Hankin C, Nielson F, Nielson HR, Yang Fet al., 2008, Advice for coordination, 10th International Conference on Coordination Models and Languages (COORDINATION 2008), Publisher: SPRINGER-VERLAG BERLIN, Pages: 153-+, ISSN: 0302-9743

CONFERENCE PAPER

Pearce DJ, Kelly PHJ, Hankin C, 2008, Efficient field-sensitive pointer analysis of C, ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, Vol: 30, ISSN: 0164-0925

JOURNAL ARTICLE

Pierro AD, Hankin C, Wiklicky H, 2008, Quantifying Timing Leaks and Cost Optimisation, CoRR, Vol: abs/0807.3879

JOURNAL ARTICLE

Di Pierro A, Hankin C, Siveroni I, Wiklicky Het al., 2007, Tempus fugit: How to plug it, JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, Vol: 72, Pages: 173-190, ISSN: 1567-8326

JOURNAL ARTICLE

Di Pierro A, Hankin C, Wiklicky H, 2007, A systematic approach to probabilistic pointer analysis, 5th Asian Symposium on Programming Languages and Systems, Publisher: SPRINGER-VERLAG BERLIN, Pages: 335-350, ISSN: 0302-9743

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2007, Abstract interpretation for worst and average case analysis, Editors: Reps, Sagiv, Bauer, Publisher: SPRINGER-VERLAG BERLIN, Pages: 160-+, ISBN: 978-3-540-71315-9

BOOK CHAPTER

Di Pierro A, Hankin C, Wiklicky H, 2007, On Probabilistic Techniques for Data Flow Analysis, Electronic Notes in Theoretical Computer Science, Vol: 190, Pages: 59-77, ISSN: 1571-0661

We present a semantics-based technique for analysing probabilistic properties of imperative programs. This consists in a probabilistic version of classical data flow analysis. We apply this technique to pWhile programs, i.e programs written in a probabilistic version of a simple While language. As a first step we introduce a syntax based definition of a linear operator semantics (LOS) which is equivalent to the standard structural operational semantics of While. The LOS of a pWhile program can be seen as the generator of a Discrete Time Markov Chain and plays a similar role as a collecting or trace semantics for classical While. Probabilistic Abstract Interpretation techniques are then employed in order to define data flow analyses for properties like Parity and Live Variables. © 2007.

JOURNAL ARTICLE

Di Pierro A, Hankin CL, Siveroni I, Wiklicky Het al., 2007, Tempus Fugit: How to Plug it, The Journal of Logic and Algebraic Programming, Vol: 72, Pages: 173-190

JOURNAL ARTICLE

Di Pierro A, Hankin CL, Wiklicky H, 2007, A Systematic Approach to Probabilistic Pointer Analysis, Asian Symposium on Programming Languages and Systems, Pages: 335-350

CONFERENCE PAPER

Pearce DJ, Kelly PHJ, Hankin CL, 2007, Efficient field-sensitive pointer analysis of C, ACM Transactions on Programming Languages and Systems, Vol: 30

JOURNAL ARTICLE

Di Pierro A, Hankin CN, Wiklicky H, 2006, On Reversible Combinatory Logic, Publisher: Elsevier, Pages: 25-35

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2006, On reversible combinatory logic, Pages: 25-35, ISSN: 1571-0661

The λ-calculus is destructive: its main computational mechanism - beta reduction - destroys the redex and makes it thus impossible to replay the computational steps. Recently, reversible computational models have been studied mainly in the context of quantum computation, as (without measurements) quantum physics is inherently reversible. However, reversibility also changes fundamentally the semantical framework in which classical computation has to be investigated. We describe an implementation of classical combinatory logic into a reversible calculus for which we present an algebraic model based on a generalisation of the notion of group. © 2006 Elsevier B.V. All rights reserved.

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2006, On a probabilistic chemical abstract machine and the expressiveness of linda languages, Pages: 388-407, ISSN: 0302-9743

The Chemical Abstract Machine (CHAM) of Berry and Boudol provides a commonly accepted, uniform framework for describing the operational semantics of various process calculi and languages, such as for example CCS, the π calculus and coordination languages like Linda. In its original form the CHAM is purely non-deterministic and thus only describes what reactions are possible but not how long it will take (in the average) before a certain reaction takes place or its probability. Such quantitative information is however often vital for "real world" applications such as systems biology or performance analysis. We propose a probabilistic version of the CHAM. We then define a linear operator semantics for the probabilistic CHAM which exploits a tensor product representation for distributions over possible solutions. Based on this we propose a novel approach towards comparing the expressive power of different calculi via their encoding in the probabilistic CHAM. We illustrate our approach by comparing the expressiveness of various Linda Languages. © Springer-Verlag Berlin Heidelberg 2006.

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2006, On a probabilistic Chemical Abstract Machine and the expressiveness of Linda languages, 4th International Symposium on Formal Methods for Components and Objects, Publisher: SPRINGER-VERLAG BERLIN, Pages: 388-407, ISSN: 0302-9743

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2006, Reversible combinatory logic, 1st International Workshop on Developments in Computational Models (DCM), Publisher: CAMBRIDGE UNIV PRESS, Pages: 621-637, ISSN: 0960-1295

CONFERENCE PAPER

Nanz S, Hankin C, 2006, Formal security analysis for ad-hoc networks, Pages: 195-213, ISSN: 1571-0661

In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can perform a variety of attacks just by not behaving according to the specification. Whilst secure versions of routing protocols are under development, little effort has been made to formalise the scenario similarly to developments in the realm of traditional security protocols for secrecy and authentication. We present a broadcast process calculus suitable to describe the behaviour of protocols which require a local memory component for every node. By adding annotations for the origin of messages, we are able to formalise a vital security property in this context, called store authorisation. Furthermore, we describe a static analysis for the detection of violations of this property. For a model of the AODV protocol in our calculus, we are then able to deduce that an attacker may introduce a routing loop in certain networks. © 2005 Elsevier B.V. All rights reserved.

CONFERENCE PAPER

Nanz S, Hankin C, 2006, A framework for security analysis of mobile wireless networks, Theor. Comp. Sci., Vol: 367, Pages: 203-227, ISSN: 0304-3975

JOURNAL ARTICLE

Wiklicky H, Di Pierro A, Hankin C, 2006, Reversible Combinatory Logic, Mathematical Structures in Computer Science, Vol: 16, Pages: 1-17

JOURNAL ARTICLE

Di Pierro A, Hankin C, Wiklicky H, 2005, Probabilistic lambda-calculus and quantitative program analysis, JOURNAL OF LOGIC AND COMPUTATION, Vol: 15, Pages: 159-179, ISSN: 0955-792X

JOURNAL ARTICLE

Di Pierro A, Hankin C, Wiklicky H, 2005, Continuous-time probabilistic KLAIM, Pages: 27-38, ISSN: 1571-0661

KLAIM, an approach to introduce probabilities into coordination languages, for the formalization towards distributed and mobile computing was discussed. The KLAIM paradigm provides a semantic framework by introducing basic concepts and primitives addressing the key aspects of coordination of interacting located processes. One of the aims of the study was the development of semantics based approach towards performance analysis along similar lines as in classical program analysis. The results show that the languages could also be extended so as to allow for a dynamic change of probabilities and rates which depend on time.

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2005, \Measuring the confinement of probabilistic systems, THEORETICAL COMPUTER SCIENCE, Vol: 340, Pages: 3-56, ISSN: 0304-3975

JOURNAL ARTICLE

Di Pierro A, Hankin C, Wiklicky H, 2005, Probabilistic Linda-based coordination languages, Berlin, 3rd International Symposium on Formal Methods for Components and Objects, 02 - 05 November 2004, Leiden, Netherlands, Publisher: Springer-Verlag, Pages: 120-140

CONFERENCE PAPER

Di Pierro A, Hankin C, Wiklicky H, 2005, Quantitative static analysis of distributed systems, Journal of Functional Programming, Vol: 15, Pages: 703-749, ISSN: 0956-7968

JOURNAL ARTICLE

Hankin CN, Wiklicky H, 2005, Lambda-calculus and quantitative program analysis, Electronic Notes in Theoretical Computer Science, Publisher: Elsevier, Pages: 5-18, ISSN: 1571-0661

CONFERENCE PAPER

This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.

Request URL: http://wlsprd.imperial.ac.uk:80/respub/WEB-INF/jsp/search-html.jsp Request URI: /respub/WEB-INF/jsp/search-html.jsp Query String: id=00002556&limit=30&person=true&page=2&respub-action=search.html