and L. Fix 1 O. Grumberg 2 and 1Upson Hall, Computer Science Dept., Cornell University, Ithaca, NY 14850, USA. Email: email@example.com 2Computer Science Dept., Technion, Haifa32000, Israel. Email: firstname.lastname@example.org
The paper presents a relatively complete deductive system for proving branching time temporal properties of reactive programs. No deductive system for verifying branching time temporal porperties has been presented before. Our deductive system enjoys the following advantages. First, given a well-formed specification there is no need to translate it into a normal-form specification since the system can handle any well-formed specification. Second, given a specification to be verified, the proof rule to be applied is easily determined according to the top level operator of the specification. Third, the system reduces temporal verification to assertional reasoning rather than to temporal reasoning.
: program verification, temporal logic, branching-time,
CTL, deductive system.
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 23 Jul 96
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1996