Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Recursion analysis for compiler optimization

From MaRDI portal
Publication:4101422
Jump to:navigation, search

DOI10.1145/360336.360341zbMATH Open0334.68019OpenAlexW1980821888WikidataQ122745947 ScholiaQ122745947MaRDI QIDQ4101422FDOQ4101422


Authors: Kenneth G. Walter Edit this on Wikidata


Publication date: 1976

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360336.360341





Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)



Cited In (3)

  • A polynomial determination of the most-recent property in Pascal-like programs
  • Polynomial recursion analysis in Pascal like programs
  • Pseudo-recursive procedures





This page was built for publication: Recursion analysis for compiler optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101422)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4101422&oldid=17869260"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 07:05. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki