A rigorous analysis of concurrent operations on B-trees
UNSPECIFIED (1997) A rigorous analysis of concurrent operations on B-trees. In: 8th International Conference on Concurrency Theory (CONCUR 97), WARSAW, POLAND, JUL 01-04, 1997. Published in: CONCUR'97 : CONCURRENCY THEORY, 1243 pp. 361-375.Full text not available from this repository.
An account is given of a rigorous study of concurrent operations on a variant of the B-tree in the framework of a general theory of concurrent systems, an extension of the pi-calculus. The assertion of correctness of the algorithms is that the agent representing the system is behaviourally equivalent to an agent whose observable behaviour describes simply the expected interactions of the system with its environment. An outline of the proofs of correctness of algorithms for insertion and search is given. Algorithms for deletion and compression are considered briefly. The main theoretical contribution is an extension of the theory,of partial confluence of agents.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||CONCUR'97 : CONCURRENCY THEORY|
|Editor:||Mazurkiewicz, A and Winkowski, J|
|Number of Pages:||15|
|Page Range:||pp. 361-375|
|Title of Event:||8th International Conference on Concurrency Theory (CONCUR 97)|
|Location of Event:||WARSAW, POLAND|
|Date(s) of Event:||JUL 01-04, 1997|
Actions (login required)