Program Improvement by Source-to-Source Transformation

From MaRDI portal

Revision as of 09:02, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4131617

Jump to:navigation, search

DOI10.1145/321992.322000zbMath0359.68016OpenAlexW2077265102MaRDI QIDQ4131617

David B. Loveman

Publication date: 1977

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (8)

Efficient symbolic analysis of programs ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ Correctness of the compiling process based on axiomatic semantics ⋮ An algebraic definition for control structures ⋮ On correct refinement of programs ⋮ The method of attributes for data flow analysis. I: Exhaustive analysis ⋮ Synthetic programming ⋮ A note on a fast algorithm for sparse matrix multiplication

This page was built for publication: Program Improvement by Source-to-Source Transformation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4131617&oldid=17922108"