63 search results - page 2 / 13 » Efficient Computation of Throughput Values of Context-Free L... |
ECOOP
2009
Springer
14 years 6 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
ARC
2008
Springer
13 years 7 months ago
2008
Springer
As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applica...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of ma...
NLP
2000
13 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...