Sciweavers

417 search results - page 7 / 84
» Results on Reasoning about Updates in Transaction Logic
Sort
View
DLOG
2003
15 years 1 months ago
Reasoning about Nominals with FaCT and RACER
We present a translation of looping alternating two-way automata into a comparably inexpressive description logic, which is contained in SHIQ. This enables us to perform the empti...
Jan Hladik
114
Voted
IPL
2008
102views more  IPL 2008»
15 years 13 days ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
91
Voted
SIGMOD
2004
ACM
103views Database» more  SIGMOD 2004»
16 years 18 days ago
A Read-Only Transaction Anomaly Under Snapshot Isolation
Snapshot Isolation (SI), is a multi-version concurrency control algorithm introduced in [BBGMOO95] and later implemented by Oracle. SI avoids many concurrency errors, and it never ...
Alan Fekete, Elizabeth J. O'Neil, Patrick E. O'Nei...
91
Voted
ATAL
2010
Springer
15 years 1 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
86
Voted
PODC
2010
ACM
15 years 4 months ago
Brief announcement: view transactions: transactional model with relaxed consistency checks
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
Yehuda Afek, Adam Morrison, Moran Tzafrir