Skip to main content
SpringerLink
Log in

Protection in Persistent Object Systems

  • Conference paper
Security and Persistence

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Persistent programming is concerned with the creation and manipulation of data with arbitrary lifetimes. This data is often valuable and therefore protected to ensure that it is free from misuse. The mechanisms used to protect the data vary with a tradeoff between static expression of the protection and the flexibility in modelling it. In this paper we explore the full range of protection mechanisms in persistent systems from static to dynamic checking and contrast it with the corresponding balance between safety and flexibility in the system. Protection by capabilities, dynamic universal union types, encapsulation, subtype inheritance, existential quantification and predicate defined invariants will be explored with reference to manipulating long lived data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albano, A., Ghelli, G. & Orsini, R. “Types for Databases: The Galileo Experience.” Proc. 2nd International Workshop on Database Programming Languages, Oregon, June 1989, pp 196–206.

    Google Scholar 

  2. Anderson, M., Pose, R.D. & Wallace, C.S. “A Password-Capability System.” The Computer Journal, 29, 1, 1986, pp. 1–8.

    Article  Google Scholar 

  3. Atkinson, M.P., Bailey, P.J., Chisholm, K.J., Cockshott, W.P. & Morrison, R. “An Approach to Persistent Programming.” The Computer Journal, 26, 4, November 1983, pp. 360–365.

    MATH  Google Scholar 

  4. Atkinson, M.P., Buneman, O.P. & Morrison, R. “Binding and Type Checking in Database Programming Languages.” The Computer Journal, 31, 2, 1988, pp. 99–109.

    Article  MATH  Google Scholar 

  5. Atkinson, M.P. & Morrison, R. “Polymorphic Names, Types, Constancy and Magic in a Type Secure Persistent Object Store.” 2nd International Workshop on Persistent Object Systems, Appin, August 1987, pp. 1–12.

    Google Scholar 

  6. Bernstein, P. A. & Blaustein, B. T. “A Simplification Algorithm for Integrity Assertions and Concrete Views.” Proc. of the Fifth International Computer Software and Applications Conference, 1981, pp. 90–99.

    Google Scholar 

  7. Bernstein, P. A., Blaustein, B. T, & Clarke, E. M. “Fast Maintenance of Semantic Assertions Using Redundant Aggregate Data.” Proc. of the Sixth International Conference on Very Large Databases, 1980, pp. 126–136.

    Google Scholar 

  8. Burstall, R. & Lampson, B. “A Kernel Language for Abstract Data Types and Modules.” Proc. international symposium on the semantics of data types, Sophia-Antipolis, France, 1984. In Lecture Notes in Computer Science, 173. Springer-Verlag, 1984.

    Google Scholar 

  9. Cardelli. L. “Amber.” Tech. Report AT&T. Bell Labs. Murray Hill, U.S.A., 1985.

    Google Scholar 

  10. Cardelli, L. “Typeful Programming.” DEC SRC Report, May 1989.

    Google Scholar 

  11. Cardelli, L. & Wegner, P. “On Understanding Types, Data Abstraction and Polymorphism.” ACM Computing Surveys, 17, 4, December 1985, pp. 471–523.

    Article  Google Scholar 

  12. Connor, R.C.H., Dearle, A., Morrison, R. & Brown, A.L. “Existentially Quantified Types as a Database Viewing Mechanism.” Advances in Database Technology - EDBT90, Venice. In Lecture Notes in Computer Science, 416. Springer-Verlag, 1990, pp. 301–315.

    Google Scholar 

  13. Dennis, J.B. & Van Horn, E.C. “Programming Semantics for Multiprogrammed Computations.” Comm. ACM, 9, 3, 1966, pp 143–145.

    Article  MATH  Google Scholar 

  14. Fabry, R.S. “Capability Based Addressing.” Comm.ACM, 17, 7, 1974, pp. 403–412.

    Article  Google Scholar 

  15. Feustal, E.A. “On the Advantages of Tagged Architecture.” IEEE Transactions on Computers, C-22, 7, July 1973, pp. 644–656.

    Article  Google Scholar 

  16. Hsu, T. & Imielinski, T. “Integrity Checking for Multiple Updates.” Proc. of the ACM- SIGMOD International Conference on Management of Data, 1985, pp. 152–168.

    Google Scholar 

  17. Jones, A.K. & Liskov, B. “A language extension for expressing constraints on data access.” Comm.ACM, 21, 5, 1978, pp. 358–367.

    Article  MATH  Google Scholar 

  18. Lorie, R.A. “Physical Integrity in a Large Segmented Database.” ACM Transactions on Database Systems, 2, 1, March 1977, pp. 91–104.

    Article  Google Scholar 

  19. McCune, W. & Henschen, L. “Maintaining State Constraints in Relational Databases.” Journal of the ACM, 36, 1, January 1989, pp. 46–68.

    Article  MATH  MathSciNet  Google Scholar 

  20. Mitchell J.C. & Plotkin G.D. “Abstract Types have Existential type.” ACM Transactions on Programming Languages and Systems, 10, 3, July 1988, pp. 470–502.

    Article  Google Scholar 

  21. Morrison, R., Brown, A.L., Connor, R.C.H. & Dearle, A. “Napier88 Reference Manual.” Persistent Programming Research Report PPRR-77-89, Universities of Glasgow and St Andrews, 1989.

    Google Scholar 

  22. Morrison, R., Brown, A.L., Dearle, A. & Atkinson, M.P. “Flexible Incremental Binding in a Persistent Object Store.” ACM Sigplan Notices, 23, 4, April 1988, pp. 27–34.

    Article  Google Scholar 

  23. Myers, G.J. & Buckingham, B.R.S. “A Hardware Implementation of Capability-Based Addressing.” Operating Systems Review, 14, 4, 1980.

    Article  Google Scholar 

  24. “The PS-algol Reference Manual fourth edition.” Persistent Programming Research Report PPRR-12-87, Universities of Glasgow and St. Andrews, 1987.

    Google Scholar 

  25. Rosenberg, J. & Abramson, D.A. “A Capability-Based Workstation to Support Software Engineering.” Proceedings of 18th Annual Hawaii International Conference on System Sciences, 1985, pp. 222–230.

    Google Scholar 

  26. Rosneberg, J., Henskens, F.A., Brown, A.L. & Morrison, R. “Stabilitity in a Persistent Store based on Large Virtual Memory.” Proc of the International Workshop on Security and Persistence of Information, Bremen, West Germany, May 1990.

    Google Scholar 

  27. Schmidt, J.W., Wetzel, I., Borgida, A. & Mylopoulos, J. “Database Programming by Formal Refinement of Conceptual Design.” IEEE - Data Engineering, September 1989.

    Google Scholar 

  28. Sheard, T. & Stemple, D. “Automatic Verification of Database Transaction Safety.” ACM Transactions on Database Systems, 12, 3, September, 1989, pp. 322–368.

    Article  Google Scholar 

  29. Stemple, D., Fegaras, L., Sheard, T. & Socorro, A. “Exceeding the Limits of Polymorphism in Database Programming Languages.” Advances in Database Technology - EDBT90, Venice. In Lecture Notes in Computer Science, 416. Springer-Verlag, 1990, pp. 269–285.

    Google Scholar 

  30. Wilkes, M.V. & Needham, R.M. The Cambridge CAP Computer and its Operating System. Elsevier North Holland, Inc., 1979.

    Google Scholar 

  31. Wulf, W.A., Levin, R. & Harbison, S.P. HYDRA/C.mmp: An Experimental Computer System. McGraw-Hill, New York, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of St Andrews, UK

    R. Morrison, A. L. Brown, R. C. H. Connor, Q. I. Cutts & G. Kirby

  2. University of Adelaide, Australia

    A. Dearle

  3. University of Newcastle, Australia

    J. Rosenberg

  4. University of Massachusetts, USA

    D. Stemple

Authors
  1. R. Morrison
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. L. Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. C. H. Connor
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Q. I. Cutts
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. G. Kirby
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. A. Dearle
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. J. Rosenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. D. Stemple
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Newcastle, 2308, NSW, Australia

    John Rosenberg BSc, PhD

  2. Faculty of Mathematics and Computer Science, University of Bremen, Bibliothekstrasse, Postfach 330440, D-2800, Bremen 33, West Germany

    J. Leslie Keedy BD, DPhil, PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1990 British Computer Society

About this paper

Cite this paper

Morrison, R. et al. (1990). Protection in Persistent Object Systems. In: Rosenberg, J., Keedy, J.L. (eds) Security and Persistence. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3178-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3178-6_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19646-4

  • Online ISBN: 978-1-4471-3178-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation