dblp.uni-trier.dewww.uni-trier.de

Chris Hankin Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
77EEChris Hankin, Flemming Nielson, Hanne Riis Nielson, Fan Yang: Advice for Coordination. COORDINATION 2008: 153-168
76EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantifying Timing Leaks and Cost Optimisation. ICICS 2008: 81-96
75EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantifying Timing Leaks and Cost Optimisation CoRR abs/0807.3879: (2008)
2007
74EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: A Systematic Approach to Probabilistic Pointer Analysis. APLAS 2007: 335-350
73EEDavid J. Pearce, Paul H. J. Kelly, Chris Hankin: Efficient field-sensitive pointer analysis of C. ACM Trans. Program. Lang. Syst. 30(1): (2007)
72EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On Probabilistic Techniques for Data Flow Analysis. Electr. Notes Theor. Comput. Sci. 190(3): 59-77 (2007)
71EEAlessandra Di Pierro, Chris Hankin, Igor Siveroni, Herbert Wiklicky: Tempus fugit: How to plug it. J. Log. Algebr. Program. 72(2): 173-190 (2007)
2006
70EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Abstract Interpretation for Worst and Average Case Analysis. Program Analysis and Compilation 2006: 160-174
69EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On Reversible Combinatory Logic. Electr. Notes Theor. Comput. Sci. 135(3): 25-35 (2006)
68EESebastian Nanz, Chris Hankin: Formal Security Analysis for Ad-Hoc Networks. Electr. Notes Theor. Comput. Sci. 142: 195-213 (2006)
67EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Reversible combinatory logic. Mathematical Structures in Computer Science 16(4): 621-637 (2006)
66EESebastian Nanz, Chris Hankin: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1-2): 203-227 (2006)
2005
65 Chris Hankin, Igor Siveroni: Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings Springer 2005
64EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages. FMCO 2005: 388-407
63EEChris Hankin, Herbert Wiklicky: lambda-calculus and Quantitative Program Analysis: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 112: 5-18 (2005)
62EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Continuous-Time Probabilistic KLAIM. Electr. Notes Theor. Comput. Sci. 128(5): 27-38 (2005)
61EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantitative static analysis of distributed systems. J. Funct. Program. 15(5): 703-749 (2005)
60EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic /lambda-calculus and Quantitative Program Analysis. J. Log. Comput. 15(2): 159-179 (2005)
59EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Measuring the confinement of probabilistic systems. Theor. Comput. Sci. 340(1): 3-56 (2005)
2004
58EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic KLAIM. COORDINATION 2004: 119-134
57EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic Linda-Based Coordination Languages. FMCO 2004: 120-140
56EEDavid J. Pearce, Paul H. J. Kelly, Chris Hankin: Efficient field-sensitive pointer analysis for C. PASTE 2004: 37-42
55 Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Approximate Non-interference. Journal of Computer Security 12(1): 37-82 (2004)
54EEDavid 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)
2003
53EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Quantitative Relations and Approximate Process Equivalences. CONCUR 2003: 498-512
52EEDavid J. Pearce, Paul H. J. Kelly, Chris Hankin: Online Cycle Detection and Difference Propagation for Pointer Analysis. SCAM 2003: 3-12
2002
51EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Approximate Non-Interference. CSFW 2002: 3-17
50EEAlessandro Aldini, Mario Bravetti, Alessandra Di Pierro, Roberto Gorrieri, Chris Hankin, Herbert Wiklicky: Two Formal Approaches for Approximating Noninterference Properties. FOSAD 2002: 1-43
49EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Analysing Approximate Confinement under Uniform Attacks. SAS 2002: 310-325
48EEChris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath: Flow Analysis: Games and Nets. The Essence of Computation 2002: 135-156
47 David Clark, Chris Hankin, Sebastian Hunt: Information flow for Algol-like languages. Comput. Lang. 28(1): 3-28 (2002)
2001
46EEAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky: Probabilistic confinement in a declarative framework. Electr. Notes Theor. Comput. Sci. 48: (2001)
2000
45 David Clark, Chris Hankin, Sebastian Hunt: Safety of Strictness Analysis via Term Graph Rewriting. SAS 2000: 95-114
1999
44EEPasquale Malacaria, Chris Hankin: Non-Deterministic Games and Program Analysis: An Application to Security. LICS 1999: 443-452
43EEChris Hankin, Pasquale Malacaria: Program Analysis Games. ACM Comput. Surv. 31(3es): 5 (1999)
1998
42 Chris Hankin: 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 Springer 1998
41EEPasquale Malacaria, Chris Hankin: A New Approach to Control Flow Analysis. CC 1998: 95-108
40EEPasquale Malacaria, Chris Hankin: Generalised Flowcharts and Games. ICALP 1998: 363-374
39 Chris Hankin: Guest Editor's Foreword. Nord. J. Comput. 5(4): 265-266 (1998)
38 Farhad Arbab, Paolo Ciancarini, Chris Hankin: Coordination Languages for Parallel Programming. Parallel Computing 24(7): 989-1004 (1998)
37EEChris Hankin: Program Analysis Tools. STTT 2(1): 6-12 (1998)
36EERoberto Gorrieri, Chris Hankin: Foreword: Theoretical Aspects of Coordination Languages. Theor. Comput. Sci. 192(2): 163-165 (1998)
35EEChris Hankin, Daniel Le Métayer, David Sands: Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998)
1997
34 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
33 Paolo Ciancarini, Chris Hankin: Coordination Languages and Models, First International Conference, COORDINATION '96, Cesena, Italy, April 15-17, 1996, Proceedings Springer 1996
32 Chris Hankin, Hanne Riis Nielson: Computing Surveys Symposium on Models of Programming Languages and Compuation. ACM Comput. Surv. 28(2): 293-294 (1996)
31 Chris Hankin, Hanne Riis Nielson, Jens Palsberg: Strategic Directions in Research on Programming Languages. ACM Comput. Surv. 28(4): 644-652 (1996)
1995
30 Chris Hankin, Ian Mackie, Rajagopal Nagarajan: 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
29 Chris Hankin, Daniel Le Métayer: Lazy Type Inference and Program Analysis. Sci. Comput. Program. 25(2-3): 219-249 (1995)
1994
28EEChris Hankin, Daniel Le Métayer: Lazy Type Inference for the Strictness Analysis of Lists. ESOP 1994: 257-271
27 Chris Hankin, Daniel Le Métayer: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. POPL 1994: 202-212
26 Chris Hankin, Daniel Le Métayer: A Type-based Framework for Program Analysis. SAS 1994: 380-394
25 Chris Hankin, Ian Mackie, Rajagopal Nagarajan: Preface. Theory and Formal Methods 1994
24 David Clark, Lindsay Errington, Chris Hankin: Static Analysis of Value-Passing Process Calculi. Theory and Formal Methods 1994: 307-320
23 Chris Hankin, Sebastian Hunt: Approximate Fixed Points in Abstract Interpretation. Sci. Comput. Program. 22(3): 283-306 (1994)
1993
22EEChris Hankin, Daniel Le Métayer, David Sands: A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378
21 David Clark, Chris Hankin: A Lattice of Abstract Graphs. PLILP 1993: 318-331
20 Lindsay Errington, Chris Hankin, Thomas P. Jensen: Reasoning About Gamma Programs. Theory and Formal Methods 1993: 115-125
19 Chris Hankin: Graph Rewriting Systems and Abstract Interpretation. Theory and Formal Methods 1993: 27-36
18 Lindsay Errington, Chris Hankin, Thomas P. Jensen: A Congruence for Gamma Programs. WSA 1993: 242-253
17 Chris Hankin: Editorial: Logic in Abstract Interpretation. J. Log. Comput. 3(6): 577-578 (1993)
1992
16EEChris Hankin, Sebastian Hunt: Approximate Fixed Points in Abstract Interpretation. ESOP 1992: 219-232
15 Chris Hankin, Daniel Le Métayer, David Sands: A Calculus of Gamma Programs. LCPC 1992: 342-355
14 Chris Hankin, Daniel Le Métayer, David Sands: Transformation of Gamma Programs. WSA 1992: 12-19
13 Chris Hankin: Editorial. J. Log. Comput. 2(4): 437-439 (1992)
1991
12EEChris Hankin: Static Analysis of Term Graph Rewriting Systems. PARLE (2) 1991: 367-384
11 Sebastian Hunt, Chris Hankin: Fixed Points and Frontiers: A New Perspective. J. Funct. Program. 1(1): 91-120 (1991)
1989
10EEDavid Bolton, Chris Hankin, Paul H. J. Kelly: Parallel Object-Oriented Descriptions of Graph Reduction Machines (extended abstract). PARLE (1) 1989: 158-175
1988
9 Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones: A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56: 17-36 (1988)
1987
8 Samson Abramsky, Chris Hankin: Abstract Interpretation of Declarative Languages Ellis Horwood 1987
7 Chris Martin, Chris Hankin: Finding fixed points in finite lattices. FPCA 1987: 426-445
6EEPaul 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
5EEChris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones: A Safe Approach to Parallel Combinator Reduction (Extended Abstract). ESOP 1986: 99-110
4 Geoffrey L. Burn, Chris Hankin, Samson Abramsky: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986)
1985
3 Chris Hankin, Peter Osmon, Malcolm J. Shute: COBWEB - A Combinator Reduction Architecture. FPCA 1985: 99-112
2 Geoffrey L. Burn, Chris Hankin, Samson Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62
1982
1 M. D. de Jong, Chris Hankin: Structured Data Flow Programming. SIGPLAN Notices 17(8): 18-27 (1982)

Coauthor Index

1Samson Abramsky [2] [4] [8]
2Alessandro Aldini [50]
3Paul Anderson [6]
4Farhad Arbab [38]
5David Bolton [10]
6Mario Bravetti [50]
7Geoffrey L. Burn [2] [4] [5] [9]
8Paolo Ciancarini [33] [38]
9David Clark [21] [24] [45] [47]
10Lindsay Errington [18] [20] [24]
11Roberto Gorrieri [36] [50]
12Sebastian Hunt [11] [16] [23] [45] [47]
13Thomas P. Jensen [18] [20]
14Simon L. Peyton Jones [5] [9]
15M. D. de Jong [1]
16Paul H. J. Kelly [6] [10] [52] [54] [56] [73]
17Ian Mackie [25] [30]
18Pasquale Malacaria [40] [41] [43] [44]
19Chris Martin [7]
20Daniel Le Métayer [14] [15] [22] [26] [27] [28] [29] [35]
21Rajagopal Nagarajan [25] [30] [48]
22Sebastian Nanz [66] [68]
23Flemming Nielson [77]
24Hanne Riis Nielson [31] [32] [34] [77]
25Peter Osmon [3] [6]
26Jens Palsberg [31] [34]
27David J. Pearce [52] [54] [56] [73]
28Alessandra Di Pierro [46] [49] [50] [51] [53] [55] [57] [58] [59] [60] [61] [62] [64] [67] [69] [70] [71] [72] [74] [75] [76]
29Prahladavaradan Sampath [48]
30David Sands [14] [15] [22] [35]
31Malcolm J. Shute [3] [6]
32Igor Siveroni [65] [71]
33Herbert Wiklicky [46] [49] [50] [51] [53] [55] [57] [58] [59] [60] [61] [62] [63] [64] [67] [69] [70] [71] [72] [74] [75] [76]
34Fan Yang [77]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)