Search for Author All Reviews
	Burke, Michael     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Wide-coverage deep statistical parsing using automatic dependency structure annotation Cahill A., Burke M., O’Donovan R., Riezler S., van Genabith J., Way A. Computational Linguistics 34(1): 81-124, 2008.  Type: Article One important area of natural language processing (NLP) is language recognition. This paper compares the performance of two major approaches to language recognition: deep inference grammars, and shallow grammars combined with machine l...... Nov 5 2008     Interprocedural pointer alias analysis Hind M., Burke M., Carini P., Choi J. ACM Transactions on Programming Languages and Systems 21(4): 848-894, 1999.  Type: Article Three different algorithms for dataflow analysis of computer programs are presented. Compilers for programming languages that support dynamically allocated data structures, such as C, C++, Fortran 90, Java, and LISP need to make worst-...... Mar 1 2000     Interprocedural optimization: eliminating unnecessary recompilation Burke M., Torczon L. ACM Transactions on Programming Languages and Systems 15(3): 367-399, 1993.  Type: Article The authors discuss the use of interprocedural dataflow information in analysis that leads to reducing the recompilation needed when a procedure in a large program is changed. The paper is oriented specifically to FORTRAN and to a comp...... Jun 1 1995     Precise and efficient integration of interprocedural alias information into data-flow analysis Burke M., Choi J. ACM Letters on Programming Languages and Systems 1(1): 14-21, 1992.  Type: Article Dataflow analysis is used to gather information about where variables have their values set and used, in order to decide how to optimize a program. When two or more symbols can refer to the same variable, those symbols are called al...... Apr 1 1993     An interval-based approach to exhaustive and incremental interprocedural data-flow analysis Burke M. ACM Transactions on Programming Languages and Systems 12(3): 341-395, 1990.  Type: Article In this respectable research paper the author presents an original method to solve the archetypal interprocedural dataflow problem of computing the MOD and REF sets for each procedure in a complete program. His method is based on the d...... May 1 1991
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy