AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.

Saumya K. Debray, David S. Warren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Scopus citations

Abstract

The problem of automatically inferring the modes of the predicates in a program is considered. The dataflow analysis used is more powerful than approaches relying on syntactic characteristics of programs. A sound and efficient treatment of variable aliasing in mode inference is given. By propagating instantiation information using state transformations, rather than through dependencies between variables, greater precision in the treatment of unification than in previous studies is achieved. Several optimizations to improve the performance of the mode inference algorithm are described, as are various program optimizations based on mode information.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages78-88
Number of pages11
ISBN (Print)0818607289
StatePublished - Dec 1 1986
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.'. Together they form a unique fingerprint.

Cite this