Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Yarden Nir"'
Transformers are considered conceptually different from the previous generation of state-of-the-art NLP models - recurrent neural networks (RNNs). In this work, we demonstrate that decoder-only transformers can in fact be conceptualized as unbounded
Externí odkaz:
http://arxiv.org/abs/2401.06104
Publikováno v:
Concurrency and Computation: Practice and Experience. 15:485-499
Finding bugs due to race conditions in multi-threaded programs is difficult, mainly because there are many possible interleavings, any of which may contain a fault. In this work we present a methodology for testing multi-threaded programs which has m
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
Publikováno v:
PPOPP
Coverage analysis is a useful testing technology. However, some coverage models are more acceptable to the industry than others. In the field of testing multi-threaded applications, there is a need for a coverage model that can be used to evaluate te
Publikováno v:
IPDPS
Summary form only given. The paper describes a tool for black-box testing of UDP-based distributed Java programs. UDP provides little guarantee for correct delivery of data, and therefore requires the application to verify the integrity of communicat
Publikováno v:
IPDPS
We present and categorize a taxonomy of concurrent bug patterns. We then use the taxonomy to create new timing heuristics for ConTest. Initial industrial experience indicates that these heuristics improve the bug finding ability of ConTest. We also s