AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.

Saumya K Debray, David S. Warren

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

33 Citations (Scopus)

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 - 1986
Externally publishedYes

Fingerprint

Data flow analysis
Syntactics
Acoustic waves

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Debray, S. K., & Warren, D. S. (1986). AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS. In Unknown Host Publication Title (pp. 78-88). IEEE.

AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS. / Debray, Saumya K; Warren, David S.

Unknown Host Publication Title. IEEE, 1986. p. 78-88.

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

Debray, SK & Warren, DS 1986, AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS. in Unknown Host Publication Title. IEEE, pp. 78-88.
Debray SK, Warren DS. AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS. In Unknown Host Publication Title. IEEE. 1986. p. 78-88
Debray, Saumya K ; Warren, David S. / AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS. Unknown Host Publication Title. IEEE, 1986. pp. 78-88
@inproceedings{701562e08a014ca08b1fa534e6c9c61b,
title = "AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.",
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.",
author = "Debray, {Saumya K} and Warren, {David S.}",
year = "1986",
language = "English (US)",
isbn = "0818607289",
pages = "78--88",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - AUTOMATIC MODE INFERENCE FOR PROLOG PROGRAMS.

AU - Debray, Saumya K

AU - Warren, David S.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022985969&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022985969&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818607289

SP - 78

EP - 88

BT - Unknown Host Publication Title

PB - IEEE

ER -