N.-W. Lin, Automatic Complexity Analysis of Logic Programs, Ph.D. Dissertation, The University of Arizona, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
GRANLOG: An Integrated Granularity Analysis Model for.. - Barbosa, Vargas.. (2000) (Correct)
....granularity analysis for concurrent logic languages such as FGHC [21] and for parallel logic programming systems that exploit independent [22] and dependent [28] and parallelism. Besides, Debray et al. have developed the CASLOG system to perform complexity analysis of goals and clauses [4][5]. In this work we present a more complete framework for compile time granularity analysis and its implementation, GRANLOG (GRanularity ANalyzer for LOGic programs) GRANLOG performs automatic granularity analysis of Prolog programs and generates annotated programs. It uses several advanced ....
....GRANLOG (GRanularity ANalyzer for LOGic programs) GRANLOG performs automatic granularity analysis of Prolog programs and generates annotated programs. It uses several advanced static analysis techniques such as Global Analysis via Abstract Interpretation [23] 1] 2] and Complexity Analysis [3] 4][5]. The information generated by the system can be used in applications such as scheduling decisions and program execution simulation. In order to demonstrate the usefulness of GRANLOG, scheduling strategies based on information generated by the system were implemented. These strategies were applied ....
[Article contains additional citation context not shown here]
N. Lin, Automatic Complexity Analysis of Logic Programs (PhD Thesis, University of Arizona, Tucson, 1993).
Estimating the Computational Cost of Logic Programs - Debray, Garcia.. (1994) (5 citations) Self-citation (Lin) (Correct)
No context found.
N.-W. Lin, Automatic Complexity Analysis of Logic Programs, Ph.D. Dissertation, The University of Arizona, 1993.
Estimating the Computational Cost of Logic Programs - Debray, García.. (1994) (5 citations) Self-citation (Lin) (Correct)
....bound cost estimation for deterministic programs. Subsequently we were able to make some progress on estimating (upper bounds on) the number of solutions a procedure might produce [4] This resulted in a framework for upper bound analysis of logic programs, discussed in Section 3 and detailed in [3, 8]. Recently, we have made some progress on our original goal of lower bound cost estimation: these ideas are discussed in Section 4, with details in [6] Together, this provides a framework for reasoning about the computational cost of a reasonably large class of logic programs, though there is a ....
N.-W. Lin, Automatic Complexity Analysis of Logic Programs, Ph.D. Dissertation, The University of Arizona, 1993.
Distributed OR Scheduling with Granularity - Information Patrcia Kayser (2000) (Correct)
No context found.
N. LIN. Automatic Complexity Analysis of Logic Programs. PhD Thesis, Department of Computer Science, University of Arizona, Tucson: University of Arizona, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC