default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Hankin
Person information
- affiliation: Imperial College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j46]Martín Barrère
, Chris Hankin, Dean O'Reilly:
Cyber-physical attack graphs (CPAGs): Composable and scalable attack graphs for cyber-physical systems. Comput. Secur. 132: 103348 (2023)- 2022
- [j45]Ferda Özdemir Sönmez, Chris Hankin, Pasquale Malacaria:
Decision support for healthcare cyber security. Comput. Secur. 122: 102865 (2022) - [j44]Ferda Özdemir Sönmez, Chris Hankin, Pasquale Malacaria:
Attack Dynamics: An Automatic Attack Graph Generation Framework Based on System Topology, CAPEC, CWE, and CVE Databases. Comput. Secur. 123: 102938 (2022) - [c67]Przemyslaw Buczkowski, Pasquale Malacaria, Chris Hankin, Andrew Fielder:
Optimal Security Hardening over a Probabilistic Attack Graph: A Case Study of an Industrial Control System using CySecTool. SAT-CPS@CODASPY 2022: 21-30 - [i19]Przemyslaw Buczkowski, Pasquale Malacaria, Chris Hankin, Andrew Fielder:
Optimal security hardening over a probabilistic attack graph: a case study of an industrial control system using the CySecTool tool. CoRR abs/2204.11707 (2022) - 2021
- [j43]Martín Barrère, Chris Hankin:
Analysing Mission-critical Cyber-physical Systems with AND/OR Graphs and MaxSAT. ACM Trans. Cyber Phys. Syst. 5(3): 30:1-30:29 (2021) - [i18]Giulio Zizzo, Ambrish Rawat, Mathieu Sinn, Sergio Maffeis, Chris Hankin:
Certified Federated Adversarial Training. CoRR abs/2112.10525 (2021) - 2020
- [j42]Martín Barrère, Chris Hankin, Nicolas Nicolaou, Demetrios G. Eliades, Thomas Parisini:
Measuring cyber-physical security in industrial control systems via minimum-effort attack strategies. J. Inf. Secur. Appl. 52: 102471 (2020) - [c66]Chris Hankin, Martín Barrère:
Trustworthy Inter-connected Cyber-Physical Systems. CRITIS 2020: 3-13 - [c65]Martín Barrère, Chris Hankin:
Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT. DSN (Supplements) 2020: 53-54 - [c64]Tingting Li, Cheng Feng, Chris Hankin:
Scalable Approach to Enhancing ICS Resilience by Network Diversity. DSN 2020: 398-410 - [c63]Giulio Zizzo, Chris Hankin, Sergio Maffeis, Kevin Jones:
Adversarial Attacks on Time-Series Intrusion Detection for Industrial Control Systems. TrustCom 2020: 899-910 - [i17]Martín Barrère, Chris Hankin:
Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT. CoRR abs/2005.03003 (2020) - [i16]Carsten Maple, Peter Davies, Kerstin Eder, Chris Hankin, Greg Chance, Gregory Epiphaniou:
CyRes - Avoiding Catastrophic Failure in Connected and Autonomous Vehicles (Extended Abstract). CoRR abs/2006.14890 (2020) - [i15]Martín Barrère, Chris Hankin:
MaxSAT Evaluation 2020 - Benchmark: Identifying Maximum Probability Minimal Cut Sets in Fault Trees. CoRR abs/2007.08255 (2020)
2010 – 2019
- 2019
- [j41]Panagiota Fatourou, Chris Hankin:
Welcome to the Europe region special section. Commun. ACM 62(4): 28 (2019) - [j40]Ovidiu Serban, Nicholas A. Thapen, Brendan Maginnis, Chris Hankin, Virginia Foot:
Real-time processing of social media with SENTINEL: A syndromic surveillance system incorporating deep learning for health classification. Inf. Process. Manag. 56(3): 1166-1184 (2019) - [c62]Giulio Zizzo, Chris Hankin, Sergio Maffeis, Kevin Jones:
Adversarial Machine Learning Beyond the Image Domain. DAC 2019: 176 - [i14]Martín Barrère, Chris Hankin, Nicolas Nicolaou, Demetrios G. Eliades, Thomas Parisini:
Identifying Security-Critical Cyber-Physical Components in Industrial Control Systems. CoRR abs/1905.04796 (2019) - [i13]Giulio Zizzo, Chris Hankin, Sergio Maffeis, Kevin Jones:
Deep Latent Defence. CoRR abs/1910.03916 (2019) - [i12]Martín Barrère, Chris Hankin, Nicolas Nicolaou, Demetrios G. Eliades, Thomas Parisini:
MaxSAT Evaluation 2019 - Benchmark: Identifying Security-Critical Cyber-Physical Components in Weighted AND/OR Graphs. CoRR abs/1911.00516 (2019) - [i11]Giulio Zizzo, Chris Hankin, Sergio Maffeis, Kevin Jones:
Intrusion Detection for Industrial Control Systems: Evaluation Analysis and Adversarial Attacks. CoRR abs/1911.04278 (2019) - [i10]Martín Barrère, Chris Hankin, Demetrios G. Eliades, Nicolas Nicolaou, Thomas Parisini:
Assessing Cyber-Physical Security in Industrial Control Systems. CoRR abs/1911.09404 (2019) - 2018
- [j39]James R. Larus, Chris Hankin:
Regulating automated decision making. Commun. ACM 61(8): 5 (2018) - [c61]Martín Barrère, Chris Hankin, Angelo Barboni, Giulio Zizzo, Francesca Boem, Sergio Maffeis, Thomas Parisini:
CPS-MT: A Real-Time Cyber-Physical System Monitoring Tool for Security Research. RTCSA 2018: 240-241 - [i9]Tingting Li, Cheng Feng, Chris Hankin:
Improving ICS Cyber Resilience through Optimal Diversification of Network Resources. CoRR abs/1811.00142 (2018) - 2016
- [j38]Nicholas A. Thapen, Donal Stephen Simmie, Chris Hankin:
The early bird catches the term: combining twitter and news data for event detection and situational awareness. J. Biomed. Semant. 7: 61 (2016) - [j37]Andrew Fielder, Emmanouil A. Panaousis, Pasquale Malacaria, Chris Hankin, Fabrizio Smeraldi:
Decision support approaches for cyber security investment. Decis. Support Syst. 86: 13-23 (2016) - [c60]Chris Hankin:
Game Theory and Industrial Control Systems. Semantics, Logics, and Calculi 2016: 178-190 - [c59]Tingting Li, Chris Hankin:
Effective Defence Against Zero-Day Exploits Using Bayesian Networks. CRITIS 2016: 123-136 - [c58]M. H. R. Khouzani, Pasquale Malacaria, Chris Hankin, Andrew Fielder, Fabrizio Smeraldi:
Efficient Numerical Frameworks for Multi-objective Cyber Security Planning. ESORICS (2) 2016: 179-197 - [c57]Andrew Fielder, Tingting Li, Chris Hankin:
Defense-in-depth vs. Critical Component Defense for Industrial Control Systems. ICS-CSR 2016 - [c56]Andrew Fielder, Tingting Li, Chris Hankin:
Modelling Cost-Effectiveness of Defenses in Industrial Control Systems. SAFECOMP 2016: 187-200 - [e7]Christian W. Probst, Chris Hankin, René Rydhof Hansen:
Semantics, Logics, and Calculi - Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays. Lecture Notes in Computer Science 9560, Springer 2016, ISBN 978-3-319-27809-4 [contents] - 2015
- [j36]Maria Grazia Vigliotti, Chris Hankin:
Discovery of anomalous behaviour in temporal networks. Soc. Networks 41: 18-25 (2015) - [c55]Tingting Li, Chris Hankin:
A Model-based Approach to Interdependency between Safety and Security in ICS. ICS-CSR 2015 - [i8]Andrew Fielder, Emmanouil A. Panaousis, Pasquale Malacaria, Chris Hankin, Fabrizio Smeraldi:
Comparing Decision Support Approaches for Cyber Security Investment. CoRR abs/1502.05532 (2015) - [i7]Nicholas A. Thapen, Donal Stephen Simmie, Chris Hankin:
The Early Bird Catches The Term: Combining Twitter and News Data For Event Detection and Situational Awareness. CoRR abs/1504.02335 (2015) - [i6]Donal Stephen Simmie, Nicholas A. Thapen, Chris Hankin:
DEFENDER: Detecting and Forecasting Epidemics using Novel Data-analytics for Enhanced Response. CoRR abs/1504.04357 (2015) - 2014
- [j35]Donal Stephen Simmie, Maria Grazia Vigliotti, Chris Hankin:
Ranking twitter influence by combining network centrality and influence observables in an evolutionary model. J. Complex Networks 2(4): 495-517 (2014) - [j34]Erwan Le Martelot, Chris Hankin:
Fast multi-scale detection of overlapping communities using local criteria. Computing 96(11): 1011-1027 (2014) - [c54]Emmanouil A. Panaousis, Andrew Fielder, Pasquale Malacaria, Chris Hankin, Fabrizio Smeraldi:
Cybersecurity Games and Investments: A Decision Support Approach. GameSec 2014: 266-286 - [c53]Andrew Fielder, Emmanouil A. Panaousis, Pasquale Malacaria, Chris Hankin, Fabrizio Smeraldi:
Game Theory Meets Information Security Management. SEC 2014: 15-29 - 2013
- [j33]Erwan Le Martelot, Chris Hankin:
Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks. Comput. J. 56(9): 1136-1150 (2013) - [j32]Erwan Le Martelot, Chris Hankin:
Multi-scale community detection using stability optimisation. Int. J. Web Based Communities 9(3): 323-348 (2013) - [j31]Fan Yang, Chris Hankin, Flemming Nielson, Hanne Riis Nielson:
Predictive access control for distributed computation. Sci. Comput. Program. 78(9): 1264-1277 (2013) - [c52]Chris Hankin, Pasquale Malacaria:
Payoffs, Intensionality and Abstraction in Games. Computation, Logic, Games, and Quantum Foundations 2013: 69-82 - [c51]Donal Stephen Simmie, Maria Grazia Vigliotti, Chris Hankin:
Ranking Twitter Influence by Combining Network Centrality and Influence Observables in an Evolutionary Model. SITIS 2013: 491-498 - [c50]Chris Hankin:
A short note on Simulation and Abstraction. Festschrift for Dave Schmidt 2013: 337-340 - [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
- [j30]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) - [c49]Erwan Le Martelot, Chris Hankin:
Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm. KDIR 2011: 216-225 - 2010
- [j29]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Program Analysis Probably Counts. Comput. J. 53(6): 871-880 (2010) - [c48]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Probabilistic Semantics and Program Analysis. SFM 2010: 1-42 - [c47]Chris Hankin, Flemming Nielson, Hanne Riis Nielson:
Probabilistic Aspects: Checking Security in an Imperfect World. TGC 2010: 348-363
2000 – 2009
- 2009
- [c46]Chris Hankin, Flemming Nielson, Hanne Riis Nielson:
Advice from Belnap Policies. CSF 2009: 234-247 - 2008
- [c45]Chris Hankin, Flemming Nielson, Hanne Riis Nielson, Fan Yang:
Advice for Coordination. COORDINATION 2008: 153-168 - [c44]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
- [j28]Alessandra Di Pierro, Chris Hankin, Igor Siveroni, Herbert Wiklicky:
Tempus fugit: How to plug it. J. Log. Algebraic Methods Program. 72(2): 173-190 (2007) - [j27]David J. Pearce, Paul H. J. Kelly, Chris Hankin:
Efficient field-sensitive pointer analysis of C. ACM Trans. Program. Lang. Syst. 30(1): 4 (2007) - [c43]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
A Systematic Approach to Probabilistic Pointer Analysis. APLAS 2007: 335-350 - [c42]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
On Probabilistic Techniques for Data Flow Analysis. QAPL 2007: 59-77 - 2006
- [j26]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Reversible combinatory logic. Math. Struct. Comput. Sci. 16(4): 621-637 (2006) - [j25]Sebastian Nanz, Chris Hankin:
A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1-2): 203-227 (2006) - [c41]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Abstract Interpretation for Worst and Average Case Analysis. Program Analysis and Compilation 2006: 160-174 - 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) - [c40]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages. FMCO 2005: 388-407 - [c39]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
On Reversible Combinatory Logic. DCM@ICALP 2005: 25-35 - [e6]Chris Hankin, Igor Siveroni:
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 [contents] - 2004
- [j21]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Approximate Non-interference. J. Comput. Secur. 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. Softw. Qual. J. 12(4): 311-337 (2004) - [c38]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Probabilistic KLAIM. COORDINATION 2004: 119-134 - [c37]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Probabilistic Linda-Based Coordination Languages. FMCO 2004: 120-140 - [c36]David J. Pearce, Paul H. J. Kelly, Chris Hankin:
Efficient field-sensitive pointer analysis for C. PASTE 2004: 37-42 - [c35]Chris Hankin, Herbert Wiklicky:
lambda-calculus and Quantitative Program Analysis: (Extended Abstract). QAPL 2004: 5-18 - [c34]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Continuous-Time Probabilistic KLAIM. SecCo 2004: 27-38 - [c33]Sebastian Nanz, Chris Hankin:
Formal Security Analysis for Ad-Hoc Networks. VODCA@FOSAD 2004: 195-213 - 2003
- [c32]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Quantitative Relations and Approximate Process Equivalences. CONCUR 2003: 498-512 - [c31]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. Syst. Struct. 28(1): 3-28 (2002) - [c30]Chris Hankin, Rajagopal Nagarajan, Prahladavaradan Sampath:
Flow Analysis: Games and Nets. The Essence of Computation 2002: 135-156 - [c29]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Approximate Non-Interference. CSFW 2002: 3-17 - [c28]Alessandro Aldini, Mario Bravetti, Alessandra Di Pierro, Roberto Gorrieri, Chris Hankin, Herbert Wiklicky:
Two Formal Approaches for Approximating Noninterference Properties. FOSAD 2002: 1-43 - [c27]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Analysing Approximate Confinement under Uniform Attacks. SAS 2002: 310-325 - 2001
- [c26]Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
Probabilistic confinement in a declarative framework. APPIA-GULP-PRODE 2001: 108-130 - [e5]Chris Hankin, Dave Schmidt:
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 [contents] - 2000
- [c25]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 - [j18]Chris Hankin, Pasquale Malacaria:
Program Analysis Games. ACM Comput. Surv. 31(3es): 5 (1999) - [c24]Pasquale Malacaria, Chris Hankin:
Non-Deterministic Games and Program Analysis: An Application to Security. LICS 1999: 443-452 - 1998
- [j17]Chris Hankin:
Guest Editor's Foreword. Nord. J. Comput. 5(4): 265-266 (1998) - [j16]Farhad Arbab, Paolo Ciancarini, Chris Hankin:
Coordination Languages for Parallel Programming. Parallel Comput. 24(7): 989-1004 (1998) - [j15]Chris Hankin:
Program Analysis Tools. Int. J. Softw. Tools Technol. Transf. 2(1): 6-12 (1998) - [j14]Roberto Gorrieri, Chris Hankin:
Foreword: Theoretical Aspects of Coordination Languages. Theor. Comput. Sci. 192(2): 163-165 (1998) - [j13]Chris Hankin, Daniel Le Métayer, David Sands:
Refining Multiset Tranformers. Theor. Comput. Sci. 192(2): 233-258 (1998) - [c23]Pasquale Malacaria, Chris Hankin:
A New Approach to Control Flow Analysis. CC 1998: 95-108 - [c22]Pasquale Malacaria, Chris Hankin:
Generalised Flowcharts and Games. ICALP 1998: 363-374 - [e4]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. Lecture Notes in Computer Science 1381, Springer 1998, ISBN 3-540-64302-8 [contents] - 1997
- [j12]Chris Hankin, Hanne Riis Nielson, Jens Palsberg:
Position Statements on Strategic Directions for Research on Programming Languages. ACM SIGPLAN Notices 32(1): 59-65 (1997) - 1996
- [j11]Chris Hankin, Hanne Riis Nielson:
Computing Surveys Symposium on Models of Programming Languages and Compuation. ACM Comput. Surv. 28(2): 293-294 (1996) - [j10]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:
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 [contents] - 1995
- [j9]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:
Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Møller Centre, Cambridge, UK, 11-14 September 1994. Imperial College Press 1995, ISBN 1-86094-003-X [contents] - 1994
- [j8]Chris Hankin, Sebastian Hunt:
Approximate Fixed Points in Abstract Interpretation. Sci. Comput. Program. 22(3): 283-306 (1994) - [c21]Chris Hankin, Daniel Le Métayer:
Lazy Type Inference for the Strictness Analysis of Lists. ESOP 1994: 257-271 - [c20]David Clark, Lindsay Errington, Chris Hankin:
Static Analysis of Value-Passing Process Calculi. Theory and Formal Methods 1994: 307-320 - [c19]Chris Hankin, Ian Mackie, Rajagopal Nagarajan:
Preface. Theory and Formal Methods 1994 - [c18]Chris Hankin, Daniel Le Métayer:
Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis. POPL 1994: 202-212 - [c17]Chris Hankin, Daniel Le Métayer:
A Type-based Framework for Program Analysis. SAS 1994: 380-394 - 1993
- [j7]Chris Hankin:
Editorial: Logic in Abstract Interpretation. J. Log. Comput. 3(6): 577-578 (1993) - [c16]Chris Hankin:
Graph Rewriting Systems and Abstract Interpretation. Theory and Formal Methods 1993: 27-36 - [c15]Lindsay Errington, Chris Hankin, Thomas P. Jensen:
Reasoning About Gamma Programs. Theory and Formal Methods 1993: 115-125 - [c14]Chris Hankin, Daniel Le Métayer, David Sands:
A Parallel Programming Style and Its Algebra of Programs. PARLE 1993: 367-378 - [c13]David Clark, Chris Hankin:
A Lattice of Abstract Graphs. PLILP 1993: 318-331 - [c12]Lindsay Errington, Chris Hankin, Thomas P. Jensen:
A Congruence for Gamma Programs. WSA 1993: 242-253 - 1992
- [j6]Chris Hankin:
Editorial. J. Log. Comput. 2(4): 437-439 (1992) - [c11]Chris Hankin, Sebastian Hunt:
Approximate Fixed Points in Abstract Interpretation. ESOP 1992: 219-232 - [c10]Chris Hankin, Daniel Le Métayer, David Sands:
A Calculus of Gamma Programs. LCPC 1992: 342-355 - [c9]Chris Hankin, Daniel Le Métayer, David Sands:
Transformation of Gamma Programs. WSA 1992: 12-19 - 1991
- [j5]Sebastian Hunt, Chris Hankin:
Fixed Points and Frontiers: A New Perspective. J. Funct. Program. 1(1): 91-120 (1991) - [c8]Chris Hankin:
Static Analysis of Term Graph Rewriting Systems. PARLE (2) 1991: 367-384 - 1990
- [j4]David Bolton, Chris Hankin, Paul H. J. Kelly:
Parallel object-oriented descriptions of graph reduction machines. Future Gener. Comput. Syst. 6(3): 225-239 (1990) - [c7]Chris Hankin:
Abstract Interpretation of Term Graph Rewriting Systems. Functional Programming 1990: 54-65
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 Livingston Burn, Simon L. Peyton Jones:
A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56: 17-36 (1988) - 1987
- [c5]Chris Martin, Chris Hankin:
Finding fixed points in finite lattices. FPCA 1987: 426-445 - [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 - [e1]Samson Abramsky, Chris Hankin:
Abstract Interpretation of Declarative Languages. Ellis Horwood 1987, ISBN 0-7458-0109-9 - 1986
- [j2]Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky:
Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986) - [c3]Chris Hankin, Geoffrey Livingston 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 Livingston Burn, Chris Hankin, Samson Abramsky:
The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62 - 1982
- [j1]M. D. de Jong, Chris Hankin:
Structured Data Flow Programming. ACM SIGPLAN Notices 17(8): 18-27 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
