VVSL Specification of a Transaction-oriented Access Handler

  • C. A. MiddelburgEmail author
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


VVSL is a mathematically well-defined VDM-like specification language with features for (1) modular structuring and (2) specifying operations which interfere through a partially shared state. This paper gives an short overview of these features. Thereafter, the VVSL specification of an access handler interface given in [1] is outlined. The purpose is to clarify the extent to which the description of interfaces to software systems can be improved by the special features of VVSL. This issue is further discussed. The access handler interface concerned is a hypothetical interface which is meant to provide for a way of looking at transaction management.


Temporal Logic Modular Structure Concurrency Control Internal Interface Concurrent Execution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C.A. Middelburg. Syntax and Semantics of VVSL — A Language for Structured VDM Specifications. PhD thesis, University of Amsterdam, September 1990. Available from PTT Research, Dr. Neher Laboratories.Google Scholar
  2. [2]
    C.A. Middelburg. The VIP VDM specification language. In R. Bloomfield, L. Marshall, and R. Jones, editors, VDM ’88, pages 187–201. Springer Verlag, LNCS 328, September 1988.Google Scholar
  3. [3]
    C.A. Middelburg. VVSL: A language for structured VDM specifications. Formal Aspects of Computing, 1 (1): 115–135, 1989.CrossRefGoogle Scholar
  4. [4]
    ESPRIT. PCTE Functional Specifications,4th edition, June 1986.Google Scholar
  5. [5]
    C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall, second edition, 1990.Google Scholar
  6. [6]
    VIP Project Team. Kernel interface: Final specification. Report VIP.T.E.8. 2, VIP, December 1988. Available from PTT Research.Google Scholar
  7. [7]
    VIP Project Team. Man machine interface: Final specification. Report VIP.T.E.8. 3, VIP, December 1988. Available from PTT Research.Google Scholar
  8. [8]
    VIP Project Team. VDM extensions: Initial report. Report VIP.T.E.4. 1, VIP, December 1987.Google Scholar
  9. [9]
    H.E. Oliver. Formal Specification Methods for Reusable Software Components. PhD thesis, University College of Wales, Aberystwyth, 1988.Google Scholar
  10. [10]
    C.A. Middelburg. Experiences with combining formalisms in VVSL. In J.A. Bergstra and L.M.G. Feijs, editors, Algebraic Methods II: Theory, Tools and Applications, pages 83–103. Springer Verlag, LNCS 490, 1991.Google Scholar
  11. [11]
    H.B.M. Jonkers. An introduction to COLD-K. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 139–205. Springer Verlag, LNCS 394, 1989.Google Scholar
  12. [12]
    H.B.M. Jonkers. Description algebra. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 283–305. Springer Verlag, LNCS 394, 1989.Google Scholar
  13. [13]
    L.M.G. Feijs. The calculus air. In M. Wirsing and J.A. Bergstra, editors, Algebraic Methods: Theory, Tools and Applications, pages 307–328. Springer Verlag, LNCS 394, 1989.Google Scholar
  14. [14]
    C.A. Middelburg. Modular structuring of VDM specifications in VVSL. Pub. 288/91, PTT Research, March 1991. To appear in Formal Aspects of Computing, 4 (1), 1992.Google Scholar
  15. [15]
    J.S. Fitzgerald and C.B. Jones. Modularizing the formal description of a database system. In D. Bjorner, C.A.R. Hoare, and H. Langmaack, editors, VDM ’80, pages 189–210. Springer Verlag, LNCS 428, 1990.Google Scholar
  16. [16]
    Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In R. Parikh, editor, Proceedings Logics of Programs 1985, pages 196–218. Springer Verlag, LNCS 193, 1985.Google Scholar
  17. [17]
    R. Hale and B. Moskowski. Parallel programming in temporal logic. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Proceedings PARLE, Volume II, pages 277–296. Springer Verlag, LNCS 259, 1987.Google Scholar
  18. [18]
    H. Barringer and R. Kuiper. Hierarchical development of concurrent systems in a temporal logic framework. In S.D. Brookes, A.W. Roscoe, and G. Winskel, editors, Seminar on Concurrency, pages 35–61. Springer Verlag, LNCS 197, 1985.Google Scholar
  19. [19]
    M.D. Fisher. Temporal logics for abstract semantics. Technical Report UMCS–87–12–4, University of Manchester, Department of Computer Science, 1987.Google Scholar
  20. [20]
    C.A. Middelburg. Specification of interfering programs based on inter- conditions. Pub. 166/91, PTT Research, March 1991.Google Scholar
  21. [21]
    H. Barringer, H. Cheng, and C.B. Jones. A logic covering undefinedness in program proofs. Acta Informatica, 21: 251–269, 1984.MathSciNetzbMATHCrossRefGoogle Scholar
  22. [22]
    M.L. Brodie and J.W. Schmidt. Final Report of the ANSI/X3/SPARC DBS-SG Relational Database Task Group. Doc. No. SPARC-81–690, 1981.Google Scholar
  23. [23]
    E.F. Codd. A relational model for large shared data banks. Communications of the ACM, 13 (6): 377–387, 1970.zbMATHCrossRefGoogle Scholar
  24. [24]
    D. Bj0rner. Formalization of data models. In D. Bjorner and C.B. Jones, editors, Formal Specification and Software Development, chapter 12. Prentice-Hall, 1982.Google Scholar
  25. [25]
    K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger. The notion of consistency and predicate locks in a database system. Communications of the ACM, 19 (11): 624–633, 1976.MathSciNetzbMATHCrossRefGoogle Scholar
  26. [26]
    H.T. Kung and C.H. Papadimitriou. An optimality theory of concurrency control for databases. Acta Informatica, 19: 1–11, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  27. [27]
    J.N. Gray. Notes on database operating systems. In R. Bayer, R.M. Graham, and G. Seegmüller, editors, Operating Systems: An Advanced Course, pages 393–481. Springer-Verlag, LNCS 60, 1978.Google Scholar
  28. [28]
    T. Haerder and A. Reuter. Principles of transaction-oriented database recovery. ACM Computing Surveys, 15 (4): 287–317, 1983.MathSciNetCrossRefGoogle Scholar
  29. [29]
    D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis II. System level concurrency control for distributed database systems. ACM Transactions on Database Systems, 3 (2): 178–198, 1978.CrossRefGoogle Scholar
  30. [30]
    J.N. Gray, R.A. Lorie, G.R. Putzolu, and I.L. Traiger. Granularity of locks and degrees of consistency in a shared data base. In G.M. Nijssen, editor, Modelling in Data Base Management Systems, pages 365–394. North Holland, 1976.Google Scholar
  31. [31]
    C.B. Jones. Specification and design of (parallel) programs. In R.E.A. Mason, editor, IFIP ’83, pages 321–332. North-Holland, 1983.Google Scholar
  32. [32]
    K. Stolen. Development of parallel programs on shared data–structures. Technical Report UMCS–91–1–1, University of Manchester, Department of Computer Science, 1991.Google Scholar

Copyright information

© Springer-Verlag London 1992

Authors and Affiliations

  1. 1.Dept. of Computer SciencePTT ResearchLeidschendamThe Netherlands

Personalised recommendations