Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • chapterNo Access

    A SYMBOLIC CALCULUS ON DEFECT REVISIONS OF AXIOMATIC SYSTEMS

    A symbolic calculus named as the R-calculus is built to revise the defects of axiomatic systems mechanically when some counterexamples are found. The R-calculus consists of the rules of logical connective symbols and logical quantifier symbols of first order languages. The concept of reachability, soundness and completeness of the R-calculus are introduced. The basic theorem of software testing based on the R-calculus is also introduced to help mechanizing model checking.