| Modifier and Type | Method and Description |
|---|---|
Proof.State |
Proof.LinearRule.apply(Proof.State current,
Proof.State head)
Apply a given rule to a given state, producing one potentially
updated state.
|
Proof.State[] |
Proof.NonLinearRule.apply(Proof.State current,
Proof.State head)
Apply a given rule to a given state, producing one (or more)
potentially updated states.
|
Proof.State |
Proof.State.getChild(int ith)
Get the child state resulting from this step
|
Proof.State |
Proof.State.getParent()
Get the parent (i.e.
|
Proof.State |
Proof.getState(int ith)
Get the ith step in this proof.
|
Proof.State |
Proof.State.infer(Proof.Rule rule,
Formula truth,
Formula... dependencies)
Infer a new fact from one or more existing facts.
|
Proof.State |
Proof.State.refine(Proof.Rule rule,
WyalFile.VariableDeclaration variable,
WyalFile.Type type,
Formula... dependencies)
Refine the type of a given variable in this state.
|
Proof.State[] |
Proof.State.split(Formula.Disjunct disjunct)
Apply a simple proof step which splits a given disjunct into several
sub-states.
|
Proof.State |
Proof.State.subsume(Proof.Rule rule,
Formula truth,
Formula replacement,
Formula... dependencies)
Subsume a given truth by a replacement.
|
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
Proof.LinearRule.apply(Proof.State current,
Proof.State head)
Apply a given rule to a given state, producing one potentially
updated state.
|
Proof.State[] |
Proof.NonLinearRule.apply(Proof.State current,
Proof.State head)
Apply a given rule to a given state, producing one (or more)
potentially updated states.
|
void |
Proof.State.applyBypass(Proof.State bypass) |
Proof.Delta |
Proof.State.getDelta(Proof.State ancestor)
Get the delta between this state and an ancestor.
|
| Modifier and Type | Method and Description |
|---|---|
void |
ProofPrinter.print(int depth,
Proof.State step) |
void |
ProofPrinter.printBoxContents(int depth,
Proof.State step) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
CongruenceClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
Proof.State |
Simplification.apply(Proof.State head,
Formula truth) |
Proof.State |
EqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
CongruenceClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
Proof.State |
Simplification.apply(Proof.State head,
Formula truth) |
Proof.State |
EqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
wybs.lang.SyntacticItem |
CongruenceClosure.construct(Proof.Delta.Set existingTruths,
Proof.State head,
wybs.lang.SyntacticItem term,
Formula newTruth,
List<Formula> dependencies)
When generating an entirely new term within a given rule (i.e.
|
WyalFile.Expr |
CongruenceClosure.localConstruct(Proof.Delta.Set existingTruths,
Proof.State head,
WyalFile.Expr term,
Formula newTruth,
List<Formula> dependencies) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
InequalityIntroduction.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
InequalityIntroduction.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ArrayIndexAxiom.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
Proof.State |
ArrayLengthAxiom.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayIndexCaseAnalysis.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayEqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayIndexAxiom.attemptInstantiation(Formula source,
List<WyalFile.Expr.Operator> matches,
Formula target,
Proof.State state) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByArrayAccess(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByEquation(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ArrayIndexAxiom.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
Proof.State |
ArrayLengthAxiom.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayIndexCaseAnalysis.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayEqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
Proof.State |
ArrayIndexAxiom.attemptInstantiation(Formula source,
List<WyalFile.Expr.Operator> matches,
Formula target,
Proof.State state) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByArrayAccess(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByEquation(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
MacroExpansion.apply(Proof.State state,
Formula truth) |
Proof.State |
FunctionCallAxiom.apply(Proof.State state,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
MacroExpansion.apply(Proof.State state,
Formula truth) |
Proof.State |
FunctionCallAxiom.apply(Proof.State state,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State[] |
OrElimination.apply(Proof.State state,
Formula truth) |
Proof.State |
AndElimination.apply(Proof.State head,
Formula truth) |
Proof.State[] |
OrElimination.apply(Proof.State current,
Proof.State head) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State[] |
OrElimination.apply(Proof.State state,
Formula truth) |
Proof.State |
AndElimination.apply(Proof.State head,
Formula truth) |
Proof.State[] |
OrElimination.apply(Proof.State current,
Proof.State head) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ExhaustiveQuantifierInstantiation.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
Proof.State |
ExistentialElimination.apply(Proof.State head,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ExhaustiveQuantifierInstantiation.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
Proof.State |
ExistentialElimination.apply(Proof.State head,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
RecordEqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
RecordEqualityCaseAnalysis.apply(Proof.State state,
Formula truth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
TypeTestNormalisation.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
Proof.State |
TypeTestClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
TypeTestNormalisation.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
Proof.State |
TypeTestClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractProof<T extends Proof.State> |
static class |
AbstractProof.AbstractState<T extends Proof.State> |
| Modifier and Type | Class and Description |
|---|---|
static class |
AbstractProof.AbstractState<T extends Proof.State> |
static class |
DeltaProof.State |
| Modifier and Type | Field and Description |
|---|---|
protected T |
AbstractProof.AbstractState.parent |
| Modifier and Type | Method and Description |
|---|---|
abstract Proof.State |
AbstractClosureRule.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
abstract Proof.State |
AbstractProofRule.apply(Proof.State head,
Formula truth) |
Proof.State |
AbstractClosureRule.apply(Proof.State head,
Formula truth) |
Proof.State |
AbstractProofRule.apply(Proof.State current,
Proof.State head) |
Proof.State |
AbstractClosureRule.apply(Proof.State current,
Proof.State head) |
Proof.State |
DeltaProof.State.refine(Proof.Rule rule,
WyalFile.VariableDeclaration variable,
WyalFile.Type type,
Formula... dependencies) |
| Modifier and Type | Method and Description |
|---|---|
abstract Proof.State |
AbstractClosureRule.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
abstract Proof.State |
AbstractProofRule.apply(Proof.State head,
Formula truth) |
Proof.State |
AbstractClosureRule.apply(Proof.State head,
Formula truth) |
Proof.State |
AbstractProofRule.apply(Proof.State current,
Proof.State head) |
Proof.State |
AbstractClosureRule.apply(Proof.State current,
Proof.State head) |
void |
AbstractProof.AbstractState.applyBypass(Proof.State child) |
Proof.Delta |
DeltaProof.State.getDelta(Proof.State ancestor)
Return the list of formulae introduced by this step.
|
protected Proof.Delta.Set |
AbstractClosureRule.getExistingTruths(Proof.State current) |
Copyright © 2017. All rights reserved.