Abstraction in recovery management
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Abstract data types and the development of data structures
Communications of the ACM
Abstract data types and software validation
Communications of the ACM
Communications of the ACM
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Reduction: a method of proving properties of parallel programs
Communications of the ACM
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
Specifications and proofs for abstract data types in concurrent programs
Specifications and proofs for abstract data types in concurrent programs
| Hi-index | 0.03 |
It is argued that the design and analysis of a concurrent system can be made simpler and more intuitive if execution times of abstract operations are arbitrarily but systematically defined. This technique (time abstraction) is complementary to data abstraction and is more effective when used in combination with data abstraction. As examples, a bounced-buffer monitor and a multilevel concurrency scheme for a database system are analyzed by using data and time abstraction.