Infections as Abstract Symbolic Finite Automata: Formal Model and Applications

被引:0
|
作者
Preda, Mila Dalla [1 ]
Mastroeni, Isabella [1 ]
机构
[1] Univ Verona, I-37100 Verona, Italy
关键词
(Abstract) Symbolic finite state automata; Infection model; malware detection; BEHAVIOR;
D O I
10.1109/SPRO.2015.18
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we propose a methodology, based on machine learning, for building a symbolic finite state automata-based model of infected systems, that expresses the interaction between the malware and the environment by combining in the same model the code and the semantics of a system and allowing to tune both the system and the malware code observation. Moreover, we show that this methodology may have several applications in the context of malware detection.
引用
收藏
页码:59 / 65
页数:7
相关论文
共 50 条
  • [1] Symbolic model checking of finite precision timed automata
    Yan, RJ
    Li, GY
    Tang, ZS
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005, 2005, 3722 : 272 - 287
  • [2] A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
    D'Antoni, Loris
    Kincaid, Zachary
    Wang, Fang
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2018, 336 : 79 - 99
  • [3] Extended symbolic finite automata and transducers
    D'Antoni, Loris
    Veanes, Margus
    FORMAL METHODS IN SYSTEM DESIGN, 2015, 47 (01) : 93 - 119
  • [4] Extended symbolic finite automata and transducers
    Loris D’Antoni
    Margus Veanes
    Formal Methods in System Design, 2015, 47 : 93 - 119
  • [5] Symbolic Execution with Finite State Automata
    Fulop, Endre
    Pataki, Norbert
    2019 IEEE 15TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATICS (INFORMATICS 2019), 2019, : 293 - 297
  • [6] Automata Over Abstract Finite Quasigroups
    Skobelev V.V.
    Skobelev V.G.
    Cybernetics and Systems Analysis, 2017, 53 (5) : 669 - 674
  • [7] ON CODIFICATION IN FINITE ABSTRACT RANDOM AUTOMATA
    GUIASU, S
    INFORMATION AND CONTROL, 1968, 12 (04): : 277 - &
  • [8] Formal verification of multitasking applications based on timed automata model
    Libor Waszniowski
    Zdeněk Hanzálek
    Real-Time Systems, 2008, 38 : 39 - 65
  • [9] Formal verification of multitasking applications based on timed automata model
    Waszniowski, Libor
    Hanzalek, Zdenek
    REAL-TIME SYSTEMS, 2008, 38 (01) : 39 - 65
  • [10] Applications of finite automata
    Karhumäki, J
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 40 - 58