Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks.
Vineet KahlonPublished in: LICS (2009)
Keyphrases
- pairwise
- concurrency control
- description logics
- query answering
- foreign language
- sufficient conditions
- multi class
- database management systems
- transitive closure
- distributed databases
- locking protocol
- chinese characters
- fine grained
- state space
- loss function
- multi threaded
- higher order
- spectral clustering
- semi supervised
- similarity measure
- database systems
- type checking
- datalog programs
- communication channels
- point sets
- read write
- belief propagation
- pairwise interactions
- markov random field
- transaction processing
- data structure
- knowledge representation
- b tree
- decision procedures