Analysis of disassembled executable codes by abstract interpretation

Verifying Timing Behavior by Abstract Interpretation of Executable Code

Many tasks in safety-critical embedded systems have hard real-time characteristics. AbsInt’s worst-case execution time analyzer aiT can estimate precise and safe upper bounds for the WCETs of program tasks, thus providing the basic input for verifying the real-time behavior of embedded applications.

A Space Consumption Analysis by Abstract Interpretation

Safe is a first-order functional language with an implicit region-based memory system and explicit destruction of heap cells. Its static analysis for inferring regions, and a type system guaranteeing the absence of dangling pointers have been presented elsewhere. In this paper we present a new analysis aimed at inferring upper bounds for heap and stack consumption. It is based on abstract inter...

Algebraic Power Analysis by Abstract Interpretation

In this paper we design abstract domains for power analysis. These domains are conceived to discover properties of the following type: “The variable X at a given program point is the power of c with the exponent having a given property π”, where c and π are automatically determined. This construction is general and includes different algebraic entities, such as numerical and polynomial (with ra...

Checking Timing Behavior and Memory Usage by Abstract Interpretation of Executable Code

Reachability-based acyclicity analysis by Abstract Interpretation

In programming languages with dynamic use of memory, such as Java, knowing that a reference variable x points to an acyclic data structure is valuable for the analysis of termination and resource usage (e.g., execution time ormemory consumption). For instance, this information guarantees that the depth of the data structure to which x points is greater than the depth of the data structure point...

SEA: String Executability Analysis by Abstract Interpretation

Dynamic languages often employ reflection primitives to turn dynamically generated text into executable code at run-time. These features make standard static analysis extremely hard if not impossible because its essential data structures, i.e., the control-flow graph and the system of recursive equations associated with the program to analyse, are themselves dynamically mutating objects. We int...