Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Haim Kermany"'
Publikováno v:
2022 IEEE Conference on Software Testing, Verification and Validation (ICST).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::347b4a2fe5ec6fbb5dcde8d686ca3d75
https://doi.org/10.1109/icst53961.2022.00050
https://doi.org/10.1109/icst53961.2022.00050
Publikováno v:
DAC
We present Finding Related Interesting Events via Neighbor Detection (FRIENDS), a novel approach to assist verification teams with coverage closure. FRIENDS uses formal verification to find the neighboring events of a never-hit, or hard-to-hit, cover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3c5ad6de049ca8c4227a4d1240f44c8
https://doi.org/10.1109/dac18072.2020.9218685
https://doi.org/10.1109/dac18072.2020.9218685
Autor:
Haim Kermany, Erez Petrank
Publikováno v:
PLDI
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as Web application servers, frequently face the fragmentation problem. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e45652c666e38924aec284117dbd692f
https://doi.org/10.1145/1133981.1134023
https://doi.org/10.1145/1133981.1134023