7103 search results - page 459 / 1421 » Components and Generative Programming |
166
Voted
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
171
click to vote
SPAA
2006
ACM
16 years 24 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
217
click to vote
HASKELL
2005
ACM
16 years 13 days ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
227
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
173
Voted
EMSOFT
2004
Springer
16 years 7 days ago
2004
Springer
We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each...