The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chris Hankin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  67. A Systematic Approach to Probabilistic Pointer Analysis. [Citation Graph (, )][DBLP]


  68. Advice for Coordination. [Citation Graph (, )][DBLP]


  69. Advice from Belnap Policies. [Citation Graph (, )][DBLP]


  70. Quantifying Timing Leaks and Cost Optimisation. [Citation Graph (, )][DBLP]


  71. Probabilistic Semantics and Program Analysis. [Citation Graph (, )][DBLP]


  72. Quantifying Timing Leaks and Cost Optimisation [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002