A polynomial determination of the most-recent property in Pascal-like programs

DOI10.1016/0304-3975(86)90003-4zbMath0632.68018OpenAlexW2044614616MaRDI QIDQ1095643

Dieter Armbruster

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90003-4

zbMATH Keywords

polynomial algorithmcomputer architecturesreachability problempolynomial time complexitycompilerISO-PascalP-space completeprogram lengthRISCWirth-Pascal-like programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Polynomial recursion analysis in pascal like programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of some problems concerning the use of procedures. I
• On the complexity of some problems concerning the use of procedures. II
• On correct procedure parameter transmission in higher programming languages
• Recursion analysis for compiler optimization