Show simple item record

dc.contributor.authorMcCurley, E. Roberten_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T17:38:36Z
dc.date.available2007-04-23T17:38:36Z
dc.date.issued1989-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1039en_US
dc.identifier.urihttps://hdl.handle.net/1813/6839
dc.description.abstractSerializability is usually defined operationally in terms of sequences of operations. This paper gives another definition of serializability-in terms of sequences of states. It also shows how this definition can be used to prove correctness of solutions to the concurrency control problem.en_US
dc.format.extent1276937 bytes
dc.format.extent314230 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Assertional Characterization of Serializabilityen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics