J.A. Bergstra, A. Ponse, "A Bypass of Cohen's Impossibility Result", in Advances in Grid Computing: European Grid Conference (EGC 2005), LNCS 3470, pp. 1097 - 1106, Springer, June 2005.

http://dx.doi.org/10.1007/11508380_112


@inproceedings{DBLP:conf/egc/BergstraP05,
  author    = {Jan A. Bergstra and
               Alban Ponse},
  title     = {A Bypass of Cohen's Impossibility Result.},
  booktitle = {EGC},
  year      = {2005},
  pages     = {1097-1106},
  ee        = {http://dx.doi.org/10.1007/11508380_112},
  crossref  = {DBLP:conf/egc/2005},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract
Detecting illegal resource access in the setting of grid computing is similar to
the problem of virus detection as put forward by Fred Cohen in 1984. We discuss
Cohen's impossibility result on virus detection, and introduce "risk assessment
of security hazards", a notion that is decidable for a large class of program
behaviors.