The serializability of concurrent database updates
From MaRDI portal
Cited in
(84)- Generalized theory of serializability
- Serializability theory for replicated databases
- A proof technique for concurrency control and recovery algorithms for replicated databases
- Mixed product and asynchronous automata
- A cautious scheduler for multistep transactions
- The complexity of strict serializability revisited
- A dynamic majority determination algorithm for reconfiguration of network partitions
- Some constraints assuring serializability in multidatabases
- General purpose schedulers for database systems
- Pebble games for studying storage sharing
- Hybrid concurrency control for abstract data types
- Conceptual level concurrency control of relational update transactions
- On-line multiversion database concurrency control
- Timing conditions for linearizability in uniform counting networks
- Linearizable read/write objects
- Global serializability of concurrent programs
- Static and dynamic aspects of goal-oriented concurrency control
- Relative serializability: An approach for relaxing the atomicity of transactions
- Mechanized proofs of opacity: a comparison of two techniques
- A formal semantics of nested atomic sections with thread escape
- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
- Concurrency control by transactions carrying states and preordering multiversioned entities
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
- On the complexity of concurrency control using semantic information
- On the correctness problem for serializability
- An efficient approach to achieve compositionality using optimized multi-version object based transactional systems
- Last-use opacity: a strong safety property for transactional memory with prerelease support
- Checking robustness between weak transactional consistency models
- Concurrent correctness in vector space
- Non-interference and local correctness in transactional memory
- Model checking transactional memories
- A formal model for the deferred update replication technique
- In the search for optimal concurrency
- I-serializability: generalized correctness for transaction-based environments
- Modular verification of chemical reaction network encodings via serializability analysis
- Verifying robustness of event-driven asynchronous programs against concurrency
- Toward a formal semantic framework for deterministic parallel programming
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- Permissiveness in Transactional Memories
- Completeness and Nondeterminism in Model Checking Transactional Memories
- The serializability problem for a temporal logic of transaction queries
- Une approche quantitative de l'exclusion mutuelle
- On serializability
- Correctness of concurrent executions of closed nested transactions in transactional memory systems
- On speculative replication of transactional systems
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
- Verification of STM on relaxed memory models
- Transactional scheduling for read-dominated workloads
- Serializable histories in quantified propositional temporal logic
- Towards formally specifying and verifying transactional memory
- On avoiding spare aborts in transactional memory
- Concurrent specifications beyond linearizability
- Linearizable counting networks
- Asynchronous group mutual exclusion
- X-ability: a theory of replication
- Modular verification of DNA strand displacement networks via serializability analysis
- Verifying opacity of a transactional mutex lock
- A transaction model and multiversion concurrency control for mobile database systems
- Algorithmic aspects of multiversion concurrency control
- Deadlock-freedom (and safety) of transactions in a distributed database
- scientific article; zbMATH DE number 7327945 (Why is no real title available?)
- Strict linearizability and abstract atomicity
- Robustness Against Transactional Causal Consistency.
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- Cut-off theorems for the \textit{PV}-model
- Abstraction for concurrent objects
- Quantifiability: a concurrent correctness condition modeled in vector space
- Serializable graphs
- Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
- A verified durable transactional mutex lock for persistent x86-TSO
- Extensible transactional memory testbed
- Context-specific synchronization for atomic data types in object-based databases
- Abstraction and mining of traces to explain concurrency bugs
- The impact of recovery on concurrency control
- A single-version STM that is multi-versioned permissive
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- Asynchronous wait-free runtime verification and enforcement of linearizability
- Commutativity-based locking for nested transactions
- Integrated concurrency control in shared B-trees
- Multi-version concurrency control scheme for a database system
- Proving opacity of transactional memory with early release
- On the power of safe locking
- Verifying atomic data types
- Concurrent operations in linear hashing
This page was built for publication: The serializability of concurrent database updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853111)
