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

Ting Yu, Owen Kaser

Research output: Contribution to journalArticle

2 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 languageEnglish
Pages (from-to)1085-1087
Number of pages3
JournalACM Transactions on Programming Languages and Systems
Volume19
Issue number6
Publication statusPublished - 1 Nov 1997
Externally publishedYes

Fingerprint

Networks (circuits)

Keywords

  • Call graphs
  • Inline substitution
  • Procedure inlining
  • Theory

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

A Note on "on the Conversion of Indirect to Direct Recursion". / Yu, Ting; Kaser, Owen.

In: ACM Transactions on Programming Languages and Systems, Vol. 19, No. 6, 01.11.1997, p. 1085-1087.

Research output: Contribution to journalArticle

@article{38b4881783aa45b79f0af6ed1cb4d6da,
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 = "11",
day = "1",
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/1

Y1 - 1997/11/1

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 - http://www.scopus.com/inward/record.url?scp=0031269638&partnerID=8YFLogxK

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

M3 - Article

VL - 19

SP - 1085

EP - 1087

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

SN - 0164-0925

IS - 6

ER -