Skip to main navigation Skip to search Skip to main content

Brief Announcement: Automatic Discovery of Mutual Exclusion Algorithms

  • Yoah Bar-David
  • , Gadi Taubenfeld

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

Abstract

A methodology for automatic discovery of synchronization algorithms is discussed. The user can set the problem parameters via a user interface. The parameters are sent to the algorithm generator, which generates all the possible algorithms according to the given parameters. Each algorithm (which passes the optimization checks) is sent to verification. Verification results are also returned to the algorithm generator for use in optimizations.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
PublisherAssociation for Computing Machinery (ACM)
Pages305
Number of pages1
ISBN (Print)1581137087
DOIs
StatePublished - 13 Jul 2003
Externally publishedYes
Event22nd Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States
Duration: 13 Jul 200316 Jul 2003

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume22

Conference

Conference22nd Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
Country/TerritoryUnited States
CityBoston, MA
Period13/07/0316/07/03

Fingerprint

Dive into the research topics of 'Brief Announcement: Automatic Discovery of Mutual Exclusion Algorithms'. Together they form a unique fingerprint.

Cite this