scientific article; zbMATH DE number 4005583

MaRDI QIDQ3756502zbMATH OpenFDO

Authors Bruno Courcelle

Publication date 1987

zbMATH Keywords

call-treesinductive assertion methoditerative programsrecursive programsvalidity of programs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3888897
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• Proof rules for recursive procedures
• Proving total correctness of recursive procedures
• scientific article; zbMATH DE number 3892565

Cited in

(10)

• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• Unifying Recursion in Partial, Total and General Correctness
• Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
• scientific article; zbMATH DE number 3888897 (Why is no real title available?)
• Termination assertions for recursive programs: Completeness and axiomatic definability
• Modular Verification of Recursive Programs
• A generalized iterative construct and its semantics
• scientific article; zbMATH DE number 3892565 (Why is no real title available?)
• An Inductive Theorem on the Correctness of General Recursive Programs
• Program correctness and matricial iteration theories

This page was built for publication:

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