Database Paper Browser

Back to papers

Specification and Verification of Abstract Database Types

Summary: Models a DB (schema, constraints, transactions, queries) as an ADT whose values are legal database states and defines transaction safety as closure on that state set. Provides a designer-friendly spec and adapts Boyer–Moore proving by encoding transactions as recursive-list functions for mechanical safety proofs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
705
Venue
PODS
Year
1984
Pagerank
5.1725247e-05
Overall Rank
13,044 | 9.35%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,850 On the Modes and Meaning of Feedback to Transaction Designers 1987 SIGMOD 6.5434939e-05
13,038 Coping with Complexity in Automated Reasoning about Database Systems 1985 VLDB 5.1725247e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
225 Some High-level Language Constructs for Data of Type Relation 1977 SIGMOD 0.00024203877
528 Efficient Monitoring of Database Assertions 1978 SIGMOD 0.00017107035
1,588 Fast Methods For Testing Quantified Relational Calculus Assertions 1982 SIGMOD 0.00010351049
Previous Page 1 / 1 Next

Semantically Similar Papers