Elucidating concurrent algorithms via layers of abstraction and reification (Q539423): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(9 intermediate revisions by 8 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00165-010-0156-1 / rank | |||
Property / author | |||
Property / author: Cliff B. Jones / rank | |||
Property / author | |||
Property / author: Cliff B. Jones / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68N19 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68N99 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5900835 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
formal methods | |||
Property / zbMATH Keywords: formal methods / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
concurrency | |||
Property / zbMATH Keywords: concurrency / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
program proof | |||
Property / zbMATH Keywords: program proof / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rely/guarantee conditions | |||
Property / zbMATH Keywords: rely/guarantee conditions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
asynchronous communication mechanisms | |||
Property / zbMATH Keywords: asynchronous communication mechanisms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Simpson's algorithm | |||
Property / zbMATH Keywords: Simpson's algorithm / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Rodin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00165-010-0156-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2004321173 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The B-Book / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inter-process buffers in separation logic with rely-guarantee / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A semantics for concurrent separation logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Structural Proof of the Soundness of Rely/guarantee Rules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768503 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4808839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tentative steps toward a development method for interfering programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Splitting atoms safely / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Role of Auxiliary Variables in the Formal Development of Concurrent Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The mutual exclusion problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4725724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resources, concurrency, and local reasoning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separation logic and abstraction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Concurrent Reading While Writing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Understanding concurrent systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modular Safety Checking for Fine-Grained Concurrency / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00165-010-0156-1 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:57, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Elucidating concurrent algorithms via layers of abstraction and reification |
scientific article |
Statements
Elucidating concurrent algorithms via layers of abstraction and reification (English)
0 references
30 May 2011
0 references
formal methods
0 references
concurrency
0 references
program proof
0 references
rely/guarantee conditions
0 references
asynchronous communication mechanisms
0 references
Simpson's algorithm
0 references
0 references
0 references