Semantics of Termination

Authors

  • Patricia Peratto

DOI:

https://doi.org/10.19153/cleiej.10.1.1

Abstract

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.

Downloads

Published

2007-06-01

Issue

Vol. 10 No. 1 (2007): Regular Issue and Special Issue of Best Papers presented at CIESC 2005, Cali, Colombia

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).