@inproceedings{6f7f5760f1dd4d41bdef607f25393f53,

title = "Specifying and proving serializabilty in temporal logic",

abstract = "Serializability of database transactions is first defined within the framework of linear temporal logic. For commutativity-based serializability, an alternative specification is given in a temporal logic whose semantic interpretation is especially tailored for reasoning about equivalence sequences of histories. The alternative specification method is given in ISTL* and is limited to the specification of concurrency control algorithms based on commutativity. A formal verification system for serializability that uses classical logic reasoning is provided. Within it, proving serializability of transactions executing a concurrency control algorithm is done along the same lines as proving properties of concurrent programs. Serializability for the multiversion-timestamp algorithm is verified.",

author = "Doron Peled and Shmuel Katz and Amir Pnueli",

year = "1991",

month = jul,

language = "אנגלית",

isbn = "081862230X",

series = "Proceedings - Symposium on Logic in Computer Science",

publisher = "Publ by IEEE",

pages = "232--244",

booktitle = "Proceedings - Symposium on Logic in Computer Science",

note = "Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science ; Conference date: 15-07-1991 Through 18-07-1991",

}