Packages

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

    The fixpoint computations framework (fpcf) is a general framework to perform fixpoint computations of properties ordered by a lattice.

    The fixpoint computations framework (fpcf) is a general framework to perform fixpoint computations of properties ordered by a lattice. The framework in particular supports the development of static analyses.

    In this case, the fixpoint computations/static analyses are generally operating on the code and need to be executed until the computations have reached their (implicit) fixpoint. The fixpoint framework explicitly supports resolving cyclic dependencies/computations. A prime use case of the fixpoint framework are all those analyses that may interact with the results of other analyses.

    For example, an analysis that analyzes all field write accesses to determine if we can refine a field's type (for the purpose of the analysis) can (reuse) the information about the return types of methods, which however may depend on the refined field types.

    The framework is generic enough to facilitate the implementation of anytime algorithms.

    Definition Classes
    opalj
    Note

    This framework assumes that all data-structures (e.g., dependee lists and properties) that are passed to the framework are effectively immutable! (Effectively immutable means that a data structure is never updated after it was passed to the framework.)

    ,

    The dependency relation is as follows: “A depends on B” === “A is the depender, B is the dependee”. === “B is depended on by A”

    ,

    The very core of the framework is described in: Lattice Based Modularization of Static Analyses

  • package par
    Definition Classes
    fpcf
  • package seq
    Definition Classes
    fpcf
  • HandleResultTask
  • OnFinalUpdateComputationTask
  • OnUpdateComputationTask
  • PKESequentialPropertyStore
  • PropertyComputationTask
  • PropertyStoreDependentTasksManager
  • QualifiedTask
  • SeqPropertyStore
  • TasksManager

package seq

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. All

Type Members

  1. final case class HandleResultTask[E <: Entity, P <: Property](ps: PropertyStore, r: PropertyComputationResult) extends QualifiedTask with Product with Serializable
  2. final case class OnFinalUpdateComputationTask[E <: Entity, P <: Property](ps: PropertyStore, r: FinalEP[E, P], c: OnUpdateContinuation) extends QualifiedTask with Product with Serializable
  3. final case class OnUpdateComputationTask[E <: Entity, P <: Property](ps: PropertyStore, epk: EPK[E, P], c: OnUpdateContinuation) extends QualifiedTask with Product with Serializable
  4. final class PKESequentialPropertyStore extends SeqPropertyStore

    A reasonably optimized, complete, but non-concurrent implementation of the property store.

    A reasonably optimized, complete, but non-concurrent implementation of the property store. Primarily intended to be used for evaluation, debugging and prototyping purposes.

  5. final case class PropertyComputationTask[E <: Entity](ps: PropertyStore, e: E, pc: PropertyComputation[E]) extends QualifiedTask with Product with Serializable
  6. trait PropertyStoreDependentTasksManager extends TasksManager
  7. sealed abstract class QualifiedTask extends () ⇒ Unit

    Encapsulates different tasks.

  8. abstract class SeqPropertyStore extends PropertyStore

    Non-concurrent implementation of the property store.

  9. trait TasksManager extends AnyRef

Value Members

  1. object PKESequentialPropertyStore extends PropertyStoreFactory[PKESequentialPropertyStore]

    Factory for creating PKESequentialPropertyStores.

    Factory for creating PKESequentialPropertyStores.

    The task manager that will be used to instantiate the project will be extracted from the PropertyStoreContext if the context contains a Config object. The fallback is the ManyDirectDependersLastTasksManager.

Ungrouped