Class

ap.interpolants

SoftwareInterpolationFramework

Related Doc: package interpolants

Permalink

abstract class SoftwareInterpolationFramework extends AnyRef

Abstract class providing some functionality commonly needed for interpolation-based software verification, e.g., axioms and prover for bitvector arithmetic, arrays, etc.

Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SoftwareInterpolationFramework
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SoftwareInterpolationFramework()

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def dumpInterpolationProblem(transitionParts: Map[PartName, Conjunction], sig: Signature): Unit

    Permalink
    Attributes
    protected
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. val frameworkVocabulary: FrameworkVocabulary

    Permalink
    Attributes
    protected
  11. def genInterpolants(formulas: Seq[Conjunction], commonFormula: Conjunction, order: TermOrder): Either[Conjunction, Iterator[Conjunction]]

    Permalink
    Attributes
    protected
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. var interpolationProblemBasename: String

    Permalink
    Attributes
    protected
  15. var interpolationProblemNum: Int

    Permalink
    Attributes
    protected
  16. lazy val interpolationProver: IncProver

    Permalink
    Attributes
    protected
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. def parseAndSimplify(input: Reader): (Map[PartName, Conjunction], Signature)

    Permalink

    Read a given problem, split it into the different parts, try to simplify bitvector expressions as far as possible, and convert it to internal presentation.

    Read a given problem, split it into the different parts, try to simplify bitvector expressions as far as possible, and convert it to internal presentation. Bitvector simplifications are done based on the type declarations inSigned, inUnsigned, and inArray. The problem will also be restructured such that the type declaration of a constant occurs in the first part in which the constant is used (sorted the partitions lexicographically according to their name).

    Attributes
    protected
  22. def parseProblem(reader: Reader): (IFormula, Signature)

    Permalink
    Attributes
    protected
  23. val preludeSignature: Signature

    Permalink
    Attributes
    protected
  24. def simplifyBitvectorFor(f: IFormula, typeAssumptions: IFormula): IFormula

    Permalink
    Attributes
    protected
  25. def sortNamesLex[A](transitionParts: Map[PartName, A]): Seq[PartName]

    Permalink

    Sort the transition relations lexicographically according to their name; NO_NAME is ignored and removed

    Sort the transition relations lexicographically according to their name; NO_NAME is ignored and removed

    Attributes
    protected
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  27. def toInputAbsyAndSimplify(c: Conjunction): IFormula

    Permalink
    Attributes
    protected
  28. def toInternal(f: IFormula, sig: Signature): (Conjunction, TermOrder)

    Permalink
    Attributes
    protected
  29. def toNamedParts(f: IFormula, sig: Signature): (Map[PartName, Conjunction], Signature)

    Permalink
    Attributes
    protected
  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. lazy val validityCheckProver: IncProver

    Permalink
    Attributes
    protected
  32. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped