Packages

  • package root
    Definition Classes
    root
  • package ap

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    root
  • package theories

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    ap
  • package heaps
    Definition Classes
    theories
  • ArrayHeap
  • Heap
  • NativeHeap

trait Heap extends Theory with SMTLinearisableTheory

Trait implemented by the different heap theories.

Linear Supertypes
SMTLinearisableTheory, Theory, AnyRef, Any
Known Subclasses
ArrayHeap, NativeHeap
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Heap
  2. SMTLinearisableTheory
  3. Theory
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract val AddressSort: Sort

    Sort of addresses in this heap theory.

  2. abstract val HeapAddressPairSort: Sort

    Result sort of the allocation function.

  3. abstract val HeapRangePairSort: Sort

    Result sort of the range allocation function.

  4. abstract val HeapSort: Sort

    Sort of heaps in this heap theory.

  5. abstract val ObjectSort: Sort

    Sort of objects stored on the heap.

    Sort of objects stored on the heap. This sort is one of the elements of userHeapSorts.

  6. abstract val RangeSort: Sort

    Sort of address ranges in this heap theory.

  7. abstract val addr: IFunction

    A function to enumerate the addresses that can be used on this heap.

    A function to enumerate the addresses that can be used on this heap. addr(1) is the address returned by the first call to alloc, addr(2) the second address, etc. Applying the function to zero or to negative values should be treated as a synonym for nullAddr.

  8. abstract val alloc: IFunction

    Function to allocate new objects on the heap.

  9. abstract val allocRange: IFunction

    Function to allocate a sequence of objects on the heap.

  10. abstract val axioms: Formula

    Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

    Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

    Definition Classes
    Theory
  11. abstract val defaultObject: ITerm

    The object stored on the heap at not yet allocated locations.

  12. abstract val emptyHeap: IFunction

    Constant representing empty heaps.

  13. abstract val functionPredicateMapping: Seq[(IFunction, Predicate)]

    Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

    Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

    Definition Classes
    Theory
  14. abstract val functionalPredicates: Set[Predicate]

    Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

    Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

    Definition Classes
    Theory
  15. abstract val functions: Seq[IFunction]

    Interpreted functions of the theory

    Interpreted functions of the theory

    Definition Classes
    Theory
  16. abstract def hasUserHeapCtor(t: ITerm, id: Int): IFormula

    Tester for the user-declared heap constructors.

    Tester for the user-declared heap constructors. The ids expected by the tester coincide with the positions in the sequence userHeapCtors.

  17. abstract val heapAddrPair_1: IFunction

    Function to obtain the new heap after allocation.

  18. abstract val heapAddrPair_2: IFunction

    Function to obtain the new address after allocation.

  19. abstract val heapRangePair_1: IFunction

    Function to obtain the new heap after range allocation.

  20. abstract val heapRangePair_2: IFunction

    Function to obtain the new address range after range allocation.

  21. abstract def heapRelatedSymbols: (Set[IFunction], Set[Predicate])

    Method to query all functions and predicates of the theory, including API, internal symbols, and symbols of the constituent theories.

  22. abstract val nextAddr: IFunction

    A function to enumerate the next addresses that will be returned by the alloc function.

    A function to enumerate the next addresses that will be returned by the alloc function. The next address that can be allocated is nextAddr(h, 0), then nextAddr(h, 1), etc. Applying the function to negative integers returns the last addresses that have been allocated: nextAddr(h, -1) is the last address that has been allocated on h, nextAddr(h, -2) the address before that, etc. Since a heap only has finitely many allocated addresses, for two small n, the result of nextAddr(h, n) is nullAddr.

    addr(k) is a synonym for nextAddr(emptyHeap, k - 1).

  23. abstract val nullAddr: IFunction

    Constant representing the null address.

  24. abstract def plugin: Option[Plugin]

    Optionally, a plug-in implementing reasoning in this theory

    Optionally, a plug-in implementing reasoning in this theory

    Definition Classes
    Theory
  25. abstract val predicateMatchConfig: PredicateMatchConfig

    Information how interpreted predicates should be handled for e-matching.

    Information how interpreted predicates should be handled for e-matching.

    Definition Classes
    Theory
  26. abstract val predicates: Seq[Predicate]

    Interpreted predicates of the theory

    Interpreted predicates of the theory

    Definition Classes
    Theory
  27. abstract val range: IFunction

    A function to enumerate range of the addresses that can be used on this heap.

    A function to enumerate range of the addresses that can be used on this heap. range(1, n) is a range of addresses starting at the address addr(1) of size n. Applying the function to a start address that is not positive or size that is not non-negative should be interpreted as an empty address range.

  28. abstract val rangeNth: IFunction

    Function to obtain the n'th address in an address range.

    Function to obtain the n'th address in an address range. Accessing addresses outside of the range will return nullAddr.

  29. abstract val rangeSize: IFunction

    Function to obtain the number of addresses in an address range.

  30. abstract val rangeWithin: Predicate

    Predicate to test whether an address belongs to an address range.

  31. abstract val read: IFunction

    Function to read from the heap.

  32. abstract val totalityAxioms: Formula

    Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

    Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

    Definition Classes
    Theory
  33. abstract val triggerRelevantFunctions: Set[IFunction]

    A list of functions that should be considered in automatic trigger generation

    A list of functions that should be considered in automatic trigger generation

    Definition Classes
    Theory
  34. abstract val userHeapConstructors: IndexedSeq[MonoSortedIFunction]

    Constructors declared as part of the heap ADT.

  35. abstract val userHeapCtorSignatures: Seq[(String, CtorSignature)]

    User-specified constructor declarations.

  36. abstract val userHeapSelectors: IndexedSeq[Seq[MonoSortedIFunction]]

    Selectors declared as part of the heap ADT.

  37. abstract val userHeapSorts: IndexedSeq[Sort]

    Sorts declared as part of the heap ADT.

  38. abstract val userHeapUpdators: IndexedSeq[Seq[MonoSortedIFunction]]

    Updators declared as part of the heap ADT.

  39. abstract val valid: Predicate

    Predicate to test whether an address is valid (allocated and non-null) in a given heap.

  40. abstract val write: IFunction

    Function to write to the heap.

  41. abstract val writeRange: IFunction

    Function to overwrite objects within an address range.

