Conference paper
Concurrent bug patterns and how to test them
Eitan Farchi, Yarden Nir, et al.
IPDPS 2003
While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of their definition. The paper views graphs as an economical scheme for encoding interception relations, and establishes an axiomatic characterization of relations that lend themselves to representation in terms of graph interception, thus providing a new characterization of graphs. © 1996 John Wiley & Sons, Inc.
Eitan Farchi, Yarden Nir, et al.
IPDPS 2003
Shady Copty, Shai Fine, et al.
Theoretical Computer Science
Maayan Goldstein, Onn Shehory, et al.
ICSE 2010
Yoram Adler, Dale Blue, et al.
International Journal on Software Tools for Technology Transfer