Back to Results
First PageMeta Content
Computer memory / Concurrent computing / Memory management / Transaction processing / Memory barrier / Non-blocking algorithm / C dynamic memory allocation / Linearizability / Priority queue / Computing / Software engineering / Concurrency control


CheckFence: Checking Consistency of Concurrent Data Types on Relaxed Memory Models ∗ Sebastian Burckhardt Rajeev Alur
Add to Reading List

Document Date: 2007-03-26 08:41:48


Open Document

File Size: 185,74 KB

Share Result on Facebook

City

San Diego / /

Company

CNF / Distributed Systems / MIT Press / International Business Machines Corporation / Compaq Computer Corporation / Intel Corporation / Integrated Systems / /

Country

United States / /

Currency

USD / /

/

Facility

University of Rochester / PTR Prentice Hall / /

IndustryTerm

Specification mining statistics / race-detecting tools / multi-core chips / published algorithms / mining / computing / specification mining / concurrent deque algorithm / /

Organization

National Science Foundation / University of Pennsylvania / MIT / University of Rochester / /

Person

C. Flood / V / Formal Methods / M. Herlihy / V / L. Groves / V / Sebastian Burckhardt Rajeev Alur Milo / /

Position

Model / CPA / node_t *head / Software Developer / Mechanical Verification General / LOCKSMITH / /

Product

CheckFence / T-56 / /

ProgrammingLanguage

Java / C / /

ProvinceOrState

California / /

PublishedMedium

ACM Queue / /

Technology

Alpha / java / previously published algorithms / concurrent deque algorithm / Sequential Consistency / shared memory / /

SocialTag