3653 search results - page 410 / 731 » On Recognizable Timed Languages |
319
click to vote
POPL
2004
ACM
16 years 7 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...
287
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
204
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
253
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
195
click to vote
PEPM
2009
ACM
16 years 3 months ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...