Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains

Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy, Baudouin Le Charlier. Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains. In Maurice Bruynooghe, Jaan Penjam, editors, Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP 93, Tallinn, Estonia, August 25-27, 1993, Proceedings. Volume 714 of Lecture Notes in Computer Science, pages 75-91, Springer, 1993.

Abstract

Abstract is missing.