Correctness in General Configurations of Transactional Components

Summary: Introduces a correctness criterion for composite transactional systems where independently managed components can be arbitrarily composed. Presents a novel proof technique to verify correctness in arbitrary configurations and analyzes concurrency-control implications for distributed transaction management. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1182
Venue: PODS
Year: 1999
Pagerank: -
Overall Rank: 13,920 | 3.17%
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 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
12,758	Correctness and Parallelism in Composite Systems	1997	PODS	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,629	A Theory of Timestamp-Based Concurrency Control for Nested Transactions	1988	VLDB	4.3139594e-05
1,753	Formal Model of Correctness Without Serializability	1988	SIGMOD	0.00010673887
2,723	The Homeostasis Protocol: Avoiding Transaction Coordination Through Program Analysis	2015	SIGMOD	8.2306728e-05
12,920	A Serialization Graph Construction for Nested Transactions	1990	PODS	4.1945683e-05
2,710	Towards a Unified Theory of Concurrency Control and Recovery	1993	PODS	8.2504476e-05
14,301	A Framework for Understanding Distributed (Deadlock Detection) Algorithms	1983	PODS	-
14,332	Transactions Modeling	1982	SIGMOD	-
8,941	On Correctness of Non-serializable Executions	1993	PODS	4.427232e-05
12,707	Concurrency Control and Recovery in Transactional Process Management	1999	PODS	4.1945683e-05
12,758	Correctness and Parallelism in Composite Systems	1997	PODS	4.1945683e-05