From turing machines to computer viruses

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 370, Issue 1971, 2012, Pages 3319-3339

  Marion, Jean Yves ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Auto modification; Recursion theorem; Self reproduction; Stored register machine; Universal turing machine; Virus

Indexed keywords

COMPUTER VIRUSES; TURING MACHINES; VIRUSES;

AUTO-MODIFICATION; RECURSIONS; REGISTER MACHINES; SELF REPRODUCTION; UNIVERSAL TURING MACHINE;

MACHINERY;

EID: 84862885688     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.2011.0332     Document Type: Article

References (41)

1. Turing, A. M. 1936 On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230-265. (doi:10.1112/plms/s2- 42.1.230)
2. Turing, A. M. 1937 On computable numbers, with an application to the Entscheidungsproblem. A correction. Proc. Lond. Math. Soc. 43, 544-546. (doi:10.1112/plms/s2-43.6.544)
3. Kleene, S. C. 1938 On notation for ordinal numbers. J. Symb. Logic 3, 150-155. (doi:10.2307/2267778)
4. Moschovakis, Y. N. 2010 Kleene's amazing second recursion theorem. Bull. Symb. Logic 16, 189-239. (doi:10.2178/bsl/1286889124)
5. Smullyan, R. 1993 Recursion theory for metamathematics. Oxford, UK: Oxford University Press.
6. Smullyan, R. 1994 Diagonalisation and self-reference. Oxford, UK: Clarendon Press.
7. Cohen, F. 1986 Computer viruses. PhD thesis, University of Southern California, Los Angeles, CA.
8. Ször, P. 2005 The art of computer virus research and defense. Reading, MA: Addison-Wesley Professional.
9. Adleman, L. 1988 An abstract theory of computer viruses. In Advances in cryptology: CRYPTO'88. Lecture Notes Computer Science, no. 403. Berlin, Germany: Springer.
10. Zuo, Z. & Zhou, M. 2004 Some further theoretical results about computer viruses. Comput. J. 47, 627-633. (doi:10.1093/comjnl/47.6.627)
11. Bonfante, G., Kaczmarek, M. & Marion, J.-Y. 2006 On abstract computer virology from a recursion-theoretic perspective. J. Comput. Virol. 1, 45-54. (doi:10.1007/S11416-005-0007-4) (Pubitemid 44195058)
12. Case, J. & Moelius, S. E. 2007 Cautious virus detection in the extreme. In PLAS, pp. 47-52. California, CA: ACM. (Pubitemid 350164746)
13. von Neumann, J. 1951 A general and logical theory of automata. In Cerebral mechanisms in behavior: the Hixon symposium (ed L. Jeffries), pp. 1-31. London, UK: Wiley. (Reprinted Papers of John von Neumann on computing and computer theory (eds W. Aspray & A. Burks). Cambridge, MA: MIT Press, 1987.)
14. Case, J. 2007 Directions for computability theory beyond pure mathematical. In Mathematical problems from applied logic II, vol. 5 (eds D. M. Gabbay, M. Zakharyaschev & S. S. Goncharov), pp. 53-98. International Mathematical Series. New York, NY: Springer.
15. Post, E. L. 1943 Formal reductions of the general combinatorial decision problem. Am. J. Math. 65, 197-215. (doi:10.2307/2371809)
16. Shepherdson, J. C. & Sturgis, H. E. 1963 Computability of recursive functions. J. ACM 10, 217-255. (doi:10.1145/321160.321170)
17. Moss, L. 2006 Recursion theorems and self-replication via text register machine programs. Bull. Eur. Assoc. Theor. Comput. Sci. 89, 171-182. (doi:10.1016/j.ipl.2008.02.002)
18. Turing, A. M. & Wilkinson, J. H. 2005 The Turing-Wilkinson lecture series (1946-1947). In Alan Turing's automatic computing engine (ed. B. J. Copeland). Oxford, UK: Oxford University Press.
19. Burks, A., Goldstine, H. & von Neumann, J. 1946 Preliminary discussion of the logical design of an electronic computing instrument. Institute for Advanced Study.
20. Elgot, C. C. & Robinson, A. 1964 Random-access stored-program machines, an approach to programming languages. J. ACM 11, 365-399. (doi:10.1145/321239.321240)
21. Hartmanis, J. 1971 Computational complexity of random access stored program machines. Math. Syst. Theory 5, 232-245. (doi:10.1007/BF01694180)
22. Cook, S. & Reckhow, R. 1973 Time bounded random access machines. J. Comput. Syst. Sci. 7, 354-375. (doi:10.1016/S0022-0000 (73) 80029-7)
23. Turing, A. M. 1952 The chemical basis of morphogenesis. Phil. Trans. R. Soc. Lond. B 237, 37-72. (doi: 10.1098/rstb.1952.0012)
24. von Neumann, J. & Burks, A. W. 1949 Theory of self-reproducing automata. Champaign, IL: University of Illinois Press.
25. Sipper, M. 1988 Fifty years of research on self-replication: an overview. Artif. Life 4, 237-257. (doi:10.1162/106454698568576)
26. Case, J. 1974 Periodicity in generations of automata. Math. Syst. Theory 8, 15-32. (doi:10.1007/BF01761704)
27. Arbib, M. A. 1988 From universal turing machines to self-reproduction. In A half-century survey on the universal Turing machine, pp. 177-189. Oxford, UK: Oxford University Press.
28. Lee, C. 1963 A Turing machine which prints its own code script. In Proc. Symp. on Mathematical Theory of Automata, pp. 155-164. Brooklyn, NY: Brooklyn Polytechnic Press.
29. Thatcher, J. 1963 The construction of a self-describing Turing machine. In Proc. Symp. on Mathematical Theory of Automata, pp. 165-171. Brooklyn, NY: Brooklyn Polytechnic Press.
30. Margenstern, M. & Rogozhin, Y. 2002 Self-describing Turing machines. Fund. Inf. 50, 285-303. (Pubitemid 34772499)
31. Rogers Jr, H. 1967 Theory of recursive functions and effective computability. Cambridge, MA: MIT Press.
32. Thompson, K. 1984 Reflections on trusting trust. Commun. ACM 27, 761-763. (doi:10.1145/358198.358210)
33. Jones, N. 1997 Computability and complexity, from a programming perspective. Cambridge, MA: MIT press.
34. Plotkin, G. D. 1981 A structural approach to operational semantics. Comput. Inf. Sci. 34, DAIMI FN-19.
35. Kahn, G. 1987 Natural semantics. In 4th Ann. Symp. Theoretical Aspects of Computer Sciences, STACS 87, pp. 22-39. Berlin, Germany: Springer.
36. Myhill, J. 1955 Creative sets. Z. Math. Logik Grundl. Math. 1, 97-108. (doi:10.1002/malq. 19550010205)
37. Hansen, T. A., Nikolajsen, T., Träff, J. L. & Jones, N. D. 1989 Experiments with implementations of two theoretical constructions. In Logic at Botik. Lecture Notes in Computer Science, no. 363, pp. 119-133. Berlin, Germany: Springer.
38. Cohen, F. 1987 Computer viruses: theory and experiments. Comput. Secur. 6, 22-35. (doi:10.1016/0167-4048 (87) 90122-2)
39. Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahay, A., Vadhan, S. & Yang, K. 2001 On the (im) possibility of obfuscating programs. In Crypto'01. Lecture Notes in Computer Science, no. 2139. pp. 1-18. Berlin, Germany: Springer.
40. Giacobazzi, R., Jones, N. D. & Mastroeni, I. 2012 Obfuscation by partial evaluation of distorted interpreters. In Proc. ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, PEPM'12, pp. 63-72, New York, NY: ACM. (doi:10.1145/2103746.2103761)
41. Myhill, J. 1964 Abstract theory of self-reproduction. In Views on general systems theory, pp. 106-118. Wiley.