Geoffrey L. Burn, Chris Hankin & Samson Abramsky (1986):
Strictness Analysis for Higher-Order Functions.
Sci. Comput. Program. 7(3),
pp. 249–278,
doi:10.1016/0167-6423(86)90010-9.
Patrick Cousot & Radhia Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In: POPL.
ACM,
pp. 238–252,
doi:10.1145/512950.512973.
Jean-Charles Delvenne, Sophia Yaliraki & Mauricio Barahona (2010):
Stability of graph communities across time scales.
Proc. Nat. Acad. Sci. 107(29),
pp. 12755–12760,
doi:10.1073/pnas.0903215107.
Chris Hankin & Pasquale Malacaria (2013):
Payoffs, Intensionality and Abstraction in Games.
In: Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky,
Lecture Notes in Computer Science 7860.
Springer,
doi:10.1007/978-3-642-38164-5-6.
Kim Guldstrand Larsen & Arne Skou (1989):
Bisimulation Through Probabilistic Testing.
In: POPL.
ACM,
pp. 344–352,
doi:10.1145/75277.75307.
Erwan Le Martelot & Chris Hankin (2013):
Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks.
Computer Journal,
doi:10.1093/comjnl/bxt002.
Austin Melton, David A. Schmidt & George E. Strecker (1986):
Galois Connections and Computer Science Applications.
In: CTCS,
Lecture Notes in Computer Science 240.
Springer,
pp. 299–312,
doi:10.1007/3-540-17162-2-130.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2003):
Quantitative Relations and Approximate Process Equivalences.
In: CONCUR,
Lecture Notes in Computer Science 2761.
Springer,
pp. 498–512,
doi:10.1007/978-3-540-45187-7-33.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2004):
Approximate Non-interference.
Journal of Computer Security 12(1),
pp. 37–82.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2005):
Measuring the confinement of probabilistic systems.
Theor. Comput. Sci. 340(1),
pp. 3–56,
doi:10.1016/j.tcs.2005.03.002.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2011):
Probabilistic timing covert channels: to close or not to close?.
Int. J. Inf. Sec. 10(2),
pp. 83–106,
doi:10.1007/s10207-010-0107-0.
Alessandra Di Pierro & Herbert Wiklicky (2000):
Concurrent constraint programming: towards probabilistic abstract interpretation.
In: PPDP.
ACM,
pp. 127–138,
doi:10.1145/351268.351284.
David A. Schmidt (1980):
State transition machines for lambda calculus expressions.
In: Semantics-Directed Compiler Generation,
Lecture Notes in Computer Science 94.
Springer,
pp. 415–440,
doi:10.1007/3-540-10250-7-32.
David A. Schmidt (1986):
Denotational semantics: a methodology for language development.
Allyn and Bacon.
David A. Schmidt (1999):
Binary relations for abstraction and refinement.
In: Workshop on Refinement and Abstraction.
eptcs@eptcs.org