Run-Time Detection of Malwares via Dynamic Control-Flow Inspection

Author(s):  
Yong-Joon Park ◽  
Zhao Zhang ◽  
Songqing Chen
2020 ◽  
Vol 16 (2) ◽  
pp. 214
Author(s):  
Wang Yong ◽  
Liu SanMing ◽  
Li Jun ◽  
Cheng Xiangyu ◽  
Zhou Wan

Author(s):  
Michael Kramer ◽  
Martin Horauer

Embedded Systems software reliability is increasingly important, therefore methods to harden existing software are needed. In general, hardening software against various failures is a necessity in modern computer systems. A lot of work has been published regarding many possible ways to achieve this non-functional requirement. Relevant topics include, e.g., test procedures, recommended development flows, and hardware measures like watchdog timers. One of these methods seems very promising to be software implemented in modern embedded systems: Control Flow Checking by signatures. Various authors have shown the effectiveness and feasibility of Control Flow Checking (CFC) by signatures for personal computer software. For instance it has been shown for standard computer-systems, that CFC is capable of reducing undetected control flow errors by at least one magnitude. This survey will focus on the applicability of such software hardening methods to embedded systems, while adhering mainly to software based approaches. Published methods will be summarized and compared. Furthermore methods to simplify derived control-flow graphs to essential states will be emphasized. Finally the possibility to apply run-time verification to the Control-flow Checking Software is considered.


Author(s):  
Hung-Chuan Lai ◽  
Shi-Jinn Horng ◽  
Pingzhi Fan ◽  
Xian Wang ◽  
Yi Pan
Keyword(s):  

1998 ◽  
Vol 08 (01) ◽  
pp. 51-62 ◽  
Author(s):  
Lionel Brunie ◽  
Harald Kosch ◽  
Wolfgang Wohner

This paper presents a novel theoretical model for representing parallel relational query processing. It is based on two components. First, a scheme graph, called DPL graph, describes all possible execution dependencies between operators, including communication and run-time control mechanisms. Second, a timed high-level Petri net is used for modeling the data- and control flow of DPL graphs. Our model provides the framework for implementing a parallel query optimizer which is able to access sub-search spaces not yet considered. Furthermore, based on the DPL graphs and its related timed high-level Petri net, a simulation environment has been designed for testing run-time control strategies as well as query optimization methods.


2014 ◽  
Vol 11 (9) ◽  
pp. 31-46 ◽  
Author(s):  
Wenchang Shi ◽  
Hongwei Zhou ◽  
Jinhui Yuan ◽  
Bin Liang

Sign in / Sign up

Export Citation Format

Share Document