|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface MvSet
This is a generic interface that represents an mvset. We treat an mvset as a function from L^n -> L where L is a set (possibly a lattice) and n is the arrity of the function
Field Summary | |
---|---|
static int |
EQ
|
static int |
EXISTS
|
static int |
FORALL
|
static int |
GEQ
|
static int |
IMPL
|
static int |
INFO_AND
|
static int |
INFO_OR
|
static int |
JOIN
|
static int |
LEQ
|
static int |
MEET
|
static int |
NEG
|
Method Summary | |
---|---|
MvSet |
and(MvSet v)
Utility functions |
MvSet |
cofactor(AlgebraValue[] r)
Restricts the MvSet to a particular L^n (or set of permutations on L^n if r is not total) |
MvSet |
cofactor(int argIdx,
AlgebraValue value)
Restricts an argument h (x_0, x_1, x_2, ...) = f (x_0, ..., value, ...) where value is substituted at argIdx |
MvSet |
cofactor(MvSet point)
|
java.util.Iterator |
cubeIterator()
|
MvSet |
eq(MvSet v)
|
AlgebraValue |
evaluate(AlgebraValue[] values)
Evaluates this function on an input result = f (values [0], values [1], ...) |
MvSet |
existAbstract(MvSet cube)
|
MvSet |
forallAbstract(MvSet cube)
|
MvSet |
geq(MvSet v)
|
IAlgebra |
getAlgebra()
gets the lattice for the MvSet |
MvSetFactory |
getFactory()
gets the factory |
java.util.BitSet |
getImage()
|
java.util.Set |
getPreImageArray(AlgebraValue v)
Evaluates this function with respect to a state Note that we have a small discreptancy between what we mean by states since here a state may contain primed and unprimed variables and thus represent a transition rather than a state |
AlgebraValue |
getValue()
|
MvSet |
impl(MvSet v)
|
MvSet |
infoAnd(MvSet v)
|
MvSet |
infoNot()
|
MvSet |
infoOr(MvSet v)
|
boolean |
isConstant()
|
MvSet |
leq(MvSet v)
|
java.util.Iterator |
mintermIterator(MvSet vars,
AlgebraValue val)
|
MvSet |
not()
|
MvSet |
or(MvSet v)
|
MvSet |
ptwiseCompare(int op,
MvSet g)
Ptwise compare: <=, >=, =. |
MvSet |
ptwiseCompose(int op,
MvSet g)
Creates a pointwise composition op is an operator: L x L -> L f is the current mv-set result h (x) = f (x) op g (x) |
MvSet |
ptwiseNeg()
Creates a ptwise negation h (x) = \neg f (x) |
MvSet |
renameArgs(int[] newArgs)
Renames the arguments. |
void |
reorder()
|
int |
size()
Returns number of nodes |
DaVinciGraph |
toDaVinci()
|
MvRelation |
toMvRelation(MvSet invar,
MvSet preVarCube,
MvSet postVarCube,
int[] preToPostMap,
int[] postToPreMap)
|
Field Detail |
---|
static final int MEET
static final int JOIN
static final int NEG
static final int IMPL
static final int GEQ
static final int LEQ
static final int EQ
static final int EXISTS
static final int FORALL
static final int INFO_AND
static final int INFO_OR
Method Detail |
---|
MvSet ptwiseCompose(int op, MvSet g)
MvSet ptwiseNeg()
MvSet ptwiseCompare(int op, MvSet g)
MvSet cofactor(int argIdx, AlgebraValue value)
MvSet cofactor(AlgebraValue[] r)
MvSet cofactor(MvSet point)
MvSet existAbstract(MvSet cube)
MvSet forallAbstract(MvSet cube)
MvSet renameArgs(int[] newArgs)
AlgebraValue evaluate(AlgebraValue[] values)
java.util.Set getPreImageArray(AlgebraValue v)
MvSetFactory getFactory()
IAlgebra getAlgebra()
java.util.BitSet getImage()
void reorder()
int size()
MvSet and(MvSet v)
MvSet or(MvSet v)
MvSet not()
MvSet leq(MvSet v)
MvSet geq(MvSet v)
MvSet eq(MvSet v)
MvSet impl(MvSet v)
MvSet infoAnd(MvSet v)
MvSet infoOr(MvSet v)
MvSet infoNot()
boolean isConstant()
AlgebraValue getValue()
java.util.Iterator cubeIterator()
java.util.Iterator mintermIterator(MvSet vars, AlgebraValue val)
DaVinciGraph toDaVinci()
MvRelation toMvRelation(MvSet invar, MvSet preVarCube, MvSet postVarCube, int[] preToPostMap, int[] postToPreMap)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |