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

Jump Minimization in Linear Time

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

DOI10.1145/1780.357262zbMATH Open0542.68005OpenAlexW2093832962MaRDI QIDQ3330482FDOQ3330482

M. V. S. Ramanath, Marvin Solomon

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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




Recommendations

  • Branch distance optimization of structured programs
  • Eliminating go to's while preserving program structure
  • scientific article; zbMATH DE number 3965407
  • Publication:4886067
  • Register Allocation in Structured Programs


zbMATH Keywords

loopsexit statement


Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)



Cited In (3)

  • Title not available (Why is that?)
  • An optimal algorithm for purging regular hammocks
  • Title not available (Why is that?)





This page was built for publication: Jump Minimization in Linear Time

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

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