Polynomial recursion analysis in Pascal like programs

DOI10.1007/3-540-54415-1_58MaRDI QIDQ5096232zbMATHOpenAlexFDO

Authors Dieter Armbruster

Publication date 16 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54415-1_58

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A polynomial determination of the most-recent property in Pascal-like programs
• Pseudo-recursive procedures
• scientific article; zbMATH DE number 3938534
• Proof rules for recursive procedures
• scientific article; zbMATH DE number 4009792

Cites work

• scientific article; zbMATH DE number 3940703 (Why is no real title available?)
• A polynomial determination of the most-recent property in Pascal-like programs
• On correct procedure parameter transmission in higher programming languages
• On the complexity of some problems concerning the use of procedures. I
• Recursion analysis for compiler optimization

Cited in

(3)

• Pseudo-recursive procedures
• scientific article; zbMATH DE number 3938534 (Why is no real title available?)
• A polynomial determination of the most-recent property in Pascal-like programs

This page was built for publication: Polynomial recursion analysis in Pascal like programs

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