Cart (Loading....) | Create Account
Close category search window
 

Reasoning in CSP via the HOL theorem prover

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Camilleri, A.J. ; Hewlett-Packard Lab., Bristol, UK

A proof tool developed for CSP by customizing an existing general-purpose theorem prover based on higher order logic is described, and it is demonstrated how it can be used to conduct formal reasoning about CSP. The focus is on illustrating the usefulness of the approach. It is shown how reasoning about CSP can be done using a natural deduction theorem prover by illustrating how some standard CSP laws can be mechanically proved from semantic definitions mechanized previously by the author (1990)

Published in:

Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)

Date of Conference:

22-25 Oct 1990

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.