We present the rational construction of a generic domain for structural information analysis of CLP languages called Pattern(D#), where the parameter D# is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of logic programs Pat(R), which is due to Cortesi et al. However, the formalization of our CLP abstract domain is independent from specific implementation techniques: Pat(R) (suitably extended in order to deal with CLP systems omitting the occurs-check) is one of the possible implementations. Reasoning at a higher level of abstraction we are able to appeal to familiar notions of unification theory. This higher level of abstraction also gives considerable more latitude for the implementer. Indeed, as demonstrated by the results summarized here, an analyzer that incorporates structural information analysis based on our approach can be highly competitive both from the precision and, contrary to popular belief, from the efficiency point of view.

Efficient Structural Information Analysis for Real CLP Languages / BAGNARA R.; HILL P. M.; ZAFFANELLA E.. - 1955 of LNAI:(2000), pp. 189-206. ((Intervento presentato al convegno 7th International Conference on Logic for Programming and Automated Reasoning tenutosi a St Gilles, La Réunion, France nel November 6-10, 2000.

Efficient Structural Information Analysis for Real CLP Languages

BAGNARA, Roberto;ZAFFANELLA, Enea
2000

Abstract

We present the rational construction of a generic domain for structural information analysis of CLP languages called Pattern(D#), where the parameter D# is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of logic programs Pat(R), which is due to Cortesi et al. However, the formalization of our CLP abstract domain is independent from specific implementation techniques: Pat(R) (suitably extended in order to deal with CLP systems omitting the occurs-check) is one of the possible implementations. Reasoning at a higher level of abstraction we are able to appeal to familiar notions of unification theory. This higher level of abstraction also gives considerable more latitude for the implementer. Indeed, as demonstrated by the results summarized here, an analyzer that incorporates structural information analysis based on our approach can be highly competitive both from the precision and, contrary to popular belief, from the efficiency point of view.
9783540412854
Efficient Structural Information Analysis for Real CLP Languages / BAGNARA R.; HILL P. M.; ZAFFANELLA E.. - 1955 of LNAI:(2000), pp. 189-206. ((Intervento presentato al convegno 7th International Conference on Logic for Programming and Automated Reasoning tenutosi a St Gilles, La Réunion, France nel November 6-10, 2000.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11381/2297642
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact