scispace - formally typeset
Y

Yoav Zibin

Researcher at Technion – Israel Institute of Technology

Publications -  16
Citations -  737

Yoav Zibin is an academic researcher from Technion – Israel Institute of Technology. The author has contributed to research in topics: Inheritance (object-oriented programming) & Isomorphism. The author has an hindex of 10, co-authored 16 publications receiving 712 citations. Previous affiliations of Yoav Zibin include Victoria University of Wellington & Google.

Papers
More filters
Proceedings ArticleDOI

Automatically patching errors in deployed software

TL;DR: Aspects of ClearView that make it particularly appropriate for this context include its ability to generate patches without human intervention, apply and remove patchesto and from running applications without requiring restarts or otherwise perturbing the execution, and identify and discard ineffective or damaging patches by evaluating the continued behavior of patched applications.
Proceedings ArticleDOI

Ownership and immutability in generic Java

TL;DR: OIGJ uses ownership information to facilitate creation of immutable cyclic structures, by safely prolonging the cooking phase even after the constructor finishes, and is more expressive than previous ownership languages, in the sense that it can type-check more good code.
Proceedings ArticleDOI

Efficient subtyping tests with PQ-encoding

TL;DR: A new scheme for encoding multiple and single inheritance hierarchies is presented, which, in the standardized hierarchies, reduces the footprint of all previsously published schemes and is applicable also in improving the performance of otehr, previously published, encoding schemes.
Proceedings ArticleDOI

Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching

TL;DR: This paper shows how to extend one such solution to the multiple-inheritance~(MI) setting, with an increase to the space requirement by a small factor of κ, which can be thought of as a metric of the complexity of the topology of the inheritance hierarchy.
Journal ArticleDOI

Efficient subtyping tests with PQ-encoding

TL;DR: A new scheme for encoding multiple- and single-inheritance hierarchies is presented, which, in the standard benchmark hierarchies, reduces the footprint of all previously published schemes and is called PQ-encoding (PQE) after Pq-trees, a data structure previously used in graph theory for finding the orderings that satisfy a collection of constraints.