7099 search results - page 346 / 1420 » Context for models of concurrency |
210
click to vote
IJCAI
1993
15 years 9 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
154
click to vote
ACL
2010
15 years 5 months ago
2010
We report on an experiment to track complex decision points in linguistic metadata annotation where the decision behavior of annotators is observed with an eyetracking device. As ...
323
click to vote
POPL
2009
ACM
16 years 8 months ago
2009
ACM
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, t...
343
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
207
click to vote
HOTOS
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...