Inferring argument size relationships with CLP( $$\mathcal{R}$$ )-Reference-Cited by-同舟云学术

Inferring argument size relationships with CLP( $$\mathcal{R}$$ )

Published:1997 Issue: Volume: Page:204-223
ISSN:0302-9743
Container-title:Logic Program Synthesis and Transformation
language:
Short-container-title:

Author:

Benoy Florence,King Andy

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62718-9_12.pdf

Reference32 articles.

1. R. Bagnara. On the detection of implicit and redundant numeric constraints in CLP programs. In GULP-PRODE'94, pages 312–326, 1994.

2. R. Bagnara. A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages. Technical Report TR-96-10, Dipartimento di Informaticá, Universita di Pisa corso Italia 40, 56125 Pisa, Italy, 1996.

3. R. Bagnara, R. Giacobazzi, and G. Levi. Static Analysis of clp Programs over Numeric Domains. In WSA'92, 1992.

4. V. Balasundaram and K. Kennedy. A Technique for Summarizing Data Access and Its Use in Parallelism Enhancing Transformations. In PLDI'89, pages 41–53. ACM Press, 1989.

5. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 1991.

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

1. Analysis and Transformation of Constrained Horn Clauses for Program Verification;Theory and Practice of Logic Programming;2021-11-15

2. Predicate Pairing for program verification;Theory and Practice of Logic Programming;2017-12-04

3. Horn clause verification with convex polyhedral abstraction and tree automata-based refinement;Computer Languages, Systems & Structures;2017-01

4. Combining Forward and Backward Abstract Interpretation of Horn Clauses;Static Analysis;2017

5. Constraint Specialisation in Horn Clause Verification;Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation;2015-01-13