Abstract
We are concerned with theoretical aspects of computer viruses. For this, we suggest a new definition of viruses which is clearly based on the iteration theorem and above all on Kleene’s recursion theorem. We show that we capture in a natural way previous definitions, and in particular the one of Adleman. We establish generic constructions in order to construct viruses, and we illustrate them by various examples. We discuss the relationship between information theory and viruses and we propose a defense against a kind of viral propagation. Lastly, we show that virus detection is Π2-complete. However, since we are able to deal with system vulnerability, we exhibit another defense based on controlling system access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.: An abstract theory of computer viruses. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 354–374. Springer, Heidelberg (1990)
Bishop, M.: An overview of computer viruses in a research environment. Technical report, Hanover, NH, USA (1991)
Chess, D., White, S.: An undetectable computer virus
Cohen, F.: Computer Viruses. PhD thesis, University of Southern California (January 1986)
Cohen, F.: Computer viruses: theory and experiments. Comput. Secur. 6(1), 22–35 (1987)
Cohen, F.: Models of practical defenses against computer viruses: theory and experiments. Comput. Secur. 6(1) (1987)
Davis, M.: Computability and unsolvability. McGraw-Hill, New York (1958)
Filiol, E.: Les virus informatiques: théorie, pratique et applications. Springer, Heidelberg (2004)
Goel, S., Bush, S.: Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: a comparison with traditional approaches. Complex 9(2), 54–73 (2003)
Anderson, S., Thimbleby, H., Cairns, P.: A framework for medelling trojans and computer virus infection. Comput. J. 41, 444–458 (1999)
Jones, N.: Computer implementation and applications of kleene’s S-m-n and recursive theorems. In: Moschovakis, Y.N. (ed.) Lecture Notes in Mathematics, Logic From Computer Science, pp. 243–263 (1991)
Kleene, S.C.: Introduction to Metamathematics, nj edn. Van Nostrand, Princeton (1964)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and its Application, 2nd edn. Springer, Heidelberg (1997)
Ludwig, M.: The Giant Black Book of Computer Viruses. American Eagle Publications (1998)
Odiffredi, P.: Classical recursion theory. North-Holland, Amsterdam (1989)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967)
Szor, P.: The Art of Computer Virus Research and Defense. Addison-Wesley Professional, Reading (2005)
Turing, A., Girard, J.-Y.: La machine de Turing. Seuil (1995)
Turing, A.M.: On computable numbers with an application to the entscheidungsproblem. Proc. London Mathematical Society 42(2), 230–265 (1936) Traduction [18]
Uspenskii, V.A.: Enumeration operators ans the concept of program. Uspekhi Matematicheskikh Nauk 11 (1956)
von Neumann, J., Burks, A.W.: Theory of self-reproducing automata. University of Illinois Press, Champaign (1966)
Zuo, Z., Zhou, M.: Some further theorical results about computer viruses. The Computer Journal (2004)
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
Bonfante, G., Kaczmarek, M., Marion, J.Y. (2005). Toward an Abstract Computer Virology. In: Van Hung, D., Wirsing, M. (eds) Theoretical Aspects of Computing – ICTAC 2005. ICTAC 2005. Lecture Notes in Computer Science, vol 3722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560647_38
Download citation
DOI: https://doi.org/10.1007/11560647_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29107-7
Online ISBN: 978-3-540-32072-2
eBook Packages: Computer ScienceComputer Science (R0)