Search for Author All Reviews
	Chin, Wei     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       Automatically refining partial specifications for heap-manipulating programs Qin S., He G., Luo C., Chin W., Yang H. Science of Computer Programming 8256-76, 2014.  Type: Article Formally specifying the behavior of pointer-based programs as a prerequisite of their computer-aided verification is difficult and error-prone. One has not only to specify the shape of the data structures, but also the properties that ...... Aug 5 2014     A new algorithm for regularizing one-letter context-free grammars Andrei S., Cavadini S., Chin W. Theoretical Computer Science 306(1-3): 113-122, 2003.  Type: Article This is part of an ongoing search for classes of context-free languages that can be regularized, and efficient methods for their construction. The basic notations and notions of context-free language theory are included (with the odd o...... Dec 17 2003     A transformation method for dynamic-sized tabulation Chin W., Hagiya M. (ed) Acta Informatica 32(2): 93-115, 1995.  Type: Article Direct computation of recursive functions often leads to a repeated evaluation of the same recursive calls. Various techniques to overcome this drawback exist. The authors develop their methods on the basis of tupling and memoization, ...... Jul 1 1996     A reexamination of “Optimization of array subscript range checks” Chin W., Goh E. ACM Transactions on Programming Languages and Systems 17(2): 217-227, 1995.  Type: Article Chin and Goh present and remedy some flaws in the optimization techniques of array subscript range checks, proposed in Asuru [1]. This paper reveals the flaws in three of Asuru’s proposed techniques: loop guard elimination, c...... Apr 1 1996     Shortest watchman routes in simple polygons Chin W., Ntafos S. Discrete & Computational Geometry 5(5): 9-31, 1990.  Type: Article The authors call a path in a polygon a watchman route if it is a closed cycle such that every point in the polygon is visible (by interior line of sight) from some point of the route. Thus a watchman could follow this route to p...... Mar 1 1991
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy