- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-299X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Correctness and concurrent complexity of the Black-White Bakery Algorithm ; day:29 ; month:3 ; year:2016 ; pages:1-17
Formal aspects of computing ; (29.3.2016), 1-17
- Creator
-
Hesselink, Wim H.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00165-016-0364-4
- URN
-
urn:nbn:de:1111-201603315231
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:49 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hesselink, Wim H.
- SpringerLink (Online service)
Other Objects (12)
Computer architecture : complexity and correctness ; with 185 tables
Computer architecture : complexity and correctness ; with 185 tables
Complexity and correctness of a super-pipelined processor
A new correctness proof for prim's algorithm
A general semiunification algorithm and its correctness proof
Topology in process calculus : approximate correctness and infinite evolution of concurrent programs
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Verifying correctness of persistent concurrent data structures: a sound and complete method
Decision and complexity issues on concurrent systems
Tournaments for mutual exclusion: verification and concurrent complexity
Political Correctness
Computer architecture : complexity and correctness ; with 185 tables
Computer architecture : complexity and correctness ; with 185 tables
Complexity and correctness of a super-pipelined processor
A new correctness proof for prim's algorithm
A general semiunification algorithm and its correctness proof
Topology in process calculus : approximate correctness and infinite evolution of concurrent programs
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Verifying correctness of persistent concurrent data structures: a sound and complete method
Decision and complexity issues on concurrent systems
Tournaments for mutual exclusion: verification and concurrent complexity
Political Correctness
Computer architecture : complexity and correctness ; with 185 tables
Computer architecture : complexity and correctness ; with 185 tables
Complexity and correctness of a super-pipelined processor
A new correctness proof for prim's algorithm
A general semiunification algorithm and its correctness proof
Topology in process calculus : approximate correctness and infinite evolution of concurrent programs
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Verifying correctness of persistent concurrent data structures: a sound and complete method
Decision and complexity issues on concurrent systems
Tournaments for mutual exclusion: verification and concurrent complexity