Package | Description |
---|---|
de.uka.ilkd.key.java |
This package contains classes that cover the Java programming language.
|
de.uka.ilkd.key.strategy.feature |
Modifier and Type | Method and Description |
---|---|
ServiceCaches |
Services.getCaches()
Returns the used
ServiceCaches . |
Modifier and Type | Method and Description |
---|---|
protected static boolean |
AbstractBetaFeature.containsNegAtom(Term p_t,
boolean p_positive,
ServiceCaches caches) |
protected static boolean |
AbstractBetaFeature.containsQuantifier(Term p_t,
ServiceCaches caches) |
protected RuleAppCost |
ContainsQuantifierFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected RuleAppCost |
PurePosDPathFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected RuleAppCost |
CountMaxDPathFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected RuleAppCost |
LeftmostNegAtomFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected RuleAppCost |
SimplifyBetaCandidateFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected RuleAppCost |
CountPosDPathFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected abstract RuleAppCost |
AbstractBetaFeature.doComputation(PosInOccurrence pos,
Term findTerm,
ServiceCaches caches) |
protected static boolean |
AbstractBetaFeature.hasPurePosPath(Term p_t,
boolean p_positive,
ServiceCaches caches)
p_t contains a d-path consisting only of positive literals (as a formula
of the antecedent)
|
protected static boolean |
AbstractBetaFeature.isBetaCandidate(Term p_t,
boolean p_inAntec,
ServiceCaches caches) |
protected static int |
AbstractBetaFeature.maxDPath(Term p_t,
boolean p_positive,
ServiceCaches caches)
The length (number of literals) of the maximum d-path of the given
formula as a formula of the antecedent
|
protected static int |
AbstractBetaFeature.maxPosPath(Term p_t,
boolean p_positive,
ServiceCaches caches)
The maximal number of positive literals occurring within a
d-path of "p_t" as a formula of the antecedent
|
Copyright © 2003-2019 The KeY-Project.