Conference paper
Advanced code coverage analysis using substring holes
Yoram Adler, Eitan Farchi, et al.
ISSTA 2009
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.
Yoram Adler, Eitan Farchi, et al.
ISSTA 2009
Hezi Azatchi, Laurent Fournier, et al.
IEEE TC
Yosi Ben-Asher, Yaniv Eytani, et al.
ISoLA 2006
Raanan Grinwald, Eran Harel, et al.
DAC 1998