OpenAlex
PricingAboutJobs
Log inGet started
Work

Quantitative Reasoning for Proving Lock-Freedom

HTML

Year: 2013
Type: conference-paper
Source: ACM/IEEE Symposium on Logic in Computer Science (LICS)
DOI: 10.1109/lics.2013.18
Authors: Jan Hoffmann, Michael Marmar, Zhong Shao
Institution: Yale University
Language: English

Topic: Logic, programming, and type systems
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: lock-freedom, quantitative reasoning, concurrent separation logic, total correctness, memory safety, program logic

Open Access status: closed

Funders: National Science Foundation, Defense Advanced Research Projects Agency
Awards: TC:Small: Formal Reasoning about Concurrent Programs for Multicore and Multiprocessor Machines, G1889560887, G789317362, G8542633891, TC: Medium: Making OS Kernels Crash-Proof by Design and Certification, TC:Large:Collaborative Research:Combininig Foundational and Lightweight Formal Methods to Build Certifiably Dependable Software
OpenAlex ID: W2005354109
FWCI: 1.78
Cites: 43
Cited by: 42
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security