Formalization of viruses and malware through process algebras

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Abstract virology has seen the apparition of successive viral models, all based on Turing-equivalent formalisms. Considering recent malware, these are only partially covered because functional formalisms do not support interactive computations. This article provides a basis for a unified malware model, founded on the Join-Calculus. In terms of expressiveness, the process-based model supports the fundamental notion of self-replication but also interactions, concurrency and non-termination to cover evolved malware. In terms of protection, detection undecidability and prevention by isolation still hold. Additional results are established: calculus fragments where detection is decidable, definition of a non-infection property, potential solutions to restrict propagation.

Original languageEnglish
Title of host publicationARES 2010 - 5th International Conference on Availability, Reliability, and Security
PublisherIEEE Computer Society
Pages597-602
Number of pages6
ISBN (Print)9780769539652
DOIs
Publication statusPublished - 1 Jan 2010
Externally publishedYes
Event5th International Conference on Availability, Reliability, and Security, ARES 2010 - Krakow, Poland
Duration: 15 Feb 201018 Feb 2010

Publication series

NameARES 2010 - 5th International Conference on Availability, Reliability, and Security

Conference

Conference5th International Conference on Availability, Reliability, and Security, ARES 2010
Country/TerritoryPoland
CityKrakow
Period15/02/1018/02/10

Keywords

  • Detection
  • Malware
  • Prevention
  • Process algebra

Fingerprint

Dive into the research topics of 'Formalization of viruses and malware through process algebras'. Together they form a unique fingerprint.

Cite this