Adversarial Reachability for Program-level Security Analysis
نویسندگان
چکیده
Abstract Many program analysis tools and techniques have been developed to assess vulnerability. Yet, they are based on the standard concept of reachability represent an attacker able craft smart legitimate input, while in practice attackers can be much more powerful, using for instance micro-architectural exploits or fault injection methods. We introduce adversarial , a framework allowing reason about such advanced check whether system is vulnerable immune particular attacker. As equipping with new capacities significantly increases state space under analysis, we present symbolic exploration algorithm, namely execution injecting faults forkless manner prevent path explosion, together optimizations dedicated reduce number injections consider keeping same power. Experiments representative benchmarks from show that our method reduces paths explore, scale up 10 where prior work timeout 3 faults. In addition, analyze well-tested WooKey bootloader, demonstrate ability find attacks evaluate countermeasures real-life security scenarios. were especially attack not mentioned previous patch.
منابع مشابه
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are amenable to this treatment include program slicing, certain dataflow-analysis problems, and the problem of approximating the possible "shapes" that heap-allocated structures in a program can take on. Relationships betwee...
متن کاملStatic Program Analysis for Security
In this chapter, we discuss static analysis of the security of a system. First, we discuss the background on what types of static analysis is feasible in principle and then move on to what is practical. We next discuss static analysis of buffer overflow and mobile code followed by access control. Finally, we discuss static analysis of information flow expressed in a language that has been annot...
متن کاملIntegrating Low Level Symmetries into Reachability Analysis
We present three methods for the integration of symmetries into reachability analysis. Two of them lead to perfect reduction but their runtime depends on the symmetry structure. The third one works always fast but does not always yield perfect reduction.
متن کاملLow-Level Program Verification using Matching Logic Reachability
Matching logic reachability is an emerging verification approach which uses a language-independent proof system to prove program properties based on the operational semantics. In this paper we apply this approach in the context of a low-level real-time language with interrupts, in which each instruction takes a specified time to execute. In particular, we verify that if the interrupts are sched...
متن کاملIntegrating Low Level Symmetries into Reachability Analysis
We present three methods for the integration of symmetries into reachability analysis Two of them lead to perfect reduction but their runtime depends on the symmetry structure The third one works always fast but does not always yield perfect reduction
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-30044-8_3