scientific article; zbMATH DE number 7561456
From MaRDI portal
Publication:5091106
DOI10.4230/LIPIcs.OPODIS.2018.28MaRDI QIDQ5091106
Samuel Mimram, Eric Goubault, Jérémy Ledent
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (3)
Product programs in the wild: retrofitting program verifiers to check information flow security ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ A Sound Foundation for the Topological Approach to Task Solvability
Cites Work
- Abstraction for concurrent objects
- On interprocess communication. I: Basic formalism
- Modular verification of concurrency-aware linearizability
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- On full abstraction for PCF: I, II and III
- Asynchronous Games: Innocence Without Alternation
- The serializability of concurrent database updates
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Reduction
- Local linearizability for concurrent container-type data structures
- Immediate atomic snapshots and fast renaming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
