1559 search results - page 203 / 312 » Fundamentals of Generic Programming |
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
PODC
2009
ACM
15 years 7 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
CGO
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
EXPERT
2006
14 years 10 months ago
2006
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
ICTAC
2010
Springer
14 years 7 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...