Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity

Author： Hornof

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.248, Iss.1, 2000-10, pp. : 3-27

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Growth-sensitivity of context-free languages

By Ceccherini-Silberstein T. Woess W.

Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. : 103-116

Elsevier

Access to resources Recommend Favorite

Linear time parsers for classes of non context free languages

By Kulkarni S.R. Shankar P.

Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. : 355-390

Elsevier

Access to resources Recommend Favorite

Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages

By Larmore L.L. Rytter W.

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 189-201

Elsevier

Access to resources Recommend Favorite

Strictness Analysis in the Imperative Lambda Calculus

By Springer J. Kamin S.N.

LISP and Symbolic Computation, Vol. 9, Iss. 1, 1996-02 ,pp. : 109-143

Springer Publishing Company

Access to resources Recommend Favorite

Sensitivity analysis of the rapid decomposition of methane in an aerosol flow reactor

By Dahl J.K. Weimer A.W. Krantz W.B.

International Journal of Hydrogen Energy, Vol. 29, Iss. 1, 2004-01 ,pp. : 57-65

Elsevier

Access to resources Recommend Favorite