Verifying correctness of persistent concurrent data structures: a sound and complete method
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-299X
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Verifying correctness of persistent concurrent data structures: a sound and complete method ; volume:33 ; number:4-5 ; day:17 ; month:5 ; year:2021 ; pages:547-573 ; date:8.2021
Formal aspects of computing ; 33, Heft 4-5 (17.5.2021), 547-573, 8.2021
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00165-021-00541-8
- URN
-
urn:nbn:de:101:1-2021111819353180255381
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:32 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Derrick, John
- Doherty, Simon
- Dongol, Brijesh
- Schellhorn, Gerhard
- Wehrheim, Heike
- SpringerLink (Online service)
Ähnliche Objekte (12)
Formally verifying Kyber : Episode IV: Implementation correctness
Verifying concurrent programs under weak memory models
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Correctness and concurrent complexity of the Black-White Bakery Algorithm
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 OPAL, Pt. 1.. Verifying in the small
Verifying Negative Sentences
Verifying concurrent systems with symbolic execution : temporal reasoning is symbolic execution with a little induction
Political Correctness
Formally verifying Kyber : Episode IV: Implementation correctness
Verifying concurrent programs under weak memory models
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Correctness and concurrent complexity of the Black-White Bakery Algorithm
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 OPAL, Pt. 1.. Verifying in the small
Verifying Negative Sentences
Verifying concurrent systems with symbolic execution : temporal reasoning is symbolic execution with a little induction
Political Correctness
Formally verifying Kyber : Episode IV: Implementation correctness
Verifying concurrent programs under weak memory models
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Three-valued abstraction and heuristic-guided refinement for verifying concurrent systems
Correctness and concurrent complexity of the Black-White Bakery Algorithm
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 OPAL, Pt. 1.. Verifying in the small
Verifying Negative Sentences
Verifying concurrent systems with symbolic execution : temporal reasoning is symbolic execution with a little induction