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 tac

    Common definitions related to the definition and processing of three address code.

    Common definitions related to the definition and processing of three address code.

    Definition Classes
    opalj
  • package fpcf
    Definition Classes
    tac
  • package analyses
    Definition Classes
    fpcf
  • package ide
    Definition Classes
    analyses
  • package ifds
    Definition Classes
    ide
  • package instances
    Definition Classes
    ide
  • package integration
    Definition Classes
    ide
  • package problem
    Definition Classes
    ide
  • package solver
    Definition Classes
    ide
  • JavaBackwardICFG
  • JavaBaseICFG
  • JavaForwardICFG
  • JavaICFG
  • JavaStatement

package solver

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. class JavaBackwardICFG extends JavaBaseICFG

    Interprocedural control flow graph for Java programs in backward direction.

    Interprocedural control flow graph for Java programs in backward direction. This implementation is based on the org.opalj.tac.fpcf.analyses.ifds.JavaBackwardICFG from IFDS.

  2. abstract class JavaBaseICFG extends JavaICFG

    Base interprocedural control flow graph for Java programs.

    Base interprocedural control flow graph for Java programs. This implementation is based on the org.opalj.tac.fpcf.analyses.ifds.JavaICFG from IFDS.

  3. class JavaForwardICFG extends JavaBaseICFG

    Interprocedural control flow graph for Java programs in forward direction.

    Interprocedural control flow graph for Java programs in forward direction. This implementation is based on the org.opalj.tac.fpcf.analyses.ifds.JavaForwardICFG from IFDS.

  4. trait JavaICFG extends ICFG[JavaStatement, Method]

    Interprocedural control flow graph for Java programs.

  5. case class JavaStatement(method: Method, tacIndex: Int, isReturnNode: Boolean = false, stmts: Array[Stmt[JavaStatement.V]], cfg: CFG[Stmt[JavaStatement.V], TACStmts[JavaStatement.V]]) extends Product with Serializable

    Class to model statements used with IDE analyses.

    Class to model statements used with IDE analyses.

    tacIndex

    the index of the statement in the TAC

    isReturnNode

    whether the statement models the return node of a call

Value Members

  1. object JavaStatement extends Serializable

Ungrouped