The clean termination of Pascal programs

DOI10.1007/BF00289066zbMATH Open0396.68008OpenAlexW2025151086MaRDI QIDQ1253540FDOQ1253540

Authors: K. Appert 

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1007/bf00289066

zbMATH Keywords

Program VerificationAxiomatic DefinitionClean Termination

Mathematics Subject Classification ID

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

Cites Work

• An axiomatic basis for computer programming
• Title not available (Why is that?)
• An axiomatic definition of the programming language Pascal
• Title not available (Why is that?)
• Consistent and complementary formal theories of the semantics of programming languages

This page was built for publication: The clean termination of Pascal programs

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