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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125–156 (2002)
Bergstra, J.A., Middelburg, C.A.: Thread algebra for strategic interleaving. Computing Science Report 04-35, Eindhoven University of Technology, Department of Mathematics and Computing Science (November 2004)
Bergstra, J.A., Ponse, A.: Combining programs and state machines. Journal of Logic and Algebraic Programming 51(2), 175–192 (2002)
Bergstra, J.A., Ponse, A.: Execution architectures for program algebra. Logic Group Preprint Series 230, Dept. of Philosophy, Utrecht University (2004)
Cohen, F.: Computer viruses - theory and experiments (1984); Version including some corrections and references: Computers & Security 6(1), 22–35 (1987), http://vx.netlux.org/lib/afc01.html .
Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Blackburn, K., Lazzarini, A., Arbree, A., Cavanaugh, R., Koranda, S.: Mapping abstract complex workflows onto grid environments. Journal of Grid Computing 1, 25–39 (2003)
Hwang, S., Kesselman, C.: A flexible framework for fault tolerance in the grid. Journal of Grid Computing 1(3), 251–272 (2003)
Nemeth, Z.s., Sunderam, V.: Characterizing grids: attributes, definitions, and formalisms. Journal of Grid Computing 1, 9–23 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J.A., Ponse, A. (2005). A Bypass of Cohen’s Impossibility Result. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds) Advances in Grid Computing - EGC 2005. EGC 2005. Lecture Notes in Computer Science, vol 3470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508380_112
Download citation
DOI: https://doi.org/10.1007/11508380_112
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26918-2
Online ISBN: 978-3-540-32036-4
eBook Packages: Computer ScienceComputer Science (R0)