Executable code metamorthic transformation model

Бесплатный доступ

In the paper built model of metamorphic transformation of executable code by using finite automatons and formal grammars. This is a new model which considers code-growing and code-shrinking techniques. The statement about static undetectable of viruses built by described method is proved.

Computer virus, metamorphism, polymorphism, mathematical model, formal grammar, finite automaton

Короткий адрес: https://sciup.org/147154662

IDR: 147154662

Статья научная