Concrete 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. def SMTDeclarationSideEffects: Seq[Theory]

    A list of (other) theories that are implicitly declared as a side-effect of declaring this theory.

    A list of (other) theories that are implicitly declared as a side-effect of declaring this theory. We assume that theories can implicitly define some of their dependencies, but not vice versa.

    Definition Classes
    Heap → SMTLinearisableTheory
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  7. val dependencies: Iterable[Theory]

    Optionally, other theories that this theory depends on.

    Optionally, other theories that this theory depends on. Specified dependencies will be loaded before this theory, but the preprocessors of the dependencies will be called after the preprocessor of this theory.

    Definition Classes
    Theory
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def evalFun(f: IFunApp): Option[ITerm]

    Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

    Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

    Definition Classes
    Theory
  11. def evalPred(p: IAtom): Option[Boolean]

    Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

    Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

    Definition Classes
    Theory
  12. def evaluatingSimplifier(t: IExpression): IExpression

    A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively).

    A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively). This is used in the Theory.postSimplifiers methods.

    Definition Classes
    Theory
  13. def extend(order: TermOrder): TermOrder

    Add the symbols defined by this theory to the order

    Add the symbols defined by this theory to the order

    Definition Classes
    Theory
  14. def fun2SMTString(f: IFunction): Option[String]

    Translate a function belonging to this theory to an SMT-LIB identifier.

    Translate a function belonging to this theory to an SMT-LIB identifier.

    Definition Classes
    SMTLinearisableTheory
  15. def generateDecoderData(model: Conjunction): Option[TheoryDecoderData]

    If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

    If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

    Definition Classes
    Theory
  16. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  18. def iPostprocess(f: IFormula, signature: Signature): IFormula

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the formula after calling Internal2Inputabsy.

    Definition Classes
    Theory
  19. def iPreprocess(f: IFormula, signature: Signature): (IFormula, Signature)

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.

    Definition Classes
    Theory
  20. def isAlloc: Predicate

    Predicate to test whether an address is valid (allocated and non-null) in a given heap.

    Predicate to test whether an address is valid (allocated and non-null) in a given heap. Synonym for valid.

  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. def isSoundForSat(theories: Seq[Theory], config: Theory.SatSoundnessConfig.Value): Boolean

    Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

    Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

    Definition Classes
    Theory
  23. val modelGenPredicates: Set[Predicate]

    Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory.

    Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atom p(x), for p in this set, then the PresburgerModelFinder will ignore x when assigning concrete values to symbols.

    Definition Classes
    Theory
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  27. lazy val objectSortIndex: Int

    The index of the ObjectSort among the userHeapSorts.

  28. def postSimplifiers: Seq[(IExpression) => IExpression]

    Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.

    Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by ap.parser.Simplifier. By default, this list will only include the evaluatingSimplifier.

    Definition Classes
    Theory
  29. def postprocess(f: Conjunction, signature: Signature): Conjunction

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the raw formulas, before calling Internal2Inputabsy.

    Definition Classes
    Theory
  30. def pred2SMTString(p: Predicate): Option[String]

    Translate a predicate belonging to this theory to an SMT-LIB identifier.

    Translate a predicate belonging to this theory to an SMT-LIB identifier.

    Definition Classes
    SMTLinearisableTheory
  31. def preprocess(f: Conjunction, signature: Signature): Conjunction

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Definition Classes
    Theory
  32. def printSMTDeclaration: Unit

    Overrides to make Heap SMT-linearisable

    Overrides to make Heap SMT-linearisable

    Definition Classes
    Heap → SMTLinearisableTheory
  33. val reducerPlugin: ReducerPluginFactory

    Optionally, a plugin for the reducer applied to formulas both before and during proving.

    Optionally, a plugin for the reducer applied to formulas both before and during proving.

    Definition Classes
    Theory
  34. val singleInstantiationPredicates: Set[Predicate]

    When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

    When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

    Definition Classes
    Theory
  35. def sort2SMTType(s: Sort): Option[SMTType]

    Translate a sort belonging to this theory to an SMT type.

    Translate a sort belonging to this theory to an SMT type.

    Definition Classes
    SMTLinearisableTheory
  36. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  37. def toString(): String
    Definition Classes
    AnyRef → Any
  38. lazy val transitiveDependencies: Iterable[Theory]

    Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

    Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

    Definition Classes
    Theory
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  41. 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

    (Since version 9)

Inherited from SMTLinearisableTheory

Inherited from Theory

Inherited from AnyRef

Inherited from Any

Ungrouped