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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Tim Sheard
- 2. David Stemple
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,530 | On the Modes and Meaning of Feedback to Transaction Designers | 1987 | SIGMOD | 6.105111e-05 |
| 12,994 | Supporting Office Document Architectures with Constrained Types | 1987 | SIGMOD | 4.1905499e-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 |
|---|---|---|---|---|
| 163 | Some High-level Language Constructs for Data of Type Relation | 1977 | SIGMOD | 0.0003980026 |
| 2,256 | An Enhanced Inference Mechanism for Generating Relational Algebra Queries | 1984 | PODS | 9.1815561e-05 |
| 13,044 | Specification and Verification of Abstract Database Types | 1984 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,246 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2039096e-05 |
| 850 | Optimizing the Rule-Data Interface in a KMS | 1986 | VLDB | 0.00015911875 |
| 13,011 | Adaptive Predicate Managers in Database Systems | 1986 | VLDB | 4.1905499e-05 |
| 3,922 | On the Complexity of Deriving Schema Mappings from Database Instances | 2008 | PODS | 6.6238781e-05 |
| 3,931 | On The Complexity And Axiomatizability Of Consistent Database States | 1984 | PODS | 6.6192327e-05 |
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
| 8,326 | Resolving the Tension between Integrity and Security Using a Theorem Prover | 1988 | SIGMOD | 4.5392079e-05 |
| 6,519 | Complexity Aspects of Various Semantics for Disjunctive Databases | 1993 | PODS | 5.0239231e-05 |
| 14,233 | Synthesizing Database Transactions | 1990 | VLDB | - |
| 13,044 | Specification and Verification of Abstract Database Types | 1984 | PODS | 4.1905499e-05 |