Heuristics for finding concurrent bugs

Yaniv Eytani, Eitan Farchi, Yosi Ben-Asher

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents new heuristics that increase the probability of manifesting concurrent bugs. The heuristics are based on cross-run monitoring. A contended shared variable is chosen and random context switching is performed at accesses to that variable. The relative strength of the new heuristics is analyzed. In comparison to previous works, our heuristics increase the frequency of bug manifestation. In addition, the new heuristics were able to find bugs that previous methods did not discover.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages8
Number of pages1
ISBN (Electronic)0769519261, 9780769519265
DOIs
StatePublished - 2003
EventInternational Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France
Duration: 22 Apr 200326 Apr 2003

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Conference

ConferenceInternational Parallel and Distributed Processing Symposium, IPDPS 2003
Country/TerritoryFrance
CityNice
Period22/04/0326/04/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Software

Fingerprint

Dive into the research topics of 'Heuristics for finding concurrent bugs'. Together they form a unique fingerprint.

Cite this