293 search results - page 36 / 59 » Regular languages and their generating functions: The invers... |
ESOP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
117
click to vote
SAS
1995
Springer
15 years 3 months ago
1995
Springer
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
110
click to vote
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
14 years 11 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...