object
BSTreeInterpolator extends TreeInterpolator
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
complicatedSyms(c: Conjunction): Iterator[ConstantTerm]
-
def
computeInts(cert: Certificate, names: Tree[PartName], namedParts: Map[PartName, Conjunction], fors: Tree[Conjunction], symbolTranslation: Tree[Map[ConstantTerm, ConstantTerm]], order: TermOrder): Tree[Conjunction]
-
def
elimLocalSyms(oriProblem: Tree[Conjunction], order: TermOrder, witnesses: ArrayBuffer[ModelElement]): Tree[Conjunction]
-
def
elimSimpleEqs(problem: Tree[Conjunction], order: TermOrder, witnesses: ArrayBuffer[ModelElement]): Tree[Conjunction]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
factorCommonParts(c: Conjunction, order: TermOrder): Conjunction
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
isSimpleEq(lc: LinearCombination): Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
preSimplify(problem: Tree[Conjunction], order: TermOrder): (Tree[Conjunction], Tree[Map[ConstantTerm, ConstantTerm]], Seq[ModelElement])
-
def
propagateSymbols(problem: Tree[Conjunction], order: TermOrder): (Tree[Conjunction], Tree[Map[ConstantTerm, ConstantTerm]])
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
treeInterpolate(oriProblem: Tree[Conjunction], order: TermOrder, fullCEX: Boolean, theories: Seq[Theory]): Either[Tree[Conjunction], Conjunction]
-
def
unzip4[A, B, C, D](l: List[(A, B, C, D)]): (List[A], List[B], List[C], List[D])
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Optimised version of tree interpolation, in which binary search is used to minimise the number of formulas that have to be extracted from a proof