Database Paper Browser

Back to papers

Coping with Complexity in Automated Reasoning about Database Systems

Summary: Boyer–Moore style theorem proving for database systems, grounded in finite sets and tuples, with 200+ mechanically proven theorems and verified transaction safety on moderately constrained databases. Analyzes sources of complexity and practical strategies to tame it, proposing a transferable methodology for automatic reasoning about integrity constraints, queries, and system design. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7722
Venue
VLDB
Year
1985
Pagerank
4.1945683e-05
Overall Rank
13,027 | 9.38%
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,532 On the Modes and Meaning of Feedback to Transaction Designers 1987 SIGMOD 6.1072875e-05
12,983 Supporting Office Document Architectures with Constrained Types 1987 SIGMOD 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers