1686 search results - page 75 / 338 » Programs as polygraphs: computability and complexity |
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
SC
1995
ACM
15 years 1 months ago
1995
ACM
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
AAAI
2007
15 years 2 days ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
105
click to vote
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
ICPP
1995
IEEE
15 years 1 months ago
1995
IEEE
Interactive program steering permits researchers to monitor and guide their applications during runtime. Interactive steering can help make end users more effective in addressing ...