A Formal System for Reasoning about Programs Accessing a Relational Database

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 2, Issue 3, 1980, Pages 386-414

  Casanova, Marco R ^a   Bernstein, Phillip A ^b  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b HARVARD UNIVERSITY   (United States)

Author keywords

aggregation operators; consistency preservation; data definition languages; data manipulation languages; dynamic logic; formal systems; many sorted first order logic; program correctness; relational databases; serializability; synchronization; transactions

Indexed keywords

APPLICATION PROGRAMS;

DATA AGGREGATION; DATA MANIPULATIONS; DATA-DEFINITION LANGUAGES; DYNAMIC LOGIC; FIRST-ORDER LANGUAGE; FORMAL SYSTEMS; REASONING ABOUT PROGRAMS; RELATIONAL DATABASE;

RELATIONAL DATABASE SYSTEMS;

EID: 84976782766     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/357103.357111     Document Type: Article

References (35)

1. Aho, A.V., and Ullman, J.B. Universality of data retrieval languages. In Proc. 6th Annu. ACM Symp. Principles of Programming Languages, Jan. 1979, pp. 110-120.
2. Bancilhon, F. On the completeness of query languages for relational data bases. In Proc. 7th Symp. Math. Foundations of Computer Science, Zakopane, Poland (Lecture Notes in Computer Science, Springer-Verlag, New York, Sept. 1978).
3. Bernstein, P.A., et al. A formal model of concurrency control mechanisms for database systems. IEEE Trans. Softw. Eng. (May 1979).
4. Bernstein, P.A., Shipman, D.W., and Rothnie, J.B., Jr. Concurrency control in a system for distributed databases (SDD-1). ACM Trans. Database Syst. 5, 1 (March 1980), 18-51.
5. Casanova, M.A. The concurrency control problem for database systems. Ph.D. dissertation, Harvard Univ., Cambridge, Mass., Nov. 1979.
6. Casanova, M.A., and Bernstein, P.A. The logic of a relational data manipulation language. In Proc. 6th ACM Symp. Principles of Programming Languages, Jan. 1979, pp. 101-109.
7. Chamberlin, D.D., et al. SEQUEL-2: A unified approach to data definition manipulation and control. Tech. Rep. RJ 1798, IBM, New York, June 1976.
8. Chandra, A.K., and Harel, D. Computable queries for relational databases. In Proc. 11th ACM Symp. Theory of Computing, May 1979.
9. Clarke, E.M., Jr. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. J. ACM 26, 1 (Jan. 1979), 129-147.
10. Codd, E.F. A database sublanguage founded on the relational calculus. In Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control.
11. Codd, E.F. A relational model of data for large shared data banks. Commun. ACM 13, 6 (June 1970), 377-387.
12. Cook, S.A. Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7, 1 (Feb. 1978).
13. Dayal, U. Schema mapping problems in database systems. Ph.D. dissertation, Harvard Univ., Cambridge, Mass., Aug. 1979.
14. Dijkstra, E.W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.
15. Enderton, H.B. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
16. Eswaran, K.P. Specifications, implementations and interactions of a trigger subsystem in an integrated database system. Tech. Rep. RJ1820, IBM, New York, Aug. 1976.
17. Eswaran, K.P., et al. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (Nov. 1976), 624-633.
18. Flon, L., and Suzuki, N. Nondeterminism and the correctness of parallel programs. Presented at the IFIP Conf. Working Group on Formal Specifications of Programming Languages, Aug. 1977.
19. Gardarin, G., and Melkanoff, M. Proving consistency of database transactions. In Proc. 1979 Int. Conf. Very Large Data Bases, Oct. 1979, pp. 291-298.
20. Harel, D. First-order dynamic logic. In Lecture notes in Computer Science, vol. 68, Springer-Verlag, New York, 1979.
21. Held, G. D., Stonebraker, M.R., and Wong, E. INGRES—A relational database system. In Proc. 1975 AFIPS NCC, AFIPS Press, Arlington, Va., pp. 409-416.
22. Hoare, C.A.R. An axiomatic basis for computer programming. Commun. ACM 12, 10 (Oct. 1969), 576-580.
23. Information management system virtual storage (IMS/VS) general information manual. IBM no. GH20-1260, IBM, New York.
24. Lamport, L. Towards a theory of correctness for multi-user data base system. Tech. Rep. TR-CA-7610-0712, Massachusetts Computer Associates, Oct. 1976.
25. Minker, J. Search strategy and selection function for an inferential relational system ACM Trans. Database Syst. 3, 1 (Mar. 1978), 1-31.
26. Nicolas, J.M. First-order logic formalization for functional, multivalued and mutual dependencies. In Proc. 1978 ACM-SIGMOD Int. Conf. Management of Data, May 1978, pp. 40-46.
27. Papadimitriou, C.H., Bernstein, P.A., and Rothnie, J.B. Some computational problems related to database concurrency control. In Proc. Conf. Theoretical Computer Science, Aug. 1977, pp. 275-282.
28. Pratt, V.R. Semantical considerations on Floyd-Hoare logic. In Proc. 17th IEEE Symp. Foundations of Computer Science, Oct. 1976, pp. 109-120.
29. Schmidt, J.W. Some high-level language constructs for data of type relation. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 247-261.
30. Shoenfield, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967.
31. Stearns, R.E., et al. Concurrency control for database systems. In Proc. 17th IEEE Symp. Foundations of Computer Science, Oct. 1976, pp. 19-32.
32. Stonebraker, M. Implementation of integrity constraints and views by query modification. In Proc. ACM-SIGMOD Int. Conf. Management of Data, May 1975.
33. Stonebraker, M., Wong, E., and Kreps, P. The design and implementation of INGRES. ACM Trans. Database Syst. 1, 3 (Sept. 1976), 189-222.
34. Thomas, R.H. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4, 2 (June 1979), 180-209.
35. Van Emden, M.H. Computation and deductive information retrieval. Presented at the IFIP Conf. Working Group on Formal Specifications of Programming Languages, Aug. 1977.