Multiple specialization using minimal-function graph semantics

DOI10.1016/0743-1066(92)90033-YMaRDI QIDQ4012710zbMATH OpenOpenAlexFDO

Authors Will Winsborough

Publication date 27 September 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90033-y

zbMATH Keywords

deterministic finite automatonoptimizing compilersinterprocedural analysisminimal-function graph semantics

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Recommendations

• Abstract multiple specialization and its application to program parallelization
• Specifying monogenetic specializers by means of a relation between source and residual programs
• Interprocedural analysis and optimization
• scientific article; zbMATH DE number 2080281
• scientific article; zbMATH DE number 1332628

Cited in

(4)

• Abstract multiple specialization and its application to program parallelization
• Termination of floating-point computations
• scientific article; zbMATH DE number 1617331 (Why is no real title available?)
• scientific article; zbMATH DE number 1497828 (Why is no real title available?)

This page was built for publication: Multiple specialization using minimal-function graph semantics

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