Mode checking using constrained regular trees (1998) [2 citations — 0 self]
Abstract:
In a previous paper we presented a high level polymorphic mode system for logic programs. In this paper we present an algorithm which checks if a program is well moded, given that is it well-typed in the sense of Mycroft and O'Keefe. A program is well-moded if the set of ground atoms defined by mode declarations is a superset of the success set. The novelty of the algorithm is the expressiveness of the mode declarations. Constrained regular trees are used to define sets of terms and atoms. These are based on polymorphic types but allow set and multiset constraints over type variables. The expressiveness of this domain makes it very promising for many program analysis applications. Complexity is also (exponentially) better than other proposed domains for certain analysis tasks.
Citations
| 724 | Symbolic boolean manipulation with Ordered Binary Decision Diagrams – Bryant - 1992 |
| 51 | A framework of directionality for proving termination of logic programs – Bronsard, Lakshman, et al. - 1992 |
| 38 | Type Dependencies for Logic Programs using ACIunification – Codish, Lagoon |
| 20 | A Polymorphic Type System with Subtypes for Prolog – Dietrich, Hagl - 1988 |
| 18 | Two aspects of directional types – Boye, Maluszynski - 1995 |
| 12 | An algebraic approach to sharing analysis of logic programs – Codish, Lagoon, et al. - 1997 |
