On correct procedure parameter transmission in higher programming languages

zbMATH Open0263.68012MaRDI QIDQ2561483FDOQ2561483

Hans Langmaack

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited In (13)

• Complexity of proving program correctness
• Polynomial recursion analysis in pascal like programs
• A polynomial determination of the most-recent property in Pascal-like programs
• Correctness of programs with Pascal-like procedures without global variables
• On termination problems for finitely interpreted ALGOL-like programs
• Tree-stack automata
• Zur Elimination von Prozedurschachtelungen
• On procedures as open subroutines. II
• The formal termination problem for programs with finite ALGOL 68-modes
• Pseudo-recursive procedures
• On the complexity of some problems concerning the use of procedures. II
• Low cost environment changing in a shallow binding system
• Wythoff games, continued fractions, cedar trees and Fibonacci searches

This page was built for publication: On correct procedure parameter transmission in higher programming languages

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