Asynchronous wait-free runtime verification and enforcement of linearizability
From MaRDI portal
concurrent algorithmsdistributed runtime verificationenforcementfault-tolerancelinearizabilitylock-freedommonitoringshared memoryverificationwait-freedom
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Cites work
- A brief account of runtime verification
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- An overview of the runtime verification tool Java PathExplorer
- Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
- Atomic snapshots of shared memory
- Atomizer: A dynamic atomicity checker for multithreaded programs
- Brief Announcement: Linearizability: A Typo
- Causal memory: definitions, implementation, and programming
- Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation
- Concurrent programming: algorithms, principles, and foundations.
- Concurrent specifications beyond linearizability
- Decentralised LTL monitoring
- Decentralized Asynchronous Crash-resilient Runtime Verification
- Decentralized LTL enforcement
- Deciding and verifying network properties locally with few output bits
- Distributed verification and hardness of distributed approximation
- Failure-aware runtime verification of distributed systems
- Forward and backward simulations. I. Untimed Systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Impossibility of distributed consensus with one faulty process
- Intermediate value linearizability: a quantitative correctness criterion
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- On interprocess communication. I: Basic formalism
- On interprocess communication. II: Algorithms
- Opportunistic monitoring of multithreaded programs
- Quantitative relaxation of concurrent data structures
- Runtime verification with minimal intrusion through parallelism
- Sharing memory robustly in message-passing systems
- Testing Shared Memories
- The concurrency hierarchy, and algorithms for unbounded concurrency
- The serializability of concurrent database updates
- Time, clocks, and the ordering of events in a distributed system
- Tractable refinement checking for concurrent objects
- Unifying Concurrent Objects and Distributed Tasks
- Verifying concurrent programs against sequential specifications
This page was built for publication: Asynchronous wait-free runtime verification and enforcement of linearizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227178)
