uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
LOLCAT: Relaxed Linear References for Lock-free Programming
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.ORCID iD: 0000-0003-4918-6582
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2016 (English)Report (Other academic)
Abstract [en]

A linear reference is a reference guaranteed to be unaliased. Thisis a powerful property that simplifies reasoning about programs,but is also a property that is too strong for certainapplications. For example, lock-free algorithms, which implementprotocols to ensure safe concurrent access to data structures, aregenerally not typable with linear references as they involvesharing of mutable state.

This paper presents a type system with a relaxed notion oflinearity that allows an unbounded number of aliases to an objectas long as at most one alias at a time owns the right to accessthe contents of the object. This ownership can be transferredbetween aliases, but can never be duplicated. The resultinglanguage is flexible enough to express several lock-freealgorithms and at the same time powerful enough to guarantee theabsence of data-races when accessing owned data. The language isformalised and proven sound, and is also available as a prototype implementation.

Place, publisher, year, edition, pages
2016.
Series
Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2016-013
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-309776OAI: oai:DiVA.org:uu-309776DiVA, id: diva2:1052919
Projects
Structured AliasingUpscaleUPMARCAvailable from: 2016-12-07 Created: 2016-12-07 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(1451 kB)177 downloads
File information
File name FULLTEXT01.pdfFile size 1451 kBChecksum SHA-512
061ee757c58e16c95cd18128582ec2fd02d1d0cb50dd6fdafbe2c7e4fd800d96a81599b754954eb87b265551813795ebd913a2aef0604a7bc5b330eff5fe823a
Type fulltextMimetype application/pdf

Authority records BETA

Castegren, EliasWrigstad, Tobias

Search in DiVA

By author/editor
Castegren, EliasWrigstad, Tobias
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 177 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1114 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf