Modular Verification of Recursive Programs

Details Modular Verification of Recursive Programs Modular Verification of Recursive Programs

2009-07-24

arxiv.org/abs/0907.4316v1

Computer Science

Logic in Computer Science

21 pages. appeared in: Languages: From Formal to Natural, Essays Dedicated to Nissim Francez on the Occasion of His 65th Birth

Scientific paper

We argue that verification of recursive programs by means of the assertional method of C.A.R. Hoare can be conceptually simplified using a modular reasoning. In this approach some properties of the program are established first and subsequently used to establish other program properties. We illustrate this approach by providing a modular correctness proof of the Quicksort program.

Affiliated with

Also associated with

No associations

Rating

Modular Verification of Recursive Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modular Verification of Recursive Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular Verification of Recursive Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310620