A Note on "on the Conversion of Indirect to Direct Recursion"

Ting Yu; Owen Kaser

doi:10.1145/267959.269973

A Note on "on the Conversion of Indirect to Direct Recursion"

Ting Yu^*, Owen Kaser

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

In the article, "On the Conversion of Indirect to Direct Recursion" (ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduced to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and only if no strongly connected component contains two node-disjoint circuits. We first give a counterexample and then provide a correction.

Original language	English
Pages (from-to)	1085-1087
Number of pages	3
Journal	ACM Transactions on Programming Languages and Systems
Volume	19
Issue number	6
DOIs	https://doi.org/10.1145/267959.269973
Publication status	Published - Nov 1997
Externally published	Yes

Keywords

Call graphs
Inline substitution
Procedure inlining
Theory

Access to Document

10.1145/267959.269973

Cite this

@article{75d15eaa80734602bf3fa989e3a00bb2,

title = "A Note on {"}on the Conversion of Indirect to Direct Recursion{"}",

abstract = "In the article, {"}On the Conversion of Indirect to Direct Recursion{"} (ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduced to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and only if no strongly connected component contains two node-disjoint circuits. We first give a counterexample and then provide a correction.",

keywords = "Call graphs, Inline substitution, Procedure inlining, Theory",

author = "Ting Yu and Owen Kaser",

year = "1997",

month = nov,

doi = "10.1145/267959.269973",

language = "English",

volume = "19",

pages = "1085--1087",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "6",

}

TY - JOUR

T1 - A Note on "on the Conversion of Indirect to Direct Recursion"

AU - Yu, Ting

AU - Kaser, Owen

PY - 1997/11

Y1 - 1997/11

N2 - In the article, "On the Conversion of Indirect to Direct Recursion" (ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduced to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and only if no strongly connected component contains two node-disjoint circuits. We first give a counterexample and then provide a correction.

AB - In the article, "On the Conversion of Indirect to Direct Recursion" (ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduced to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and only if no strongly connected component contains two node-disjoint circuits. We first give a counterexample and then provide a correction.

KW - Call graphs

KW - Inline substitution

KW - Procedure inlining

KW - Theory

UR - https://www.scopus.com/pages/publications/0031269638

U2 - 10.1145/267959.269973

DO - 10.1145/267959.269973

M3 - Article

AN - SCOPUS:0031269638

SN - 0164-0925

VL - 19

SP - 1085

EP - 1087

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 6

ER -

A Note on "on the Conversion of Indirect to Direct Recursion"

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this