MakeRTree

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def apply(cfg: CFG, loops: List[CFGVertex], spuriousness: Boolean, search: SearchMethod, shuffle: Boolean): RTree

   

   Gets a Scala object and generates the reachability tree for the main function

   Gets a Scala object and generates the reachability tree for the main function

   loops

   the vertices that start a loop

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. var cfg: CFG

   

7. def checkFailedAssertion: Unit

   

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

13. def getFormula(start: RNode, end: RNode, label: Label): Expression

    

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. var init: List[(Variable, Expression)]

    

    initial values of global variables

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. def makeRTreeDFS(vertex: CFGVertex, predAbs: List[Boolean]): RNode

    

    Making a reachability tree for a given control flow graph with DFS method

18. def makeRTreeQueue(startVertex: CFGVertex, startPredAbs: List[Boolean]): Unit

    

    Making a reachability tree for a given control flow graph with BFS method

19. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

20. var nodeHash: Map[CFGVertex, Set[RNode]]

    

    the hash of nodes

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. var rTree: RTree

    

24. var search: SearchMethod

    

25. var shuffle: Boolean

    

26. var spuriousness: Boolean

    

    check the counter-example for spuriousness or not

27. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

28. var time: Long

    

    used for calculating the total time of computation

29. def toString(): String

    

    Definition Classes

    AnyRef → Any

30. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )