1559 search results - page 149 / 312 » Fundamentals of Generic Programming |
114
click to vote
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
138
click to vote
DAC
2005
ACM
15 years 11 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
ICFP
2008
ACM
15 years 10 months ago
2008
ACM
XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore,...
CF
2009
ACM
15 years 4 months ago
2009
ACM
Multi-core platforms have proven themselves able to accelerate numerous HPC applications. But programming dataintensive applications on such platforms is a hard, and not yet solve...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...