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 solver
    Definition Classes
    ide
  • ICFG
  • IDEAnalysis
  • IDEAnalysisProxy
c

org.opalj.ide.solver

IDEAnalysis

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

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.

Source
IDEAnalysis.scala
Linear Supertypes
FPCFAnalysis, ProjectBasedAnalysis, FPCFAnalysis, ProjectBasedAnalysis, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IDEAnalysis
  2. FPCFAnalysis
  3. ProjectBasedAnalysis
  4. FPCFAnalysis
  5. ProjectBasedAnalysis
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new IDEAnalysis(project: SomeProject, problem: IDEProblem[Fact, Value, Statement, Callable], icfg: ICFG[Statement, Callable], propertyMetaInformation: IDEPropertyMetaInformation[Fact, Value, Statement, Callable])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. final def ch: ClassHierarchy
    Definition Classes
    ProjectBasedAnalysis
  6. implicit final def classHierarchy: ClassHierarchy
    Definition Classes
    ProjectBasedAnalysis
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  12. val icfg: ICFG[Statement, Callable]
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. implicit final def logContext: LogContext
    Definition Classes
    ProjectBasedAnalysis
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  18. implicit def p: SomeProject
    Definition Classes
    ProjectBasedAnalysis → ProjectBasedAnalysis
  19. def performAnalysis(entity: Entity): ProperPropertyComputationResult

    Run the IDE solver and calculate (and return) the result.

    Run the IDE solver and calculate (and return) the result. This method should only be triggered in combination with the IDE proxy!

    entity

    Expected to be None. Other values do not cause errors but will only return empty (temporary) results.

    returns

    a result for each statement of the target callables plus one result for each target callable itself (combining the results of all exit statements)

  20. val problem: IDEProblem[Fact, Value, Statement, Callable]
  21. val project: SomeProject
    Definition Classes
    IDEAnalysis → ProjectBasedAnalysis → ProjectBasedAnalysis
  22. val propertyMetaInformation: IDEPropertyMetaInformation[Fact, Value, Statement, Callable]
  23. implicit final val propertyStore: PropertyStore
    Definition Classes
    FPCFAnalysis
  24. final def ps: PropertyStore
    Definition Classes
    FPCFAnalysis
  25. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @Deprecated
    Deprecated

Inherited from FPCFAnalysis

Inherited from ProjectBasedAnalysis

Inherited from FPCFAnalysis

Inherited from ProjectBasedAnalysis

Inherited from AnyRef

Inherited from Any

Ungrouped