1127 search results - page 124 / 226 » The XIS Generative Programming Techniques |
ISSTA
2010
ACM
14 years 11 months ago
2010
ACM
With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-determinist...
JDA
2006
14 years 11 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
100
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
JUCS
2002
14 years 11 months ago
2002
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
SCP
2010
14 years 9 months ago
2010
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...