QuantificationTemplates

Type Members

case class Negative(insts: (ast.Trees.Variable, Encoded)) extends Templates.Polarity with Product with Serializable
sealed abstract class Polarity extends AnyRef

Represents the polarity of the quantification within the considered formula.
Represents the polarity of the quantification within the considered formula. Positive and negative polarity enable optimizations during quantifier instantiation.
Unknown polarity is treated conservatively (subsumes both positive and negative cases).
case class Positive(guard: Encoded) extends Templates.Polarity with Product with Serializable
class QuantificationTemplate extends AnyRef
case class Unknown(qs: (ast.Trees.Variable, Encoded), q2s: (ast.Trees.Variable, Encoded), insts: (ast.Trees.Variable, Encoded), guard: Encoded) extends Templates.Polarity with Product with Serializable

Unknown quantification polarity.
Unknown quantification polarity.
Instantiations of unknown polarity quantification with body
```
p
```
follows the schema:
```
q == (q2 && inst)
inst == (guard ==> p)
```
It is useful to keep the two clauses separate so that satisfying assignments can be constructed where only certain inst variables are falsified. This is used to enable a powerful unrolling heuristic in the presence of both quantifiers and recursive functions.
p }}}
```
q == (q2 && inst)
inst == (guard ==> p)
```
It is useful to keep the two clauses separate so that satisfying assignments can be constructed where only certain inst variables are falsified. This is used to enable a powerful unrolling heuristic in the presence of both quantifiers and recursive functions.

Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
object FunctionMatcher
object QuantificationMatcher
object QuantificationTemplate
object QuantificationTypeMatcher
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def correspond(m1: Matcher, m2: Matcher): Option[Boolean]

Attributes
protected
Annotations
@inline()
def correspond(k1: Templates.MatcherKey, k2: Templates.MatcherKey): Option[Boolean]

Attributes
protected
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getFiniteRangeClauses: Clauses
def getGroundInstantiations(e: Encoded, tpe: ast.Trees.Type): Seq[(Encoded, Seq[Encoded])]
def getInstantiationsWithBlockers: Seq[(Encoded, Set[Encoded])]
def getQuantifications: Seq[Templates.Quantification]
def hasQuantifiers: Boolean
def hashCode(): Int

Definition Classes
AnyRef → Any
def instantiateAxiom(template: Templates.LambdaTemplate): Clauses
def instantiateMatcher(blocker: Encoded, matcher: Matcher): Clauses
def instantiateQuantification(template: Templates.QuantificationTemplate): (Map[Encoded, Encoded], Clauses)
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def promoteQuantifications: Unit
def requiresFiniteRangeCheck: Boolean
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package unrolling

trait QuantificationTemplates extends AnyRef

Type Members

case class Negative(insts: (ast.Trees.Variable, Encoded)) extends Templates.Polarity with Product with Serializable

sealed abstract class Polarity extends AnyRef

case class Positive(guard: Encoded) extends Templates.Polarity with Product with Serializable

class QuantificationTemplate extends AnyRef

case class Unknown(qs: (ast.Trees.Variable, Encoded), q2s: (ast.Trees.Variable, Encoded), insts: (ast.Trees.Variable, Encoded), guard: Encoded) extends Templates.Polarity with Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object FunctionMatcher

object QuantificationMatcher

object QuantificationTemplate

object QuantificationTypeMatcher

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def correspond(m1: Matcher, m2: Matcher): Option[Boolean]

def correspond(k1: Templates.MatcherKey, k2: Templates.MatcherKey): Option[Boolean]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getFiniteRangeClauses: Clauses

def getGroundInstantiations(e: Encoded, tpe: ast.Trees.Type): Seq[(Encoded, Seq[Encoded])]

def getInstantiationsWithBlockers: Seq[(Encoded, Set[Encoded])]

def getQuantifications: Seq[Templates.Quantification]

def hasQuantifiers: Boolean

def hashCode(): Int

def instantiateAxiom(template: Templates.LambdaTemplate): Clauses

def instantiateMatcher(blocker: Encoded, matcher: Matcher): Clauses

def instantiateQuantification(template: Templates.QuantificationTemplate): (Map[Encoded, Encoded], Clauses)

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def promoteQuantifications: Unit

def requiresFiniteRangeCheck: Boolean

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped