709 search results - page 119 / 142 » On LR(k)-Parsers of Polynomial Size |
SAS
2010
Springer
14 years 8 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
IANDC
2011
14 years 4 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
JCT
2011
14 years 4 months ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...