Sciweavers

9 search results - page 1 / 2
» Specifying Transactions for Extended Abduction
Sort
View
KR
1998
Springer
13 years 8 months ago
Specifying Transactions for Extended Abduction
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
Katsumi Inoue, Chiaki Sakama
VLDB
1993
ACM
112views Database» more  VLDB 1993»
13 years 8 months ago
Specifying and Enforcing Intertask Dependencies
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or work ows that access heterogeneous databases and legac...
Paul C. Attie, Munindar P. Singh, Amit P. Sheth, M...
ICDE
1996
IEEE
155views Database» more  ICDE 1996»
14 years 5 months ago
DSDT: Durable Scripts Containing Database Transactions
DSDT is a programming tool for writing durable scripts which contain short ACID transactions as components. The context of the script is made durable by writing a log record whene...
Betty Salzberg, Dimitri Tombroff
VMCAI
2009
Springer
13 years 11 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 1 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett