56 search results - page 7 / 12 » Default Timed Concurrent Constraint Programming |
160
click to vote
RISE
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
176
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
142
click to vote
ASAP
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
205
click to vote
PPOPP
1991
ACM
15 years 9 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
143
click to vote
SAC
1998
ACM
15 years 10 months ago
1998
ACM
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...