PreOp

Abstract Value Members

abstract def apply(argumentConstraints: Seq[Seq[Automaton]], resultConstraint: Automaton): (Iterator[Seq[Automaton]], Seq[Seq[Automaton]])

Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that
Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that
- returned constraints are contained in the pre-image: any word tuple accepted by any of the returned automata tuples is mapped by the function to a word accepted by the result constraint
- returned constraints subsume the pre-image intersected with the existing argument constraints: whenever a word tuple is accepted by the given argument constraints, and is mapped by the function to a word accepted by the result constraint, then the word tuple is also accepted by one of the returned constraints
If the result depends on the given argumentConstraints, then the used constraints also have to be returned as second result component.
abstract def eval(arguments: Seq[Seq[Int]]): Option[Seq[Int]]

Evaluate the described function; return None if the function is not defined for the given arguments.
Evaluate the described function; return None if the function is not defined for the given arguments.

Concrete 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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def charCountApproximation(char: Int, arguments: Seq[Term], result: Term, order: TermOrder): Formula

Generate a formula that approximates the character count (= Parikh) relationship between arguments and result, for one particular letter char.
Generate a formula that approximates the character count (= Parikh) relationship between arguments and result, for one particular letter char. It is sound to just return true. The parameters arguments and result are terms representing the length of the string arguments.
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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] )
def forwardApprox(argumentConstraints: Seq[Seq[Automaton]]): Automaton

Given constraints on the input variables, produce an over-approximation constraint on the output.
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lengthApproximation(arguments: Seq[Term], result: Term, order: TermOrder): Formula

Generate a formula that approximates the length relationship between arguments and result.
Generate a formula that approximates the length relationship between arguments and result. It is sound to just return true. The parameters arguments and result are terms representing the length of the string arguments.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
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 preop

trait PreOp extends AnyRef

Abstract Value Members

abstract def apply(argumentConstraints: Seq[Seq[Automaton]], resultConstraint: Automaton): (Iterator[Seq[Automaton]], Seq[Seq[Automaton]])

abstract def eval(arguments: Seq[Seq[Int]]): Option[Seq[Int]]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def charCountApproximation(char: Int, arguments: Seq[Term], result: Term, order: TermOrder): Formula

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def forwardApprox(argumentConstraints: Seq[Seq[Automaton]]): Automaton

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lengthApproximation(arguments: Seq[Term], result: Term, order: TermOrder): Formula

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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