3653 search results - page 525 / 731 » On Recognizable Timed Languages |
288
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
278
click to vote
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
Software defects, commonly known as bugs, present a serious challenge for system reliability and dependability. Once a program failure is observed, the debugging activities to loc...
186
click to vote
PPOPP
2009
ACM
16 years 6 months ago
2009
ACM
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
281
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
164
click to vote
ICFP
2004
ACM
16 years 6 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...