76 search results - page 9 / 16 » Logic Programming Semantics Made Easy |
114
Voted
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Traditionally, synchronous languages, such as Esterel, have been compiled into hardware, where timing analysis is relatively easy. When compiled into software ? e.g., into sequent...
114
Voted
SIGSOFT
2003
ACM
16 years 3 months ago
2003
ACM
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
130
click to vote
SIGSOFT
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
223
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
109
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...