Back to Results
First PageMeta Content
Transaction processing / Mathematics / Thread / Linearization / Algorithm / Concurrency / Concurrency control / Computing / Linearizability


Verifying Optimistic Algorithms Should be Easy (Position Paper) Noam Rinetzky Martin T. Vechev Eran Yahav Greta Yorsh Queen Mary University of London IBM T.J. Watson Research Center
Add to Reading List

Document Date: 2011-10-04 10:30:20


Open Document

File Size: 39,75 KB

Share Result on Facebook

Facility

Noam Rinetzky Martin T. Vechev Eran Yahav Greta Yorsh Queen Mary University of London IBM T.J. Watson Research Center Abstract In / /

IndustryTerm

optimistic concurrent algorithms / optimistic concurrent algorithm / optimistic set algorithm / optimistic algorithm / concurrent set algorithms / automatic verification tool / optimistic algorithms / /

Organization

Noam Rinetzky Martin T. Vechev Eran Yahav Greta Yorsh Queen Mary University of London IBM T.J. Watson Research Center Abstract In / MIT / /

Position

designated sentinel Head / algorithm designer / head / designer / T.k head / /

ProgrammingLanguage

R / /

PublishedMedium

Communications of the ACM / IEEE Transactions on Software Engineering / /

Technology

Verifying Optimistic Algorithms / concurrent set algorithms / optimistic concurrent algorithm / optimistic concurrent algorithms / optimistic algorithm / shared memory / optimistic set algorithm / /

SocialTag