DBScholar

Back to papers

Using Formal Methods To Reason About Semantics-Based Decompositions Of Transactions

Summary: Formal methods for semantics-based transaction decomposition; semantic histories yield proof obligations that ensure the decomposition faithfully models the original workload. Impact on atomicity, isolation, and consistency; presents a controlled technique to surrender these properties with formal guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h7d7fd276073bf86b
Venue
VLDB
Year
1995
Pagerank
4.9793485e-05
Overall Rank
13,297 | 10.60%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{ammann_vldb95,
        title = {{Using Formal Methods To Reason About Semantics-Based Decompositions Of Transactions}},
        author = {Ammann, Paul and Jajodia, Sushil and Ray, Indrakshi},
        journal = {PVLDB},
        series = {{VLDB} '95},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
1,894 Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase 1989 VLDB 9.4112104e-05
2,490 Formal Model of Correctness Without Serializability 1988 SIGMOD 8.3959371e-05
3,721 Simple Rational Guidance for Chopping Up Transactions 1992 SIGMOD 7.0714298e-05
Previous Page 1 / 1 Next

Semantically Similar Papers