Chris Hankin - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Probabilistic timing covert channels: to close or not to close?Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky. ijisec, 10(2):83-106, 2011. [doi]

2010

Probabilistic Aspects: Checking Security in an Imperfect WorldChris Hankin, Flemming Nielson, Hanne Riis Nielson. tgc 2010: 348-363 [doi]

Probabilistic Semantics and Program AnalysisAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. sfm 2010: 1-42 [doi]

Program Analysis Probably CountsAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. cj, 53(6):871-880, 2010. [doi]

2009

Advice from Belnap PoliciesChris Hankin, Flemming Nielson, Hanne Riis Nielson. csfw 2009: 234-247 [doi]

2008

Advice for CoordinationChris Hankin, Flemming Nielson, Hanne Riis Nielson, Fan Yang. coordination 2008: 153-168 [doi]

Quantifying Timing Leaks and Cost OptimisationAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. icics 2008: 81-96 [doi]

2007

2006

Formal Security Analysis for Ad-Hoc NetworksSebastian Nanz, Chris Hankin. ENTCS, 142:195-213, 2006. [doi]

A framework for security analysis of mobile wireless networksSebastian Nanz, Chris Hankin. TCS, 367(1-2):203-227, 2006. [doi]

Reversible combinatory logicAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. mscs, 16(4):621-637, 2006. [doi]

On Reversible Combinatory LogicAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. ENTCS, 135(3):25-35, 2006. [doi]

Abstract Interpretation for Worst and Average Case AnalysisAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. birthday 2007: 160-174 [doi]

2005

Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, ProceedingsChris Hankin, Igor Siveroni, editors, Volume 3672 of Lecture Notes in Computer Science, Springer, 2005.

lambda-calculus and Quantitative Program Analysis: (Extended Abstract)Chris Hankin, Herbert Wiklicky. ENTCS, 112:5-18, 2005. [doi]

Principles of program analysis (2. corr. print)Flemming Nielson, Hanne Riis Nielson, Chris Hankin. Springer, 2005. [doi]

Measuring the confinement of probabilistic systemsAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. TCS, 340(1):3-56, 2005. [doi]

Continuous-Time Probabilistic KLAIMAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. ENTCS, 128(5):27-38, 2005. [doi]

On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda LanguagesAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. FMCO 2006: 388-407 [doi]

Probabilistic /lambda-calculus and Quantitative Program AnalysisAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. logcom, 15(2):159-179, 2005. [doi]

Quantitative static analysis of distributed systemsAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. JFP, 15(5):703-749, 2005. [doi]

2004

2003

Online Cycle Detection and Difference Propagation for Pointer AnalysisDavid J. Pearce, Paul H. J. Kelly, Chris Hankin. SCAM 2003: 3-12 [doi]

Quantitative Relations and Approximate Process EquivalencesAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. concur 2003: 498-512 [doi]

2002

2001

Probabilistic confinement in a declarative frameworkAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. ENTCS, 48, 2001. [doi]

2000

Safety of Strictness Analysis via Term Graph RewritingDavid Clark, Chris Hankin, Sebastian Hunt. SAS 2000: 95-114

1999

Program Analysis GamesChris Hankin, Pasquale Malacaria. ACM Comput. Surv., 31(3es):5, 1999. [doi]

Non-Deterministic Games and Program Analysis: An Application to SecurityPasquale Malacaria, Chris Hankin. lics 1999: 443-452 [doi]

Principles of program analysisFlemming Nielson, Hanne Riis Nielson, Chris Hankin. Springer, 1999.

1998

Coordination Languages for Parallel ProgrammingFarhad Arbab, Paolo Ciancarini, Chris Hankin. pc, 24(7):989-1004, 1998.

Foreword: Theoretical Aspects of Coordination LanguagesRoberto Gorrieri, Chris Hankin. TCS, 192(2):163-165, 1998. [doi]

Refining Multiset TranformersChris Hankin, Daniel Le Métayer, David Sands. TCS, 192(2):233-258, 1998. [doi]

