The formal termination problem for programs with finite ALGOL 68-modes

DOI10.1016/0020-0190(79)90058-9MaRDI QIDQ1133312zbMATH OpenOpenAlexFDO

Authors Hans Langmaack, Franz Wagner, Wolfram-M. Lippe

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(79)90058-9

zbMATH Keywords

interpreterfinite ALGOL 68-modesformal termination problemmonadic programrun time systemstack systemstandard procedure

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3558912 (Why is no real title available?)
• scientific article; zbMATH DE number 3607508 (Why is no real title available?)
• scientific article; zbMATH DE number 3630191 (Why is no real title available?)
• scientific article; zbMATH DE number 3453100 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• On correct procedure parameter transmission in higher programming languages
• On procedures as open subroutines. II
• Pascal. User manual and report. 2nd ed
• Revised report on the algorithmic language ALGOL 68
• Stack automata and compiling

Cited in

(4)

• Correctness of programs with Pascal-like procedures without global variables
• On termination problems for finitely interpreted ALGOL-like programs
• On the complexity of some problems concerning the use of procedures. II
• Wythoff games, continued fractions, cedar trees and Fibonacci searches

Describes a project that uses

Uses Software

• ALGOL 60
• ALGOL 68

This page was built for publication: The formal termination problem for programs with finite ALGOL 68-modes

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