2021
DOI: 10.48550/arxiv.2111.12682
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Formally-Verified Framework for Fair Synchronization in Kotlin Coroutines

Abstract: Writing concurrent code that is both correct and efficient is notoriously difficult: thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages-specifically, fair FIFO ordering of synchronization requests and support for abortable operations-and frameworks for implementing such semantics co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 31 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?