On termination problems for finitely interpreted ALGOL-like programs

DOI10.1007/BF00625282zbMath0478.68013MaRDI QIDQ1161274

Hans Langmaack

Publication date: 1982

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

zbMATH Keywords

Hoare logicHoare deduction systemsyntactical structure of programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (4)

Reasoning about procedures as parameters in the language L4 ⋮ Fifty years of Hoare's logic ⋮ Wythoff games, continued fractions, cedar trees and Fibonacci searches ⋮ Correctness of programs with Pascal-like procedures without global variables

Uses Software

• ALGOL 68
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive programming
• Revised report on the algorithmic language ALGOL 60
• The formal termination problem for programs with finite ALGOL 68-modes
• Sound and complete Hoare-like calculi based on copy rules
• On procedures as open subroutines. II
• Revised report on the algorithmic language ALGOL 68
• First-order dynamic logic
• On correct procedure parameter transmission in higher programming languages
• Effective Axiomatizations of Hoare Logics
• Ten Years of Hoare's Logic: A Survey—Part I
• Guarded commands, nondeterminacy and formal derivation of programs
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• Regular canonical systems
• Stack automata and compiling

This page was built for publication: On termination problems for finitely interpreted ALGOL-like programs