Polynomial recursion analysis in Pascal like programs

DOI10.1007/3-540-54415-1_58zbMATH Open1493.68054OpenAlexW1521831839MaRDI QIDQ5096232FDOQ5096232

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

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

Mathematics Subject Classification ID

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

Cites Work

• 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
• A polynomial determination of the most-recent property in Pascal-like programs
• Title not available (Why is that?)

Cited In (3)

• A polynomial determination of the most-recent property in Pascal-like programs
• Title not available (Why is that?)
• Pseudo-recursive procedures

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)