A bypass of cohen's impossibility result

Authors:
Jan A. Bergstra;Alban Ponse
Affiliations:
Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands;Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands
Venue:
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Year:
2005

Citing 1
Cited 2

Computer viruses: theory and experiments

Computers and Security

Proposition algebra

ACM Transactions on Computational Logic (TOCL)
An introduction to program and thread algebra

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Quantified Score

Hi-index	0.00

Visualization

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.