Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure - org.opalj.bi) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler - org.opalj.da).
    • a library to convert this representation to Java class files (Bytecode Creator - org.opalj.bc).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a library to create a stackless, three-address code representation of Java bytecode that facilitates writing complex static analyses (Three Address Code - org.opalj.tac).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements (Dependencies Extraction - org.opalj.de) and to facilitate checking architecture definitions (Architecture Validation - org.opalj.av).
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler - org.opalj.ba).
    • a library for parsing Android packages (APK - org.opalj.apk).
    • libraries for writing static analyses using the interprocedural finite distributive subset (IFDS - org.opalj.ifds) and interprocedural distributive environment (IDE - org.opal.ide) algorithms.

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package ide

    Definition Classes
    opalj
  • package ifds
    Definition Classes
    ide
  • package integration
    Definition Classes
    ide
  • package problem
    Definition Classes
    ide
  • package solver
    Definition Classes
    ide
  • ICFG
  • IDEAnalysis
  • IDEAnalysisProxy

package solver

Type Members

  1. trait ICFG[Statement, Callable <: Entity] extends AnyRef

    Interface representing the interprocedural control flow graph.

  2. class IDEAnalysis[Fact <: IDEFact, Value <: IDEValue, Statement, Callable <: Entity] extends FPCFAnalysis

    This is a solver for IDE problems.

    This is a solver for IDE problems. It is based on the exhaustive algorithm that was presented in the original IDE paper from 1996 as base. The paper can be found here. Naming of methods and variables follows the naming used in the original paper as far as possible. The original solver is enhanced with several extensions/features as part of the master thesis of Robin Körkemeier. The most important enhancements are:

    • The possibility to specify additional analysis seeds (allowing for more precise analysis results).
    • The possibility to provide custom summaries for arbitrary call statements (allowing to retain precision in presence of unavailable code as well as to improve performance).
    • On-demand solver execution, to fully integrate into OPAL as a lazy analysis (improves performance especially in interacting analysis scenarios; does not affect how IDE problems are specified).
    • The possibility to define interacting IDE analysis (resp. IDE problems that make use of analysis interaction) using the blackboard architecture provided by OPAL.

    For a simple example IDE problem definition have a look at LinearConstantPropagationProblem in the TAC module of this project. It implements a basic linear constant propagation as described in the original IDE paper. For an example of interacting IDE problems have a look at LCPOnFieldsProblem and LinearConstantPropagationProblemExtended. These are an extension of the basic linear constant propagation and capable of detecting and tracking constants in fields. They also are an example for cyclic analysis interaction.

  3. class IDEAnalysisProxy[Fact <: IDEFact, Value <: IDEValue, Statement, Callable <: Entity] extends FPCFAnalysis

    A proxy for IDE analyses that accepts analysis requests for callables as well as statement-callable combinations.

    A proxy for IDE analyses that accepts analysis requests for callables as well as statement-callable combinations. The IDEAnalysis solver runs on callables only and additionally produces results for each statement of that callable. This proxy analysis reduces all analysis requests to the callable and then forwards them to the actual IDE solver.

Ungrouped