Conference paper
Compiling a benchmark of documented multi-threaded bugs
Yaniv Eytani, Shmuel Ur
IPDPS 2004
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.
Yaniv Eytani, Shmuel Ur
IPDPS 2004
Shai Fine, Shmuel Ur, et al.
DAC 2004
Oded Lachish, Eitan Marcus, et al.
Proceedings - Design Automation Conference
Shady Copty, Shmuel Ur
Euro-Par 2005