1805 search results - page 164 / 361 » Functional programming with structured graphs |
114
click to vote
LCPC
2005
Springer
15 years 6 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ...
116
click to vote
HICSS
1995
IEEE
15 years 4 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...
191
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
131
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...