G. Ferrari, G. Modoni and P. Quaglia. Towards a semantic-based verification environment for the pi-calculus. In Proceedings of 5th Italian Conference on Theoretical Computer Science: ICTCS-95. World Scientific, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constraints as Processes - Victor, Parrow (1996) (10 citations) (Correct)
.... [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for x along b and continues as the subagent P , and bhai : Q is an output which transmits a along b and continues as the subagent Q. ....
G. Ferrari, G. Modoni and P. Quaglia. Towards a semantic-based verification environment for the pi-calculus. In Proceedings of 5th Italian Conference on Theoretical Computer Science: ICTCS-95. World Scientific, 1995.
Constraints as Processes - Victor, Parrow (1996) (10 citations) (Correct)
.... [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for x along b and continues as the subagent P , and bhai : Q is an output which transmits a along b and continues as the subagent Q. When ....
G. Ferrari, G. Modoni and P. Quaglia. Towards a semantic-based verification environment for the pi-calculus. In Proceedings of 5th Italian Conference on Theoretical Computer Science: ICTCS-95. World Scientific, 1995.
The Weak Late pi-calculus Semantics as Observation.. - Ferrari, Montanari, Quaglia (1995) Self-citation (Ferrari Quaglia) (Correct)
....are considered, our approach allows calculus processes to be modelled by finitely branching labelled trees. This peculiarity, together with the use of a behavioural equivalence which abstracts away from moves, can be of practical interest in the implementation of automated verification tools [FMQ95a]. 1 The calculus A calculus process is written : P , where is an environment keeping track of the associations among names, and P is a process built up by the calculus syntax plus a new kind of prefix. As the main features of the calculus can be expressed without recursion or ....
G.-L. Ferrari, G. Modoni, and P. Quaglia. Towards a Semantic-Based Verification Environment for the -calculus. Submitted for publication, 1995.
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