Zobrazit v EDS

Ensuring Efficiently the Integrity of Persistent Object Systems Via Interpretation

Uloženo v:
Podrobná bibliografie
Název: Ensuring Efficiently the Integrity of Persistent Object Systems Via Interpretation
Autoři: Véronique Benzaken, Xavier Schaefer
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: ftp://ftp.cis.upenn.edu/pub/nettles/pos/letter/EU3Benzaken.ps
Rok vydání: 1996
Sbírka: CiteSeerX
Témata: abstract interpretation, reliable persistent stores, database programming languages, integrity constraints, program semantics and static analysis, predicate transformers, safety proofs
Popis: In this paper, we propose an efficient and reliable method to deal with integrity constraints in a persistent object system. First we provide the application programmer with the ability to express integrity constraints but we also give him the possibility to use high level language constructs to help him in writing safe transactions. The goal of our approach is to avoid the (run time) checking of constraints by proving formally that transactions preserve integrity constraints. We mainly use two abstract interpretation techniques to do that. Abstract interpretation is a semantics-based tool that yields some reliable information about the possible run-time behaviour of programs, with fully automatic algorithms. We present informally the methods that we use: a simple method, based on path reachability, and a more powerful and complex method that uses a predicate transformer. A predicate transformer is a function that, given a transaction and a formula describing its input data,.
Druh dokumentu: text
Popis souboru: application/postscript
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.1739
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.1739
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.BDADF2E1
Databáze: BASE
Popis
Abstrakt:In this paper, we propose an efficient and reliable method to deal with integrity constraints in a persistent object system. First we provide the application programmer with the ability to express integrity constraints but we also give him the possibility to use high level language constructs to help him in writing safe transactions. The goal of our approach is to avoid the (run time) checking of constraints by proving formally that transactions preserve integrity constraints. We mainly use two abstract interpretation techniques to do that. Abstract interpretation is a semantics-based tool that yields some reliable information about the possible run-time behaviour of programs, with fully automatic algorithms. We present informally the methods that we use: a simple method, based on path reachability, and a more powerful and complex method that uses a predicate transformer. A predicate transformer is a function that, given a transaction and a formula describing its input data,.