575 search results - page 36 / 115 » A Calculus for Interaction Nets |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
COORDINATION
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Service oriented applications feature interactions among several participants over the network. Mechanisms such as correlation sets and two-party sessions have been propo...
EMISA
2002
Springer
13 years 8 months ago
2002
Springer
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...
ESOP
1999
Springer
14 years 1 months ago
1999
Springer
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocol...
CSFW
2010
IEEE
13 years 12 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...