2300 search results - page 199 / 460 » Maximally Concurrent Programs |
171
click to vote
ISNN
2005
Springer
15 years 12 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
178
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
291
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
294
click to vote
POPL
2007
ACM
16 years 6 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...
162
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...