Guest Editor s ForewordChris Hankin. njc, 5(4):265-266, 1998.

Programming Languages and Systems - ESOP 98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 98, Lisbon, Portugal, March 28 - April 4, 1998, ProceedingsChris Hankin, editor, Volume 1381 of Lecture Notes in Computer Science, Springer, 1998.

Program Analysis ToolsChris Hankin. STTT, 2(1):6-12, 1998. [doi]

Generalised Flowcharts and GamesPasquale Malacaria, Chris Hankin. icalp 1998: 363-374 [doi]

A New Approach to Control Flow AnalysisPasquale Malacaria, Chris Hankin. CC 1998: 95-108

1997

Position Statements on Strategic Directions for Research on Programming LanguagesChris Hankin, Hanne Riis Nielson, Jens Palsberg. SIGPLAN, 32(1):59-65, 1997.

1996

Coordination Languages and Models, First International Conference, COORDINATION 96, Cesena, Italy, April 15-17, 1996, ProceedingsPaolo Ciancarini, Chris Hankin, editors, Volume 1061 of Lecture Notes in Computer Science, Springer, 1996.

Computing Surveys Symposium on Models of Programming Languages and CompuationChris Hankin, Hanne Riis Nielson. ACM Comput. Surv., 28(2):293-294, 1996.

Strategic Directions in Research on Programming LanguagesChris Hankin, Hanne Riis Nielson, Jens Palsberg. ACM Comput. Surv., 28(4):644-652, 1996.

1995

Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Møller Centre, Cambridge, 11-14 September 1994Chris Hankin, Ian Mackie, Rajagopal Nagarajan, editors, Imperial College Press, 1995.

Lazy Type Inference and Program AnalysisChris Hankin, Daniel Le Métayer. SCP, 25(2-3):219-249, 1995.

1994

1993

1992

Approximate Fixed Points in Abstract InterpretationChris Hankin, Sebastian Hunt. ESOP 1992: 219-232

A Calculus of Gamma ProgramsChris Hankin, Daniel Le Métayer, David Sands. lcpc 1993: 342-355

EditorialChris Hankin. logcom, 2(4):437-439, 1992.

Transformation of Gamma ProgramsChris Hankin, Daniel Le Métayer, David Sands. SAS 1992: 12-19

1991

Static Analysis of Term Graph Rewriting SystemsChris Hankin. parle 1991: 367-384

Fixed Points and Frontiers: A New PerspectiveSebastian Hunt, Chris Hankin. JFP, 1(1):91-120, 1991.

1989

Parallel Object-Oriented Descriptions of Graph Reduction Machines (extended abstract)David Bolton, Chris Hankin, Paul H. J. Kelly. parle 1989: 158-175

1988

A Safe Approach to Parallel Combinator ReductionChris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones. TCS, 56:17-36, 1988.

1987

Abstract Interpretation of Declarative LanguagesSamson Abramsky, Chris Hankin, editors, Ellis Horwood, 1987.

COBWEB-2: Structured Specification of a Wafer-Scale SupercomputerPaul Anderson, Chris Hankin, Paul H. J. Kelly, Peter Osmon, Malcolm J. Shute. parle 1987: 51-67

Finding fixed points in finite latticesChris Martin, Chris Hankin. fpca 1987: 426-445

1986

Strictness Analysis for Higher-Order FunctionsGeoffrey L. Burn, Chris Hankin, Samson Abramsky. SCP, 7(3):249-278, 1986.

A Safe Approach to Parallel Combinator Reduction (Extended Abstract)Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones. ESOP 1986: 99-110

1985

The theory of strictness analysis for higher order functionsGeoffrey L. Burn, Chris Hankin, Samson Abramsky. pdo 1986: 42-62

COBWEB - A Combinator Reduction ArchitectureChris Hankin, Peter Osmon, Malcolm J. Shute. fpca 1985: 99-112

1982

Structured Data Flow ProgrammingM. D. de Jong, Chris Hankin. SIGPLAN, 17(8):18-27, 1982. [doi]