Pages that link to "Item:Q3853111"

The following pages link to The serializability of concurrent database updates (Q3853111):

Displaying 50 items.

• I-serializability: generalized correctness for transaction-based environments (Q287187) (← links)
• Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
• Correctness of concurrent executions of closed nested transactions in transactional memory systems (Q391262) (← links)
• On speculative replication of transactional systems (Q395017) (← links)
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) (Q442277) (← links)
• Verification of STM on relaxed memory models (Q453508) (← links)
• Transactional scheduling for read-dominated workloads (Q456006) (← links)
• Towards formally specifying and verifying transactional memory (Q470040) (← links)
• On avoiding spare aborts in transactional memory (Q493661) (← links)
• Algorithmic aspects of multiversion concurrency control (Q579971) (← links)
• Deadlock-freedom (and safety) of transactions in a distributed database (Q579973) (← links)
• Abstraction for concurrent objects (Q615951) (← links)
• Extensible transactional memory testbed (Q666242) (← links)
• Context-specific synchronization for atomic data types in object-based databases (Q672343) (← links)
• Abstraction and mining of traces to explain concurrency bugs (Q681463) (← links)
• The impact of recovery on concurrency control (Q686645) (← links)
• A single-version STM that is multi-versioned permissive (Q693077) (← links)
• Inherent limitations on disjoint-access parallel implementations of transactional memory (Q693754) (← links)
• Commutativity-based locking for nested transactions (Q753480) (← links)
• Integrated concurrency control in shared B-trees (Q789172) (← links)
• Multi-version concurrency control scheme for a database system (Q799131) (← links)
• Proving opacity of transactional memory with early release (Q902713) (← links)
• On the power of safe locking (Q909495) (← links)
• Verifying atomic data types (Q914403) (← links)
• Concurrent operations in linear hashing (Q918680) (← links)
• Generalized theory of serializability (Q1073577) (← links)
• Serializability theory for replicated databases (Q1083230) (← links)
• A proof technique for concurrency control and recovery algorithms for replicated databases (Q1097027) (← links)
• Mixed product and asynchronous automata (Q1099643) (← links)
• A cautious scheduler for multistep transactions (Q1101210) (← links)
• The complexity of strict serializability revisited (Q1107969) (← links)
• A dynamic majority determination algorithm for reconfiguration of network partitions (Q1111008) (← links)
• Some constraints assuring serializability in multidatabases (Q1130390) (← links)
• General purpose schedulers for database systems (Q1132632) (← links)
• Pebble games for studying storage sharing (Q1162159) (← links)
• Hybrid concurrency control for abstract data types (Q1176284) (← links)
• Conceptual level concurrency control of relational update transactions (Q1186426) (← links)
• On-line multiversion database concurrency control (Q1199702) (← links)
• Timing conditions for linearizability in uniform counting networks (Q1292426) (← links)
• Linearizable read/write objects (Q1292436) (← links)
• Global serializability of concurrent programs (Q1318722) (← links)
• Static and dynamic aspects of goal-oriented concurrency control (Q1353964) (← links)
• Relative serializability: An approach for relaxing the atomicity of transactions (Q1376414) (← links)
• Mechanized proofs of opacity: a comparison of two techniques (Q1673658) (← links)
• A formal semantics of nested atomic sections with thread escape (Q1749114) (← links)
• Comparison of algorithms controlling concurrent access to a database: A combinatorial approach (Q1823735) (← links)
• Concurrency control by transactions carrying states and preordering multiversioned entities (Q1824415) (← links)
• 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) (Q1825050) (← links)
• On the complexity of concurrency control using semantic information (Q1892718) (← links)
• On the correctness problem for serializability (Q2119957) (← links)