Conference paper
Multithreaded Java program test generation
Orit Edelstein, Eitan Farchi, et al.
JGI 2001
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.
Orit Edelstein, Eitan Farchi, et al.
JGI 2001
Marina Biberstein, Eitan Farchi, et al.
IPDPS 2004
Elad Yom-Tov, Rachel Tzoref, et al.
ASE 2008
Hezi Azatchi, Laurent Fournier, et al.
IEEE TC