H. Lin. A Verification Tool for Value-Passing Processes. In Proceedings of 13 th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993. Also available from Sussex as Computing Science Technical Report 8/93.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....9.1.2 Semiautomatic Equational Based Verification Tools PAM and VPAM PAM [Lin 95] is, perhaps, the best known theorem proving framework for reasoning about process algebras. PAM was never intended to provide any level of automation, though the user may create and execute their own tactics. VPAM [Lin 93] is as PAM except that it deals with value passing languages. Neither PAM nor VPAM supports definitions using recursion on the process structure. STRAT and R OBS Planning equational verifications of CCS programs, fully automatically, has been one of the main goals of this thesis. There are few ....

H. Lin. A Verification Tool for Value-Passing Processes. In Proceedings of 13 th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993. Also available from Sussex as Computing Science Technical Report 8/93.

....An overview of work from the project appears in [5] 2 . Background to the work presented here is found in Milner s work on CCS and bisimilarity[1] More recently, Hennessy[6] has developed techniques for modelling infinite data spaces and constructing their bisimulations; the VPAM system[7] is somewhat similar to our approach of proving conditions which are generated when constructing a state bisimulation. Other work related to these include CIRCAL[8] There has been extensive research into state based verification methods such as model checking[9, 10] Although these have been ....

H. Lin. A Verification Tool for Value-Passing Processes. Technical Report 8/93, University of Sussex, April 1993.

....their use for verification in CBS is investigated in [15] This seems to be a promising approach to the development of practical verification systems for value passing processing languages in general. A prototype implementation of a verification system based on these proof systems may be found in [12] and a different approach to the verification of value passing processes may be found in [3] ....

H. Lin. A verification tool for value-passing processes. In Proceedings of 13 th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993.

....in Basic LOTOS, by operating a reduction on the size of value sets involved, in order to reduce the state space. Recent advances in verification techniques, like the development of equivalence checking tools based on Binary Decision Diagrams [3] or based on a notion of symbolic bisimulation [11], could help significantly to avoid the cited drawbacks. ....

Lin, H.: A verification tool for value passing processes. Proc. Protocol Specification, Testing and Verification, XIII, North-Holland (1993) B1.1--B1.13

....which axioms are applied, and eliminating transcription errors, it can provide only partial automation of the proof because user guidance is required to determine which rule to apply next. A lesser drawback is that PAM is limited to Basic LOTOS; however, we hope that a new version of PAM, VPAM [18], will allow us to reason about Full LOTOS specifications. If we pursue this direction, a problem to be overcome is that VPAM assumes the CCS model of communication (two way synchronisation) whereas LOTOS has multi way synchronisation. Note that PAM does not suffer from this problem: the ....

H. Lin. A Verification Tool for Value-Passing Processes. In Protocol Specification, Testing and Verification XIII, 1993. Also available as a University of Sussex Computer Science Technical report, number 93:08.

....two varieties of early and late, and guarded recursive definitions. We believe that these results can be extended to the weak versions of early and late bisimulation congruences by adding the appropriate laws [Mil89] again as in [HL96] We have developed an interactive verification tool VPAM ( Lin93] based on our theoretical results, where the implementation of the unique fixpoint induction rule demands special care [Lin95b] All the examples in this paper have been checked in VPAM. Extending the results to unguarded definitions is more complicated. For example with pure processes, if we ....

H. Lin. A verification tool for value-passing processes. In Proceedings of 13 th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993.

....like to extend the current framework to deal with weak bisimulation equivalences. Another interesting subject is the development of a proof tool for the calculus, based on syntactical manipulation, similar to VPAM (Value passing Process Algebra Manipulator) for general message passing calculi [Lin93]. Related Work. As mentioned in the introduction the current work inherits the main ideas from our previous papers on general message passing process calculi [HL92, HL93] As the process calculi considered there take the languages for data and boolean expressions as parameters, the completeness ....

H. Lin. A verification tool for value-passing processes. In Proceedings of 13 th International Symposium on Protocol Specificatio, Testing and Verification, IFIP Transactions. North-Holland, 1993.

No context found.

H. Lin. A verification tool for value-passing processes. In , May 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC