DBScholar

Back to papers

Verifiable Properties of Database Transactions

Summary: Proves some transactions lack first-order weakest preconditions (WPs) and that the class of WP-admitting transactions cannot be captured by any transaction language. Introduces local vs. robust verifiability and shows robust FO verifiability exactly equals the local form, with implications for verifiable transaction-language design. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1081
Venue
PODS
Year
1996
Pagerank
6.205309e-05
Overall Rank
5,475 | 62.44%
DOI
10.1145/237661.237692

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{benedikt_pods96,
        address = {New York, NY, USA},
        series = {{PODS} '96},
        title = {{Verifiable Properties of Database Transactions}},
        url = {https://dl.acm.org/doi/10.1145/237661.237692},
        doi = {10.1145/237661.237692},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael and Griffin, Timothy and Libkin, Leonid},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,120 BlockchainDB - A Shared Database on Blockchains 2019 VLDB 0.00012096593
2,653 Foundations of Data-Aware Process Analysis: A Database Theory Perspective 2013 PODS 8.2898925e-05
3,002 A Framework for Implementing Hypothetical Queries 1997 SIGMOD 7.8667842e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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