Instance Constructors
-
new
WGGraph(seqObj: S, p: Int, maxSize: Long = -1, verbose: Boolean = false)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
interrupt: Unit
-
var
interrupted: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
val
mkInvoke: (Int, String, (S) ⇒ Any) ⇒ LLInvokeEvent[S, Any, Any]
-
val
mkReturn: (Int, Any) ⇒ LLReturnEvent[Any]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
solve(events: Array[Event]): Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
A tester for linearizabilty.
This is the tester referred to as the Wing & Gong Graph-Search in the paper Testing for Linearizability, Gavin Lowe. See that paper for more explanation of the technique.
The algorithm is based on the algorithm in Testing and Verifying Concurrent Objects, by Jeannette Wing and Chun Gong, extended to recognise revisited configurations.
the type of states of the corresponding sequential datatype