Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Yarden Nir-Buchbinder"'
Autor:
Tanja E. J. Vos, Mark Harman, Joachim Wegener, Elisa Puoskari, Paolo Tonella, Yarden Nir-Buchbinder, Wishnu Prasetya
Publikováno v:
CSMR
The complexity of the technologies involved in the Future Internet makes testing extremely challenging and demands for novel approaches and major advancement in the field. The overall aim of the FITTEST project is to address these testing challenges,
Publikováno v:
PDATAD
Performing unit testing on concurrent programs is a known challenge. Several solutions have been proposed for the challenges, that provide only a partial answer. We argue that there are two kinds of concurrent code writing, namely concurrency protoco
Autor:
Rachel Tzoref-Brill, Ehud Trainin, Aviad Zlotnick, Yarden Nir-Buchbinder, Eitan Farchi, Shmuel Ur
Publikováno v:
PADTAD
Is it possible to efficiently reveal concurrency bugs by forcing a well selected set of conditions on program interleaving? To study this general question, we defined two simple models of conditions on program interleaving targeted at the insufficien
Autor:
Shmuel Ur, Bohuslav Křena, Tomáš Vojnar, Yarden Nir-Buchbinder, Rachel Tzoref-Brill, Zdeněk Letko
Publikováno v:
Runtime Verification ISBN: 9783642046933
RV
RV
This paper presents a tool for concurrency testing (abbreviated as ConTest) and some of its extensions. The extensions (called plug-ins in this paper) are implemented through the listener architecture of ConTest. Two plug-ins for runtime detection of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::543f9b5ae82a85b3bd00c8b983b6033d
https://doi.org/10.1007/978-3-642-04694-0_8
https://doi.org/10.1007/978-3-642-04694-0_8
Publikováno v:
Runtime Verification ISBN: 9783540892465
RV
RV
Deadlocks are possibly the best known bug pattern in computer systems in general; certainly they are the best known in concurrent programming. Numerous articles, some dating back more than 40 years, have been dedicated to the questions of how to desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::486bba685d94e8d5e8fd91e89494b820
https://doi.org/10.1007/978-3-540-89247-2_7
https://doi.org/10.1007/978-3-540-89247-2_7
Autor:
Saddek Bensalem, Liqiang Wang, Klaus Havelund, Shmuel Ur, R. Agarwal, Yarden Nir-Buchbinder, Scott D. Stoller, Eitan Farchi
Publikováno v:
IBM Journal of Research and Development. 54:3:1-3:15
Concurrent programs are well known for containing errors that are difficult to detect, reproduce, and diagnose. Deadlock is a common concurrency error, which occurs when a set of threads are blocked, due to each attempting to acquire a lock held by a
Autor:
Eitan Farchi, Hana Chockler, Ishai Rabinovitz, Benny Godlin, Yarden Nir-Buchbinder, Ziv Glazberg
Publikováno v:
King's College London
PADTAD
PADTAD
Software model checking came to the focus of research recently, with sharp growth in the number of safety-critical applications and in the complexity of software. In model checking of software we meet some obstacles which do not exist in model checki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66b278cbfebea10c21a82fc31880b326
https://kclpure.kcl.ac.uk/portal/en/publications/formal-verification-of-concurrent-software-two-case-studies(71669ab8-8776-47e9-bff1-05017374da0d).html
https://kclpure.kcl.ac.uk/portal/en/publications/formal-verification-of-concurrent-software-two-case-studies(71669ab8-8776-47e9-bff1-05017374da0d).html