UNSPECIFIED (1997) A rigorous analysis of concurrent operations on B-trees. In: 8th International Conference on Concurrency Theory (CONCUR 97), JUL 01-04, 1997, WARSAW, POLAND.

Full text not available from this repository.

Abstract

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
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-63141-0
ISSN:	0302-9743
Editor:	Mazurkiewicz, A and Winkowski, J
Date:	1997
Volume:	1243
Number of Pages:	15
Page Range:	pp. 361-375
Publication Status:	Published
Title of Event:	8th International Conference on Concurrency Theory (CONCUR 97)
Location of Event:	WARSAW, POLAND
Date(s) of Event:	JUL 01-04, 1997
URI:	http://wrap.warwick.ac.uk/id/eprint/15710

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item