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
  • AllBottomEdgeFunction
  • AllTopEdgeFunction
  • EdgeFunction
  • EdgeFunctionResult
  • EmptyFlowFunction
  • FinalEdgeFunction
  • FlowFunction
  • FlowRecorderModes
  • FlowRecordingIDEProblem
  • IDEFact
  • IDEProblem
  • IDEValue
  • IdentityEdgeFunction
  • IdentityFlowFunction
  • InterimEdgeFunction
  • MeetLattice
  • package solver
    Definition Classes
    ide
p

org.opalj.ide

problem

package problem

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. abstract case class AllBottomEdgeFunction[Value <: IDEValue](bottom: Value) extends EdgeFunction[Value] with Product with Serializable

    Special edge function representing an edge function where all source values evaluate to the bottom element.

    Special edge function representing an edge function where all source values evaluate to the bottom element. Implementing composeWith is left to the user, as it requires knowledge of the other possible edge functions.

  2. abstract case class AllTopEdgeFunction[Value <: IDEValue](top: Value) extends EdgeFunction[Value] with Product with Serializable

    Special edge function representing an edge function where all source values evaluate to the top element.

    Special edge function representing an edge function where all source values evaluate to the top element. Implementing composeWith is left to the user, as it requires knowledge of the other possible edge functions.

  3. trait EdgeFunction[+Value <: IDEValue] extends AnyRef

    Interface representing IDE edge functions.

  4. trait EdgeFunctionResult[Value <: IDEValue] extends AnyRef

    Interface for encapsulating different states of edge functions.

  5. case class EmptyFlowFunction[Fact <: IDEFact]() extends FlowFunction[Fact] with Product with Serializable

    Special flow function that always returns an empty set.

  6. case class FinalEdgeFunction[Value <: IDEValue](edgeFunction: EdgeFunction[Value]) extends EdgeFunctionResult[Value] with Product with Serializable

    Represent an edge function that is final.

  7. trait FlowFunction[Fact <: IDEFact] extends AnyRef

    Interface representing IDE flow functions.

  8. class FlowRecordingIDEProblem[Fact <: IDEFact, Value <: IDEValue, Statement, Callable <: Entity] extends IDEProblem[Fact, Value, Statement, Callable]

    Wrapper class for a normal IDE problem for debugging purposes.

    Wrapper class for a normal IDE problem for debugging purposes. Records the flow paths the IDE solver takes for a given base problem as graph and writes it to a file in DOT format.

  9. trait IDEFact extends AnyRef

    Interface representing IDE facts.

  10. abstract class IDEProblem[Fact <: IDEFact, Value <: IDEValue, Statement, Callable <: Entity] extends AnyRef

    Interface for modeling IDE problems.

  11. trait IDEValue extends AnyRef

    Interface representing IDE values.

  12. case class IdentityFlowFunction[Fact <: IDEFact](sourceFact: Fact) extends FlowFunction[Fact] with Product with Serializable

    Special flow function that always returns the input fact.

  13. case class InterimEdgeFunction[Value <: IDEValue](interimEdgeFunction: EdgeFunction[Value], dependees: Set[SomeEOptionP]) extends EdgeFunctionResult[Value] with Product with Serializable

    Represent an interim edge function that may change when the result of one of the dependees changes.

    Represent an interim edge function that may change when the result of one of the dependees changes.

    interimEdgeFunction

    an interim edge function to use until new results are present (has to be an upper bound of the final edge function)

  14. trait MeetLattice[Value <: IDEValue] extends AnyRef

    Interface representing the lattice that orders the IDE values.

Value Members

  1. object FlowFunction
  2. object FlowRecorderModes extends Enumeration

    Different modes to record flow.

  3. case object IdentityEdgeFunction extends EdgeFunction[Nothing] with Product with Serializable

    Special edge function representing an identity edge function.

Ungrouped