Semantics of Termination

13 years 4 months ago

Download www.clei.cl

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.

Patricia Peratto

Real-time Traffic

C-like Language | CLEIEJ 2007 | Presents | Proof Rules |

claim paper

» Innermost Termination of Rewrite Systems by Labeling

» Termination Graphs for Java Bytecode

» Metric Spaces and Termination Analyses

» Semantics and Termination of SimplyModed Logic Programs with Dynamic Scheduling

» Semantic Labelling for Proving Termination of Combinatory Reduction Systems

» TraceBased Coinductive Operational Semantics for While

» Terminating alternator

» TypeBased Termination with Sized Products

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	CLEIEJ
Authors	Patricia Peratto

Comments (0)

Sciweavers

Semantics of Termination

C-like Language | CLEIEJ 2007 | Presents | Proof Rules |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers