New Abstract Interpretation Engine | This module defines a set of classes to perform abstract interpretation |
Commands | This page provide documentation about the commands provided by OTAWA: |
Application Writing | OTAWA may be used from an graphical user interface like Eclipse or from the command line |
CFG (Control Flow Graph) | This module allows to represents program as a Control Flow Graph (CFG) |
CLP Analysis | |
Data Flow Analysis | This module provides classes to perform static analysis and Data Flow Analyses (DFA) |
Available Features and Processors | This page provides quick access to analyzes proposed by OTAWA core |
Platform Description | This module provides information about the host platform where the loaded program will run on |
ILP -- Integer Linear Programming | ILP (Integer Linear Programming) is the OTAWA class set dedicated to solving ILP optimization problems |
ExtCons : External Constraint Format | This kinb of file contains constraints that may be added to an IPET computation performed in OTAWA (using the otawa::ipet::ConstraintLoader processor) |
IPET Method | OTAWA provides many code processors supporting IPET approach: |
Parametric Execution Graph | Parametric Execution Graph, or parexegraph, is a way to compute execution of code blocks |
Dynamic Identifier, Feature and Processor | As some identifier, feature and processors are located in plug-ins, they can be retrieved at linking time |
Parametric Features and Processor | Usual features and associated processors are defined for computing exactly one feature |
Processor Layer | The OTAWA Properties System provides a flexible and easy way to store in the program representation the result of different analyses |
Program Representation | |
Contextual Information | OTAWA allows to define properties on a contextual base |
Properties System | The properties are the first-class citizens of the OTAWA core used to annotate a program representation |
Scripts | Writing a chain of analyzes for a specific microprocessor target is a hard path made of the setup of a WCET computation method, analyzes of the target hardware and analyzes of non-standard facilities of the hardware |
Semantic Instructions | OTAWA provides an abstraction layer between the actual binary program and static analyses |
Memory Accesses | This module includes all classes providing information on accessed memories |
Flow Facts | This module addresses the problem of the use of flow facts in OTAWA |
Graph Handling | OTAWA provides several graph implementations and algorithm to use them |
Stack Analysis | This analysis is a very simple analysis using semantic instruction to determine constant values (and adresses) and addresses relative to the initial stack address of the program |
ODisplay Library | This library is delivered with OTAWA to provide graphical display of managed graphs |
bpred Plugin | This module implements a branch prediction analysis based on: |
Data Cache | This module is dedicated to the categorisation of data cache accesses |
AST Plugin | This module provides facilities to handle an executable as an AST (Abstract Syntactic Tree) |
Extended Timing Schema | This WCET computation approach is based on AST representation |
Event Time Module | This module aims to make more generic how events (cache hits/misses, branch prediction, etc) are processed to generate block time |
CFG Input / Output | This plugin is responsible to perform input / output of the CFG collection |
CCG Plugin | CCG (Cache Conflict Graph) provides a method to compute the number of misses of a direct-mapped instruction cache based on a graph representation of the cache states translated as a set of constraints |
branch Plugin | This plugins implements the analysis for branch predictor proposed in paper below: |
Cat Plugin | Implementation of LRU instruction cache analysis by categorisation according to the paper: |