Inference of Well-Typings for Logic Programs with Application to Termination Analysis-Reference-Cited by-同舟云学术

Inference of Well-Typings for Logic Programs with Application to Termination Analysis

Published:2005 Issue: Volume: Page:35-51
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Bruynooghe Maurice,Gallagher John,Van Humbeeck Wouter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11547662_5

Reference25 articles.

1. Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. Draft (2004)

2. Lecture Notes in Computer Science;M. Bruynooghe,2002

3. Bruynooghe, M., Gallagher, J., Van Humbeeck, W.: Inference of well-typings for logic programs with application to termination analysis. Technical Report CW 409, Dept. Comp. Sc., Katholieke Universiteit Leuven (2005)

4. Christiansen, H.: Deriving declarations from programs (extended abstract). In: CPP 1997, Workshop on Constraint Programming for Reasoning about Programming, Leeds (1997)

5. Frühwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: Logic in Computer Science, LICS 1991, pp. 300–309 (1991)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semantic query optimization in the presence of types;Journal of Computer and System Sciences;2013-09

2. A Polymorphic Type Dependency Analysis for Logic Programs;New Generation Computing;2011-10

3. Non-termination Analysis of Logic Programs Using Types;Logic-Based Program Synthesis and Transformation;2011

4. A Transformational Approach for Proving Properties of the CHR Constraint Store;Logic-Based Program Synthesis and Transformation;2010

5. Automated termination proofs for logic programs by term rewriting;ACM Transactions on Computational Logic;2009-10