3713 search results - page 504 / 743 » Constructing a Calculus of Programs |
130
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
265
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
135
click to vote
ICFP
2004
ACM
16 years 3 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...
132
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
136
click to vote
ISSTA
2009
ACM
15 years 10 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...