Package edu.toronto.cs.proof2

Provides classes for representing, manipulating, and constructing proofs for CTL formulas (NEW)

See:
          Description

Interface Summary
Axiomatic  
ProofRule  
 

Class Summary
AboveFormula  
AbstractProofRule  
BelowFormula  
ComparisonFormula  
ConstantFormula  
CTLProver  
CTLProver.AndOrProofRule  
CTLProver.AtomicProofRule  
CTLProver.AUiProofRule  
CTLProver.AUProofRule  
CTLProver.AXProofRule  
CTLProver.BaseEXProofRule  
CTLProver.CheckingTopBottom  
CTLProver.EGProofRule  
CTLProver.EqNegationProofRule Negation proof rule that always returns an equals sub-goal.
CTLProver.EqualsProofRule  
CTLProver.EUiProofRule  
CTLProver.EUProofRule  
CTLProver.EXAboveMProofRule  
CTLProver.EXCexProofRule  
CTLProver.EXProofRule  
CTLProver.NegationProofRule  
CTLProver.NewEXProofRule  
CTLProver.PreferAvoidEXProofRule  
DepthProofRule  
DepthVisitor  
DynamicProofDisplay Describe class DynamicProofDisplay here.
DynamicTree  
EqualFormula  
Formula  
FormulaRenderer  
GrappaNodePair A tuple class -- don't we have one in util package? in any case, can't we just use arrays for that?
LeafProofStep  
NewProofTreeModel  
ProofStep This class is the ancestor of all proof-step objects.
ProofStepFactory  
ProofStepListModel  
ProofStepTreeModel  
ProofToGrappa  
TreeProofStep  
VisitedEXProofRule It can easily be shown that [|EX phi|](s) >= l if [|EX (phi /\ psi)|](s) >= l
 

Package edu.toronto.cs.proof2 Description

Provides classes for representing, manipulating, and constructing proofs for CTL formulas (NEW)