Semantics-based programanalysis for logic-based languages using XSB

International Journal on Software Tools for Technology Transfer

Volumn 2, Issue 1, 1998, Pages 29-45

  Codish, Michael ^a   Demoen, Bart ^b   Sagonas, Konstantinos ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Logic programming language analysis; Semantics based program analysis; XSB

Indexed keywords

ABSTRACT INTERPRETATIONS; ABSTRACT MACHINES; ABSTRACT PROGRAMS; LOGIC PROGRAMMING SYSTEMS; LOGIC-BASED LANGUAGES; OPTIMIZED CONTROL; PROGRAM ANALYSIS; XSB;

COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM INTERPRETERS; SEMANTICS;

ABSTRACTING;

EID: 84896692920     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050016     Document Type: Article

References (47)

1. Aiken, A., Lakshman, T. K.: Directional Type Checking of Logic Programs. In: Le Charlier, B. (ed.): Proc. of the First International Symposium on Static Analysis, Namur, Belgium, Sept. 1994. LNCS 864. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 43-60.
2. Baader, F., Siekmann, J. H.: Unification Theory. In: Gabbay, D. M., Hogger, C. J., Robinson, J. A., (eds.): The Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, Oxford UK: University Press, 1994, pp. 41-125.
3. Bagnara, R.: A Reactive Implementation of Pos using ROBDDs. In: Kuchen, H., Swierstra, S. D., (eds.): Proc. of the 8th International Symposium on PLILP, Aachen, Germany, Sept. 1996. LNCS 1140. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 107-121.
4. Barbuti, R., Giacobazzi, R., Levi, G.: A General Framework for Semantics-based Bottom-up Abstract Interpretation of Logic Programs. ACM Transactions on Programming Languages and Systems, 15(1): 133-181, 1993.
5. Bigot, P. A., Debray, S. K., Marriott, K.: Understanding Finiteness Analysis using Abstract Interpretation. In: Apt, K., (ed.): Proc. of the Joint International Conference and Symposium on Logic Programming, Washington, USA, Oct. 1992. The MIT Press, pp. 735-749.
6. Bossi, A., Gabrielli, M., Levi, G., Martelli, M.: The SSemantics Approach: Theory and Applications. Journal of Logic Programming, 19-20: 149-197, 1994.
7. Boye, J., Ma luszyński, J.: Directional Types and the Annotation Method. Journal of Logic Programming, 33(3): 179-220, 1997.
8. Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming, 10(2): 91-124, 1991.
9. Bruynooghe, M., Demoen, B., Boulanger, D., Denecker, M., Mulkers, A.: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. In: Cousot, R., Schmidt, D. A., (eds.): Proc. of the Third International Symposium on Static Analysis, Aachen, Germany, Sept. 1996. LNCS 1145. Berlin, Heidelberg, NewYork: Springer-Verlag pp. 128-142.
10. Bruynooghe, M., Janssens, G., Callebaut, A., Demoen, B.: Abstract Interpretation: Towards the Global Optimization of Prolog Programs. In: Proc. of the 1987 Symposium on Logic Programming, San Francisco, Sept. 1987. IEEE, Computer Society Press, pp. 192-204.
11. Bruynooghe, M., Leuschel, M., Sagonas, K.: A Polyvariant Binding Time Analysis for Off-line Partial Deduction. In: Hankin, C., (ed.): Programming Languages and Systems: Proc. of the 7th European Symposium on Programming, Lisbon, Portugal, Mar.-Apr. 1998. LNCS 1381. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 27-41.
12. Bueno, F., García de la Banda, M., Hermenegildo, M.: The PLAI Abstract Interpretation System. Technical report, CLIP2/94. 0, Computer Science Dept., Technical U. of Madrid (UPM), Feb. 1994.
13. Chen, W., Warren, D. S.: Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1): 20-74, 1996.
14. Codish, M., Bruynooghe, M., García de la Banda, M., Hermenegildo, M.: Exploiting Goal Independence in the Analysis of Logic Programs. Journal of Logic Programming, 32(3): 247-262, 1997.
15. Codish, M., Dams, D., Yardeni, E.: Bottom-up Abstract Interpretation of Logic Programs. Theoretical Computer Science, 124(1): 93-125, 1994.
16. Codish, M., Demoen, B.: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. In: B. Le Charlier, (ed.): Proc. of the First International Symposium on Static Analysis, Namur, Belgium, Sept. 1994. LNCS 864. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 281-297.
17. Codish, M., Demoen, B.: Analysing Logic Programs using "Prop"-ositional Logic Programs and a Magic Wand. Journal of Logic Programming, 25(3): 249-274, 1995.
18. Codish, M., Lagoon, V.: Type Dependencies for Logic Programs using ACI-unification. In: Proc. of the 1996 Israeli Symposium on Theory of Computing and Systems, IEEE Computer Science Press, June 1996, pp. 136-145. Extended version to appear in Theoretical Computer Science.
19. Codish, M., Lagoon, V., Bueno, F.: An Algebraic Approach to Sharing Analysis of Logic Programs. In: P. Van Henteryck, (ed.): Proc. of the Fourth International Symposium on Static Analysis, Paris, France, Sept. 1997. LNCS 1302. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 68-82. Full version at http://www. cs. bgu. ac. il/~mcodish/papers. html.
20. Cortesi, A., Filé, G., Winsborough, W.: Optimal Groundness Analysis using Propositional Logic. Journal of Logic Programming, 27(2): 137-167, 1996.
21. Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, 1977. ACM Press, pp. 238-252.
22. Dawson, S., Ramakrishnan, C. R., Warren, D. S.: Practical Program Analysis Using General Purpose Logic Programming Systems-A Case Study. In: Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Philadelphia, Pennsylvania, May 1996. ACM Press, pp. 117-126.
23. Debray, S. K.: Static Inference of Modes and Data Dependencies in Logic Programs. ACM Transactions on Programming Languages and Systems, 11(3): 418-450, 1989.
24. Debray, S. K., Warren, D. S.: Detection and Optimization of Functional Computations in Prolog. In: Shapiro, E., (ed.): Proc. of the Third International Conference on Logic Programming, London, July 1986. LNCS 225. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 490-504.
25. Debray, S. K., Warren, D. S.: Automatic Mode Inference for Logic Programs. Journal of Logic Programming, 5(3): 207-229, 1988.
26. Englebert, V., Le Charlier, B., Roland, D., Van Hentenryck, P.: Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and their Experimental Evaluation. Software Practice and Experience, 23(4): 419-459, 1993.
27. Falaschi, M., Levi, G., Palamidessi, C., Martelli, M.: Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3): 289-318, 1989.
28. Freire, J., Swift, T., Warren, D. S.: Beyond Depth-First Strategies: Improving Tabled Logic Programs through Alternative Scheduling. Journal of Functional and Logic Programming, 1998(3), Apr. 1998.
29. Gallagher, J. P., de Waal, D. A.: Fast and Precise Regular Approximations of Logic Programs. In: P. Van Hentenryck, (ed.): Proc. of the Eleventh International Conference on Logic Programming, Santa Margarita, Italy, June 1994. The MIT Press, pp. 599-613.
30. Giacobazzi, R., Scozzari, F.: Intuitionistic Implication in Abstract Interpretation. In: Glaser, H., Hartel, P., Kuchen, H., (eds.): Proc. of Ninth International Symposium on Programming Languages, Implementations, Logics and Programs PLILP '97, Sept. 1997. LNCS 1292. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 175-189.
31. Hermenegildo, M., Warren, R., Debray, S. K.: Global Flow Analysis as a Practical Compilation Tool. Journal of Logic Programming, 13(4): 349-366, 1992.
32. Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent And-Parallelism. Journal of Logic Programming, 13(2 & 3): 291-314, 1992.
33. Janssens, G., Bruynooghe, M., Dumortier, V.: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. In: Lloyd, J. W., (ed.): Proc. of the 1995 International Logic Programming Symposium, Portland, Oregon, Dec. 1995. The MIT Press, pp. 336-350.
34. Janssens, G., Sagonas, K.: On the Use of Tabling for Abstract Interpretation: An Experiment with Abstract Equation Systems. In: Proc. of TAPD-98: Tabulation in Parsing and Deduction, Paris, France, Apr. 1998, pp. 118-126. Available at http://www. cs. kuleuven. ac. be/~kostis/Papers.
35. Le Charlier, B., Van Hentenryck, P.: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. ACM Transactions on Programming Languages and Systems, 16(1): 35-101, 1994.
36. Lincoln, P., Christian, J.: Adventures in Associative-Commutative Unification. Journal of Symbolic Computation, 8(1/2): 217-240, July/Aug. 1989. Also appears in Unification, Kirchner C., (ed.): Academic Press, 1990, pp. 393-416.
37. Marriott, K., Søndergaard, H.: Bottom-Up Dataflow Analysis of Normal Logic Programs. Journal of Logic Programming, 13(2 & 3): 181-204, 1992.
38. Marriott, K., Søndergaard, H.: Precise and Efficient Groundness Analysis for Logic Programs. ACM Letters on Programming Languages and Systems, 2(1-4): 181-196, 1993.
39. Mellish, C.: Abstract Interpretation of Prolog Programs. In: Shapiro, E., (ed.): Proc. of the Third International Conference on Logic Programming, London, July 1986. LNCS 225. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 463-474.
40. Muthukumar, K., Hermenegildo, M.: Compile-time Derivation of Variable Dependency using Abstract Interpretation. Journal of Logic Programming, 13(2 & 3): 315-347, 1992.
41. Ramakrishnan, I. V., Rao, P., Sagonas, K., Swift, T., Warren, D. S.: Efficient Tabling Mechanisms for Logic Programs. In: Sterling, L., (ed.): Proc. of the 12th International Conference on Logic Programming, Tokyo, Japan, June 1995, pp. 687-711. The MIT Press. Extended version to appear in Journal of Logic Programming.
42. Sagonas, K., Swift, T.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM Transactions on Programming Languages and Systems, 20(3), 1998.
43. Sagonas, K., Swift, T., Warren, D. S.: XSB as an Efficient Deductive Database Engine. In: Proc. of the ACM SIGMOD International Conference on the Management of Data, Minneapolis, Minnesota, May 1994, pp. 442-453. ACM Press.
44. Van Hentenryck, P., Cortesi, A., Le Charlier, B.: Evaluation of the Domain Prop. Journal of Logic Programming, 23(3): 237-278, 1995.
45. Van Hentenryck, P., Degimbe, O., Le Charlier, B., Michel, L.: The Impact of Granularity in Abstract Interpretation of Prolog. In: Cousot, P., Falaschi, Filé, M. G., Rauzy, A., (eds.): Proc. of the Third International Workshop on Static Analysis (WSA'93), Padova, Italy, Sept. 1993. LNCS 724. Berlin, Heidelberg, NewYork: Springer-Verlag, pp. 1-14.
46. Warren, D. H. D.: An Abstract Prolog Instruction Set. Technical Report 309, SRI International, Menlo Park, U. S. A., Oct. 1983.
47. Warren, D. S.: Memoing for Logic Programs. Communications of the ACM, 35(3): 93-111, 1992.