Towards a consistent viewpoint on consistency for persistent applications

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Orthogonally persistent systems allow the use of a single object model to handle programs and data independently of their persistent condition. However, there is not yet any means to specify and control consistency in a single way, that is both program correctness and data integrity. This paper describes how the use of assertions can be extended to some important stages of the persistent application’s life cycle: design, implementation, testing and evolution. We present our on-going implementation, the NightCap system, which aims at integrating assertions, with a mapping of the Object Constraint Language to Java, into a orthogonally persistent platform, namely PJama.

Cite

CITATION STYLE

APA

Collet, P., & Vignola, G. (2001). Towards a consistent viewpoint on consistency for persistent applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1944, pp. 47–60). Springer Verlag. https://doi.org/10.1007/3-540-44677-X_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free