Recognizing malicious software behaviors with tree automata inference
We explore how formal methods and tools of the verification trade could be used for malware detection and analysis. In particular, we propose a new approach to learning and generalizing from observed malware behaviors based on tree automata inference. Our approach infers k -testable tree automata fr...
Gespeichert in:
Veröffentlicht in: | Formal methods in system design 2012-08, Vol.41 (1), p.107-128 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We explore how formal methods and tools of the verification trade could be used for malware detection and analysis. In particular, we propose a new approach to learning and generalizing from observed malware behaviors based on tree automata inference. Our approach infers
k
-testable tree automata from system call dataflow dependency graphs. We show how inferred automata can be used for malware recognition and classification. |
---|---|
ISSN: | 0925-9856 1572-8102 |
DOI: | 10.1007/s10703-012-0149-1 |