Abstract
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). >
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.
