Bruno Courcelle
Abstract
this paper provides some general definitions concerning the validity of programs, an abstract presentation of the inductive assertion method for iterative and recursive programs. The case of recursive programs is handled by means of call-trees .
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
this paper provides some general definitions concerning the validity of programs, an abstract presentation of the inductive assertion method for iterative and recursive programs. The case of recursive programs is handled by means of call-trees .
Key concepts: Correctness, Assertion, Mathematical proof, Computer science, Recursive functions, Computation, Presentation (obstetrics), Theoretical computer science