From Turing machines to computer viruses.
Identifieur interne : 001D33 ( Main/Merge ); précédent : 001D32; suivant : 001D34From Turing machines to computer viruses.
Auteurs : Jean-Yves Marion [France]Source :
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences [ 1364-503X ] ; 2012.
Abstract
Self-replication is one of the fundamental aspects of computing where a program or a system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) recursion theorem is essential to understand self-replication mechanisms. An interesting example of self-replication codes is given by computer viruses. This was initially explained in the seminal works of Cohen and of Adleman in the 1980s. In fact, the different variants of recursion theorems provide and explain constructions of self-replicating codes and, as a result, of various classes of malware. None of the results are new from the point of view of computability theory. We now propose a self-modifying register machine as a model of computation in which we can effectively deal with the self-reproduction and in which new offsprings can be activated as independent organisms.
Url:
DOI: 10.1098/rsta.2011.0332
PubMed: 22711861
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: 000087
- to stream PubMed, to step Curation: 000087
- to stream PubMed, to step Checkpoint: 000085
- to stream Ncbi, to step Merge: 000136
- to stream Ncbi, to step Curation: 000134
- to stream Ncbi, to step Checkpoint: 000134
- to stream Hal, to step Corpus: 002476
- to stream Hal, to step Curation: 002476
- to stream Hal, to step Checkpoint: 001953
Links to Exploration step
pubmed:22711861Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">From Turing machines to computer viruses.</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><nlm:affiliation>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy, France. jean-yves.marion@loria.fr</nlm:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">PubMed</idno><date when="2012">2012</date><idno type="doi">10.1098/rsta.2011.0332</idno><idno type="RBID">pubmed:22711861</idno><idno type="pmid">22711861</idno><idno type="wicri:Area/PubMed/Corpus">000087</idno><idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Corpus" wicri:corpus="PubMed">000087</idno><idno type="wicri:Area/PubMed/Curation">000087</idno><idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Curation">000087</idno><idno type="wicri:Area/PubMed/Checkpoint">000085</idno><idno type="wicri:explorRef" wicri:stream="Checkpoint" wicri:step="PubMed">000085</idno><idno type="wicri:Area/Ncbi/Merge">000136</idno><idno type="wicri:Area/Ncbi/Curation">000134</idno><idno type="wicri:Area/Ncbi/Checkpoint">000134</idno><idno type="wicri:doubleKey">1364-503X:2012:Marion J:from:turing:machines</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00762923</idno><idno type="url">https://hal.inria.fr/hal-00762923</idno><idno type="wicri:Area/Hal/Corpus">002476</idno><idno type="wicri:Area/Hal/Curation">002476</idno><idno type="wicri:Area/Hal/Checkpoint">001953</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001953</idno><idno type="wicri:doubleKey">1364-503X:2012:Marion J:from:turing:machines</idno><idno type="wicri:Area/Main/Merge">001D33</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">From Turing machines to computer viruses.</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><nlm:affiliation>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy, France. jean-yves.marion@loria.fr</nlm:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></analytic><series><title level="j">Philosophical transactions. Series A, Mathematical, physical, and engineering sciences</title><idno type="ISSN">1364-503X</idno><imprint><date when="2012" type="published">2012</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Self-replication is one of the fundamental aspects of computing where a program or a system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) recursion theorem is essential to understand self-replication mechanisms. An interesting example of self-replication codes is given by computer viruses. This was initially explained in the seminal works of Cohen and of Adleman in the 1980s. In fact, the different variants of recursion theorems provide and explain constructions of self-replicating codes and, as a result, of various classes of malware. None of the results are new from the point of view of computability theory. We now propose a self-modifying register machine as a model of computation in which we can effectively deal with the self-reproduction and in which new offsprings can be activated as independent organisms.</div></front></TEI><double doi="10.1098/rsta.2011.0332"><HAL><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">From Turing machines to computer viruses</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-29797" status="VALID"><idno type="RNSR">200918992J</idno><orgName>Theoretical adverse computations, and safety</orgName><orgName type="acronym">CARTE</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/carte</ref></desc><listRelation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno><idno type="ISNI">0000000122597504</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00762923</idno><idno type="halId">hal-00762923</idno><idno type="halUri">https://hal.inria.fr/hal-00762923</idno><idno type="url">https://hal.inria.fr/hal-00762923</idno><idno type="doi">10.1098/rsta.2011.0332</idno><date when="2012">2012</date><idno type="wicri:Area/Hal/Corpus">002476</idno><idno type="wicri:Area/Hal/Curation">002476</idno><idno type="wicri:Area/Hal/Checkpoint">001953</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001953</idno><idno type="wicri:doubleKey">1364-503X:2012:Marion J:from:turing:machines</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">From Turing machines to computer viruses</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-29797" status="VALID"><idno type="RNSR">200918992J</idno><orgName>Theoretical adverse computations, and safety</orgName><orgName type="acronym">CARTE</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/carte</ref></desc><listRelation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno><idno type="ISNI">0000000122597504</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></analytic><idno type="DOI">10.1098/rsta.2011.0332</idno><series><title level="j">Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</title><idno type="ISSN">1364-503X</idno><imprint><date type="datePub">2012</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Self-replication is one of the fundamental aspects of computing where a program or a system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) recursion theorem is essential to understand self-replication mechanisms. An interesting example of self-replication codes is given by computer viruses. This was initially explained in the seminal works of Cohen and of Adleman in the 1980s. In fact, the different variants of recursion theorems provide and explain constructions of self-replicating codes and, as a result, of various classes of malware. None of the results are new from the point of view of computability theory. We now propose a self-modifying register machine as a model of computation in which we can effectively deal with the self-reproduction and in which new offsprings can be activated as independent organisms.</div></front></TEI></HAL><PubMed><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">From Turing machines to computer viruses.</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><nlm:affiliation>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy, France. jean-yves.marion@loria.fr</nlm:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">PubMed</idno><date when="2012">2012</date><idno type="doi">10.1098/rsta.2011.0332</idno><idno type="RBID">pubmed:22711861</idno><idno type="pmid">22711861</idno><idno type="wicri:Area/PubMed/Corpus">000087</idno><idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Corpus" wicri:corpus="PubMed">000087</idno><idno type="wicri:Area/PubMed/Curation">000087</idno><idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Curation">000087</idno><idno type="wicri:Area/PubMed/Checkpoint">000085</idno><idno type="wicri:explorRef" wicri:stream="Checkpoint" wicri:step="PubMed">000085</idno><idno type="wicri:Area/Ncbi/Merge">000136</idno><idno type="wicri:Area/Ncbi/Curation">000134</idno><idno type="wicri:Area/Ncbi/Checkpoint">000134</idno><idno type="wicri:doubleKey">1364-503X:2012:Marion J:from:turing:machines</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">From Turing machines to computer viruses.</title><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation wicri:level="4"><nlm:affiliation>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy, France. jean-yves.marion@loria.fr</nlm:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Université de Lorraine, LORIA, UMR, Vandoeuvre-lès-Nancy</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName><orgName type="university">Université de Lorraine</orgName></affiliation></author></analytic><series><title level="j">Philosophical transactions. Series A, Mathematical, physical, and engineering sciences</title><idno type="ISSN">1364-503X</idno><imprint><date when="2012" type="published">2012</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Self-replication is one of the fundamental aspects of computing where a program or a system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) recursion theorem is essential to understand self-replication mechanisms. An interesting example of self-replication codes is given by computer viruses. This was initially explained in the seminal works of Cohen and of Adleman in the 1980s. In fact, the different variants of recursion theorems provide and explain constructions of self-replicating codes and, as a result, of various classes of malware. None of the results are new from the point of view of computability theory. We now propose a self-modifying register machine as a model of computation in which we can effectively deal with the self-reproduction and in which new offsprings can be activated as independent organisms.</div></front></TEI></PubMed></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001D33 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001D33 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= pubmed:22711861
|texte= From Turing machines to computer viruses.
}}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Merge/RBID.i -Sk "pubmed:22711861" \
| HfdSelect -Kh $EXPLOR_AREA/Data/Main/Merge/biblio.hfd \
| NlmPubMed2Wicri -a InforLorV4
| This area was generated with Dilib version V0.6.33. |  |