Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Chris Hankin
2010 – today
- 2013
[i5]Erwan Le Martelot, Chris Hankin: Fast Multi-Scale Community Detection based on Local Criteria within a Multi-Threaded Algorithm. CoRR abs/1301.0955 (2013)- 2012
- [i4]Erwan Le Martelot, Chris Hankin: Multi-scale Community Detection using Stability Optimisation within Greedy Algorithms. CoRR abs/1201.3307 (2012)
- [i3]Fan Yang, Chris Hankin, Flemming Nielson, Hanne Riis Nielson: Secondary use of data in EHR systems. CoRR abs/1201.4262 (2012)
- [i2]Erwan Le Martelot, Chris Hankin: Fast Multi-Scale Detection of Relevant Communities. CoRR abs/1204.1002 (2012)
- 2011
- [j35]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic timing covert channels: to close or not to close? Int. J. Inf. Sec. 10(2): 83-106 (2011)
- [c42]Erwan Le Martelot, Chris Hankin: Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm. KDIR 2011: 216-225
- 2010
- [j34]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Program Analysis Probably Counts. Comput. J. 53(6): 871-880 (2010)
- [c41]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic Semantics and Program Analysis. SFM 2010: 1-42
- [c40]Chris Hankin, Flemming Nielson, Hanne Riis Nielson: Probabilistic Aspects: Checking Security in an Imperfect World. TGC 2010: 348-363
2000 – 2009
- 2009
- [c39]
- 2008
- [c38]Chris Hankin, Flemming Nielson, Hanne Riis Nielson, Fan Yang: Advice for Coordination. COORDINATION 2008: 153-168
- [c37]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantifying Timing Leaks and Cost Optimisation. ICICS 2008: 81-96
- [i1]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantifying Timing Leaks and Cost Optimisation. CoRR abs/0807.3879 (2008)
- 2007
- [j33]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On Probabilistic Techniques for Data Flow Analysis. Electr. Notes Theor. Comput. Sci. 190(3): 59-77 (2007)
- [j32]Alessandra Di Pierro, Chris Hankin, Igor Siveroni, Herbert Wiklicky: Tempus fugit: How to plug it. J. Log. Algebr. Program. 72(2): 173-190 (2007)
- [j31]David J. Pearce, Paul H. J. Kelly, Chris Hankin: Efficient field-sensitive pointer analysis of C. ACM Trans. Program. Lang. Syst. 30(1) (2007)
- [c36]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: A Systematic Approach to Probabilistic Pointer Analysis. APLAS 2007: 335-350
- 2006
- [j30]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On Reversible Combinatory Logic. Electr. Notes Theor. Comput. Sci. 135(3): 25-35 (2006)
- [j29]Sebastian Nanz, Chris Hankin: Formal Security Analysis for Ad-Hoc Networks. Electr. Notes Theor. Comput. Sci. 142: 195-213 (2006)
- [j28]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Reversible combinatory logic. Mathematical Structures in Computer Science 16(4): 621-637 (2006)
- [j27]Sebastian Nanz, Chris Hankin: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1-2): 203-227 (2006)
- [c35]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Abstract Interpretation for Worst and Average Case Analysis. Program Analysis and Compilation 2006: 160-174
- 2005
- [b2]Flemming Nielson, Hanne Riis Nielson, Chris Hankin: Principles of program analysis (2. corr. print). Springer 2005, ISBN 978-3-540-65410-0, pp. I-XXI, 1-452
- [j26]Chris Hankin, Herbert Wiklicky: lambda-calculus and Quantitative Program Analysis: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 112: 5-18 (2005)
- [j25]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Continuous-Time Probabilistic KLAIM. Electr. Notes Theor. Comput. Sci. 128(5): 27-38 (2005)
- [j24]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantitative static analysis of distributed systems. J. Funct. Program. 15(5): 703-749 (2005)
- [j23]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic /lambda-calculus and Quantitative Program Analysis. J. Log. Comput. 15(2): 159-179 (2005)
- [j22]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1): 3-56 (2005)
- [c34]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages. FMCO 2005: 388-407
- [e6]Chris Hankin, Igor Siveroni (Eds.): Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings. Lecture Notes in Computer Science 3672, Springer 2005, ISBN 3-540-28584-9
- 2004
- [j21]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Approximate Non-interference. Journal of Computer Security 12(1): 37-82 (2004)
- [j20]David J. Pearce, Paul H. J. Kelly, Chris Hankin: Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis. Software Quality Journal 12(4): 311-337 (2004)
- [c33]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic KLAIM. COORDINATION 2004: 119-134
- [c32]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic Linda-Based Coordination Languages. FMCO 2004: 120-140
- [c31]David J. Pearce, Paul H. J. Kelly, Chris Hankin: Efficient field-sensitive pointer analysis for C. PASTE 2004: 37-42
- 2003
- [c30]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantitative Relations and Approximate Process Equivalences. CONCUR 2003: 498-512
- [c29]David J. Pearce, Paul H. J. Kelly, Chris Hankin: Online Cycle Detection and Difference Propagation for Pointer Analysis. SCAM 2003: 3-12
- 2002
- [j19]David Clark, Chris Hankin, Sebastian Hunt: Information flow for Algol-like languages. Comput. Lang. 28(1): 3-28 (2002)
- [c28]Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath: Flow Analysis: Games and Nets. The Essence of Computation 2002: 135-156
- [c27]
- [c26]Alessandro Aldini, Mario Bravetti, Alessandra Di Pierro, Roberto Gorrieri, Chris Hankin, Herbert Wiklicky: Two Formal Approaches for Approximating Noninterference Properties. FOSAD 2002: 1-43
- [c25]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Analysing Approximate Confinement under Uniform Attacks. SAS 2002: 310-325
- 2001
- [j18]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic confinement in a declarative framework. Electr. Notes Theor. Comput. Sci. 48: 108-130 (2001)
- [e5]Chris Hankin, Dave Schmidt (Eds.): Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, January 17-19, 2001. ACM 2001, ISBN 1-58113-336-7
- 2000
- [c24]David Clark, Chris Hankin, Sebastian Hunt: Safety of Strictness Analysis via Term Graph Rewriting. SAS 2000: 95-114
1990 – 1999
- 1999
- [b1]Flemming Nielson, Hanne Riis Nielson, Chris Hankin: Principles of program analysis. Springer 1999, ISBN 978-3-540-65410-0, pp. I-XXI, 1-450
- [j17]
- [c23]Pasquale Malacaria, Chris Hankin: Non-Deterministic Games and Program Analysis: An Application to Security. LICS 1999: 443-452
- 1998
- [j16]
- [j15]Farhad Arbab, Paolo Ciancarini, Chris Hankin: Coordination Languages for Parallel Programming. Parallel Computing 24(7): 989-1004 (1998)
- [j14]
- [j13]Roberto Gorrieri, Chris Hankin: Foreword: Theoretical Aspects of Coordination Languages. Theor. Comput. Sci. 192(2): 163-165 (1998)
- [j12]Chris Hankin, Daniel Le Métayer, David Sands: Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998)
- [c22]
- [c21]
- [e4]Chris Hankin (Ed.): 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, Proceedings. Lecture Notes in Computer Science 1381, Springer 1998, ISBN 3-540-64302-8
- 1997
- [j11]Chris Hankin, Hanne Riis Nielson, Jens Palsberg: Position Statements on Strategic Directions for Research on Programming Languages. SIGPLAN Notices 32(1): 59-65 (1997)
- 1996
- [j10]Chris Hankin, Hanne Riis Nielson: Computing Surveys Symposium on Models of Programming Languages and Compuation. ACM Comput. Surv. 28(2): 293-294 (1996)
- [j9]Chris Hankin, Hanne Riis Nielson, Jens Palsberg: Strategic Directions in Research on Programming Languages. ACM Comput. Surv. 28(4): 644-652 (1996)
- [e3]Paolo Ciancarini, Chris Hankin (Eds.): Coordination Languages and Models, First International Conference, COORDINATION '96, Cesena, Italy, April 15-17, 1996, Proceedings. Lecture Notes in Computer Science 1061, Springer 1996, ISBN 3-540-61052-9
- 1995
- [j8]Chris Hankin, Daniel Le Métayer: Lazy Type Inference and Program Analysis. Sci. Comput. Program. 25(2-3): 219-249 (1995)
- [e2]Chris Hankin, Ian Mackie, Rajagopal Nagarajan (Eds.): Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Møller Centre, Cambridge, 11-14 September 1994. Imperial College Press 1995, ISBN 1-86094-003-X
- 1994
- [j7]Chris Hankin, Sebastian Hunt: Approximate Fixed Points in Abstract Interpretation. Sci. Comput. Program. 22(3): 283-306 (1994)
- [c20]Chris Hankin, Daniel Le Métayer: Lazy Type Inference for the Strictness Analysis of Lists. ESOP 1994: 257-271
- [c19]David Clark, Lindsay Errington, Chris Hankin: Static Analysis of Value-Passing Process Calculi. Theory and Formal Methods 1994: 307-320
- [c18]
- [c17]Chris Hankin, Daniel Le Métayer: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. POPL 1994: 202-212
- [c16]
- 1993
- [j6]
- [c15]Chris Hankin: Graph Rewriting Systems and Abstract Interpretation. Theory and Formal Methods 1993: 27-36
- [c14]Lindsay Errington, Chris Hankin, Thomas P. Jensen: Reasoning About Gamma Programs. Theory and Formal Methods 1993: 115-125
- [c13]Chris Hankin, Daniel Le Métayer, David Sands: A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378
- [c12]
- [c11]Lindsay Errington, Chris Hankin, Thomas P. Jensen: A Congruence for Gamma Programs. WSA 1993: 242-253
- 1992
- [j5]
- [c10]Chris Hankin, Sebastian Hunt: Approximate Fixed Points in Abstract Interpretation. ESOP 1992: 219-232
- [c9]
- [c8]
- 1991
- [j4]Sebastian Hunt, Chris Hankin: Fixed Points and Frontiers: A New Perspective. J. Funct. Program. 1(1): 91-120 (1991)
- [c7]
1980 – 1989
- 1989
- [c6]David Bolton, Chris Hankin, Paul H. J. Kelly: Parallel Object-Oriented Descriptions of Graph Reduction Machines (extended abstract). PARLE (1) 1989: 158-175
- 1988
- [j3]Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones: A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56: 17-36 (1988)
- 1987
- [e1]Samson Abramsky, Chris Hankin (Eds.): Abstract Interpretation of Declarative Languages. Ellis Horwood 1987, ISBN 0-7458-0109-9
- [c5]
- [c4]Paul Anderson, Chris Hankin, Paul H. J. Kelly, Peter Osmon, Malcolm J. Shute: COBWEB-2: Structured Specification of a Wafer-Scale Supercomputer. PARLE (1) 1987: 51-67
- 1986
- [j2]Geoffrey L. Burn, Chris Hankin, Samson Abramsky: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986)
- [c3]Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones: A Safe Approach to Parallel Combinator Reduction (Extended Abstract). ESOP 1986: 99-110
- 1985
- [c2]Chris Hankin, Peter Osmon, Malcolm J. Shute: COBWEB - A Combinator Reduction Architecture. FPCA 1985: 99-112
- [c1]Geoffrey L. Burn, Chris Hankin, Samson Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62
- 1982
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-19 17:08 CET by the dblp team