1710 search results - page 191 / 342 » High-Level Programs and Program Conditions |
132
click to vote
DC
2010
15 years 1 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
131
click to vote
VLDB
1994
ACM
15 years 5 months ago
1994
ACM
Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Con...
104
click to vote
LICS
1997
IEEE
15 years 5 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
205
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
123
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...