Loading...
Please wait, while we are loading the content...
Similar Documents
Metamorphism, formal grammars and undecidable code mutation.
| Content Provider | CiteSeerX |
|---|---|
| Abstract | Abstract — This paper presents a formalisation of the different existing code mutation techniques (polymorphism and metamorphism) by means of formal grammars. While very few theoretical results are known about the detection complexity of viral mutation techniques, we exhaustively address this critical issue by considering the Chomsky classification of formal grammars. This enables us to determine which family of code mutation techniques are likely to be detected or on the contrary are bound to remain undetected. As an illustration we then present, on a formal basis, a proof-of-concept metamorphic mutation engine denoted PB MOT, whose detection has been proven to be undecidable. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Formal Grammar Undecidable Code Mutation Theoretical Result Proof-of-concept Metamorphic Mutation Engine Code Mutation Technique Detection Complexity Critical Issue Viral Mutation Technique Chomsky Classification Pb Mot Formal Basis |
| Content Type | Text |
| Resource Type | Article |
