M. Pistore and D. Sangiorgi. A partition refinement algorithm for the -calculus. Information and Computation, 164(2):264--321, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraints as Processes - Victor, Parrow (1996) (10 citations) (Correct)
.... by its use in, e.g. the semantics of the programming language PICT [PRT93] and of object oriented programming [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 ....
M. Pistore and D. Sangiorgi. A partition refinement algorithm for the - calculus. 1996. To appear in the proceedings of CAV'96, Lecture Notes in Computer Science.
The Update Calculus - Parrow, Victor (1997) (4 citations) (Correct)
....agent to another. The action is local to the interacting parties, and these must explicitly communicate with the rest of the system to spread the effect. Localists typically work with functional languages and formalisms such as the calculus or the calculus [Bar84] MPW92, Mil91, San92, PS95] [San96, San95a, PS96, Dam93]. Since these do not use a separate global state, proof methods are often conceptually simpler than for global formalisms, at the expense of some loss of expressiveness: in some ways the global paradigm is closer to many high level programming languages. It is well known that e.g. message passing ....
M. Pistore and D. Sangiorgi. A partition refinement algorithm for the - calculus. In R. Alur and T. A. Henzinger, editors, Proceedings of CAV'96, volume 1102 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
The Update Calculus (Extended Abstract) - Parrow, Victor (1997) (Correct)
....agent to another. The action is local to the interacting parties, and these must explicitly communicate with the rest of the system to spread the effect. Localists typically work with functional languages and formalisms such as the calculus or the calculus [Bar84] MPW92, Mil91, San92, PS95] [San96, San95a, PS96, Dam93]. Since these do not use a separate global state, proof methods are often conceptually simpler than for global formalisms, at the expense of some loss of expressiveness: in some ways the global paradigm is closer to many high level programming languages. It is well known that e.g. message passing ....
M. Pistore and D. Sangiorgi. A partition refinement algorithm for the - calculus. In R. Alur and T. A. Henzinger, editors, Proceedings of CAV'96, volume 1102 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) Self-citation (Pistore) (Correct)
No context found.
M. Pistore and D. Sangiorgi. A partition refinement algorithm for the -calculus. Information and Computation, 164(2):264--321, 2001.
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