Polynomial recursion analysis in pascal like programs

DOI10.1007/3-540-54415-1_58zbMath1493.68054OpenAlexW1521831839MaRDI QIDQ5096232

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)

Cites Work

• Unnamed Item
• A polynomial determination of the most-recent property in Pascal-like programs
• On the complexity of some problems concerning the use of procedures. I
• On correct procedure parameter transmission in higher programming languages
• Recursion analysis for compiler optimization

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