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

DOI10.1016/0304-3975(86)90003-4zbMATH Open0632.68018OpenAlexW2044614616MaRDI QIDQ1095643FDOQ1095643

Authors: 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

Recommendations

• Polynomial recursion analysis in Pascal like programs
• Pseudo-recursive procedures
• scientific article; zbMATH DE number 3938534
• Proof rules for recursive procedures
• scientific article; zbMATH DE number 3874581

zbMATH Keywords

polynomial algorithmreachability problempolynomial time complexitycompilercomputer architecturesISO-PascalP-space completeprogram lengthRISCWirth-Pascal-like programs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On correct procedure parameter transmission in higher programming languages
• Title not available (Why is that?)
• On the complexity of some problems concerning the use of procedures. I
• Recursion analysis for compiler optimization
• On the complexity of some problems concerning the use of procedures. II
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Polynomial recursion analysis in pascal like programs

This page was built for publication: A polynomial determination of the most-recent property in Pascal-like programs

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