Extended Recursion-Based Formalization of Virus Mutation

Philippe Beaucamps 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Computer viruses are programs that can replicate themselves by infecting other programs in a system. Bonfante, Kaczmarek and Marion have recently proposed a classification of viruses which relies on the recursion theory and its recursion theorems. We propose an extension of their formalism to consider in a more practical way the mutation of viruses. In particular, we are interested in modelling any depth of mutation, not just the first two levels. We show that this formalism still relies on recursion theorems, whatever the depth of mutation, even in the case of infinite depth. We also extend furthermore this formalism to model the viability of viral replication, which ensures that an infected program still can propagate the virus. An application of the proposed formalism to the class of combined viruses (multi-part viruses) is studied. Finally, given that metamorphic viruses can be modelled by grammars operating on grammars, we study a recursion-based approach of formal grammars and show that the recursion theorems of the recursion theory can be ported to the formal grammars theory.
Type de document :
Communication dans un congrès
EICAR'08, Jun 2008, Laval, France. 2008, Proceedings of EICAR'08
Liste complète des métadonnées

Contributeur : Philippe Beaucamps <>
Soumis le : lundi 10 novembre 2008 - 21:49:01
Dernière modification le : mardi 18 décembre 2018 - 16:48:02
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:51:30


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00338062, version 1



Philippe Beaucamps. Extended Recursion-Based Formalization of Virus Mutation. EICAR'08, Jun 2008, Laval, France. 2008, Proceedings of EICAR'08. 〈inria-00338062〉



Consultations de la notice


Téléchargements de fichiers