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.
 
 
Highlights
There are many books that treat the natural semantics and the structural operational semantics of C-like languages [1, 2, 3].They usually define when a statement S on a state s terminates or loops, but does not give a way for proving the termination or non-termination of a program.We define a formal system that allows to make these proofs
Work on termination of programs has been developed for logic programming, functional programming and concurrent programmming but not for imperative programming
Examples of the work developed are [4, 5, 10] for logic programming, [9, 6, 7] for functional programming and [8] for concurrent programming
Summary
There are many books that treat the natural semantics and the structural operational semantics of C-like languages [1, 2, 3]. They usually define when a statement S on a state s terminates or loops, but does not give a way for proving the termination or non-termination of a program. Work on termination of programs has been developed for logic programming, functional programming and concurrent programmming but not for imperative programming. Examples of the work developed are [4, 5, 10] for logic programming, [9, 6, 7] for functional programming and [8] for concurrent programming.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
