Semantics of Termination

This work presents proof rules for termination and non-termination for a subset of a C-like language that consists of the statements : assignation, composition, if, skip and while and rules for termination of function calls.

• Type: Journal
• Year: 2007
• Where: CLEIEJ
• Authors: Patricia Peratto
• Keywords: C-like Language, CLEIEJ 2007, Presents, Proof Rules