Skip to main content
SpringerLink
Log in
Book cover

European Grid Conference

EGC 2005: Advances in Grid Computing - EGC 2005 pp 1097–1106Cite as

A Bypass of Cohen’s Impossibility Result

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3470))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125–156 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Bergstra, J.A., Ponse, A.: Combining programs and state machines. Journal of Logic and Algebraic Programming 51(2), 175–192 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bergstra, J.A., Ponse, A.: Execution architectures for program algebra. Logic Group Preprint Series 230, Dept. of Philosophy, Utrecht University (2004)

    Google Scholar 

  5. 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 .

    Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. Hwang, S., Kesselman, C.: A flexible framework for fault tolerance in the grid. Journal of Grid Computing 1(3), 251–272 (2003)

    Article  MATH  Google Scholar 

  8. Nemeth, Z.s., Sunderam, V.: Characterizing grids: attributes, definitions, and formalisms. Journal of Grid Computing 1, 9–23 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Jan A. Bergstra & Alban Ponse

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Jan A. Bergstra

Authors
  1. Jan A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alban Ponse
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098, Amsterdam, SJ, The Netherlands

    Peter M. A. Sloot

  2. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

  3. INRIA Rennes - Bretagne Atlantique, Campus de Beaulieu, 35042, Rennes Cedex, France

    Thierry Priol

  4. Zuse Institute Berlin,  

    Alexander Reinefeld

  5. Institute of Computer Science, AGH, Poland

    Marian Bubak

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation