Lowerbound TimeComplexity Analysis of Logic Programs
 Publisher: MIT Press

Subject: QA76

References
(22)
[1] R. Barbuti, M. Codish, R. Giacobazzi, and M. Maher. Oracle Semantics for Prolog. Information and Computation, 22(2):178200, 1992.
[2] F. Benoy and A. King. Inferring Argument Size Relationships with CLP(R). In LOPSTR'96. SpringerVerlag, 1996.
[3] A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The ssemantics approach: theory and applications. Journal of Logic Programming, 1991.
[4] P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78, pages 8497, 1978.
[5] B. De Backer and H. Beringer. A CLP language handling disjunctions of linear constraints. In ICLP'93, pages 550563. MIT Press, 1993.
[6] S. Debray and N.W. Lin. Cost Analysis for Logic Programs. ACM TOPLAS, July 1992.
[7] S. Debray, N.W. Lin, and M. Hermenegildo. Task Granularity Analysis in Logic Programs. In PLDI'90, White Plains, New York, 1990. ACM.
[8] S. Debray, P. Lo´pez Garc´ıa, and M. Hermenegildo. NonFailure Analysis of Logic Programs. In ICLP'97. MIT Press, 1997.
[9] S. Debray, P. Lo´pez Garc´ıa, M. Hermenegildo, and N. Lin. Lower Bound Cost Estimation for Logic Programs. Technical Report TR Number CLIP20/95.0, T.U. of Madrid (UPM), Facultad Informa´tica UPM, 28660Boadilla del Monte, MadridSpain, 1995.
[10] S. Decorte, D. De Schreye, and M. Fabris. Automatic Inference of Norms: A Missing Link in Termination Analysis. In ICLP'93, pages 420436. MIT Press, 1993.

Metrics
0views in OpenAIRE0views in local repository14downloads in local repository
The information is available from the following content providers:
From Number Of Views Number Of Downloads Kent Academic Repository  IRUSUK 0 14

 Download from


Cite this publication