Výsledky vyhledávání - "Donaldson, AF"

Test-case reduction via test-case generation: Insights from the hypothesis reducer

Autor: MacIver, DR, Donaldson, AF

Publikováno v: 34th European Conference on Object-Oriented Programming (ECOOP 2020)

We describe internal test-case reduction, the method of test-case reduction employed by Hypothesis, a widely-used property-based testing library for Python. The key idea of internal test-case reduction is that instead of applying test-case reduction

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1032::c7356716d652d1bfe1a2dbdf8570339a
http://hdl.handle.net/10044/1/98307

Zobrazit plný text záznamu

GPU Schedulers: How Fair Is Fair Enough?

Autor: Sorensen, T, Evrard, H, Donaldson, AF

Publikováno v: 29th International Conference on Concurrency Theory (CONCUR 2018)

Blocking synchronisation idioms, e.g. mutexes and barriers, play an important role in concurrent programming. However, systems with semi-fair schedulers, e.g. graphics processing units (GPUs), are becoming increasingly common. Such schedulers provide

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e477be04b0114df09bd8ee4de8bd631f

Zobrazit plný text záznamu

Uncovering Bugs in Distributed Storage Systems during Testing (not in Production!)

Autor: Deligiannis, P, McCutchen, M, Thomson, P, Chen, S, Donaldson, AF, Erickson, J, Huang, C, Lal, A, Mudduluru, R, Qadeer, S, Schulte, W

Publikováno v: 14th USENIX Conference on File and Storage Technologies

Testing distributed systems is challenging due to multiple sources of nondeterminism. Conventional testing techniques, such as unit, integration and stress testing, are ineffective in preventing serious but subtle bugs from reaching production. Forma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1032::2cb8d8057ee32ce278cd93d70abdd37a
http://hdl.handle.net/10044/1/31770

Zobrazit plný text záznamu

Certified Roundoff Error Bounds Using Semidefinite Programming

Autor: Magron, V, Constantinides, GA, Donaldson, AF

Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs or custom

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1032::b2747efb1f1e0804e725d6501c0f6b73
http://hdl.handle.net/10044/1/29366

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání