DBScholar

Back to papers

Coping with Complexity in Automated Reasoning about Database Systems

Summary: Reports experience scaling Boyer–Moore-style automated reasoning for database systems via specification-based development over finite sets and tuples. Mechanically proves 200+ lemmas and transaction-safety theorems, distilling techniques for controlling proof complexity in integrity-constraint checking. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7913
Venue
VLDB
Year
1985
Pagerank
5.093636e-05
Overall Rank
13,226 | 9.26%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{sheard_vldb85,
        title = {{Coping with Complexity in Automated Reasoning about Database Systems}},
        author = {Sheard, Tim and Stemple, David},
        journal = {PVLDB},
        series = {{VLDB} '85},
        pages = {426},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,923 On the Modes and Meaning of Feedback to Transaction Designers 1987 SIGMOD 6.4441344e-05
13,181 Supporting Office Document Architectures with Constrained Types 1987 SIGMOD 5.093636e-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