English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Since the seminal work from F. Cohen in the eighties, abstract virology hasseen the apparition of successive viral models, all based on Turing-equivalentformalisms. But considering recent malware such as rootkits or k-ary codes,these viral models only partially cover these evolved threats. The problem isthat Turing-equivalent models do not support interactive computations. Newmodels have thus appeared, offering support for these evolved malware, butloosing the unified approach in the way. This article provides a basis for aunified malware model founded on process algebras and in particular theJoin-Calculus. In terms of expressiveness, the new model supports thefundamental definitions based on self-replication and adds support forinteractions, concurrency and non-termination allows the definition of morecomplex behaviors. Evolved malware such as rootkits can now be thoroughlymodeled. In terms of detection and prevention, the fundamental results ofundecidability and isolation still hold. However the process-based model haspermitted to establish new results: identification of fragments from theJoin-Calculus where malware detection becomes decidable, formal definition ofthe non-infection property, approximate solutions to restrict malwarepropagation.

Formalization of malware through process calculi