9 search results - page 1 / 2 » Automating Open Bisimulation Checking for the Spi Calculus |
CSFW
2010
IEEE
15 years 1 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...
102
click to vote
APLAS
2007
ACM
15 years 2 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
91
Voted
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
103
click to vote
QEST
2007
IEEE
15 years 4 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...