176 search results - page 28 / 36 » Truly concurrent constraint programming |
TRIER
2002
13 years 9 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
LCTRTS
2005
Springer
14 years 3 months ago
2005
Springer
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
PPOPP
2005
ACM
14 years 3 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
ENTCS
2002
13 years 9 months ago
2002
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...