291 search results - page 34 / 59 » Liveness-Preserving Atomicity Abstraction |
112
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
115
click to vote
POPL
2009
ACM
15 years 8 months ago
2009
ACM
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
RELMICS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
133
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
124
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...