Share This Author
Principles of Program Analysis
This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems.
A framework for security analysis of mobile wireless networks
Efficient field-sensitive pointer analysis of C
An O(v4) bound is obtained on the time needed to solve a set of constraints from this language, where v is the number of constraint variables, which gives, for the first time, some insight into the hardness of performing field-sensitive pointer analysis of C.
Decision support approaches for cyber security investment
- A. Pierro, C. Hankin, H. Wiklicky
- Computer ScienceProceedings 15th IEEE Computer Security…
- 24 June 2002
A model in which the notion of non-interference is approximated in the sense that it allows for some exactly quantified leakage of information, characterised via a notion of process similarity which replaces the indistinguishability of processes by a quantitative measure of their behavioural difference.
Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks
A method compatible with global and local criteria that enables fast multi-scale community detection on large networks and suggests that global criteria seem to be more robust to noise and thus more accurate than local criteria.
An Introduction to Lambda Calculi for Computer Scientists
- C. Hankin
- Computer Science, Education
- 2 February 2004
An introduction to lambda calculi for computer scientists is universally compatible in the manner of any devices to read in the digital library.
Strictness Analysis for Higher-Order Functions
Online cycle detection and difference propagation for pointer analysis
- David J. Pearce, P. Kelly, C. Hankin
- Computer ScienceProceedings Third IEEE International Workshop on…
- 20 October 2003
A new algorithm for online cycle detection, and a difference propagation technique which records changes in a variable's solution which reduces the execution time of interprocedural pointer analysis.
Deriving algorithms from type inference systems: application to strictness analysis
First, the notion of lazy types is introduced and it is shown how to transform a program logic into an algorithm and how to derive an efficient algorithm or strictness analysis.