Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1945
Title: Undecidable Problems in Malware Analysis
Authors: Selçuk, Ali Aydın
Orhan, Fatih
Batur, Berker
125410
Keywords: Computer viruses
malware analysis
virus detection
undecidability
Issue Date: 2017
Publisher: IEEE
Source: Selçuk, A. A., Orhan, F., & Batur, B. (2017, December). Undecidable problems in malware analysis. In 2017 12th International Conference for Internet Technology and Secured Transactions (ICITST) (pp. 494-497). IEEE.
Abstract: Malware analysis is a challenging task in the theory as well as the practice of computer science. Many important problems in malware analysis have been shown to be undecidable. These problems include virus detection, detecting unpacking execution, matching malware samples against a set of given templates, and detecting trigger-based behavior. In this paper, we will give a review of the undecidability results in malware analysis and discuss what can be done in practice.
Description: 12th International Conference for Internet Technology and Secured Transactions (2017 : Cambridge; United Kingdom)
URI: https://ieeexplore.ieee.org/document/8356458
https://hdl.handle.net/20.500.11851/1945
ISBN: 978-1-9083-2093-3
ISSN: 2164-7046
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
selcuk-Undecidable.pdf273.09 kBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

SCOPUSTM   
Citations

5
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

6
checked on Feb 4, 2023

Page view(s)

50
checked on Dec 26, 2022

Download(s)

32
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.