Black-box correctness tests for basic parallel data structures

DOI10.1007/S00224-002-1046-6MaRDI QIDQ1849604zbMATH OpenOpenAlexFDO

Authors Phillip B. Gibbons, John Bruno, Steven J. Phillips

Publication date 1 December 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-002-1046-6

zbMATH Keywords

black-box procedureslinearizable priority queues

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Testing and verifying concurrent objects
• scientific article; zbMATH DE number 1305509
• Checking and Spot-Checking the Correctness of Priority Queues
• Checking linearizability of concurrent priority queues
• Streaming complexity of checking priority queues

Cited in

(1)

• Correctness and concurrent complexity of the black-white bakery algorithm

This page was built for publication: Black-box correctness tests for basic parallel data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849604)