Symbolic Bisimulation for the Applied Pi Calculus

Delaune, Stéphanie; Kremer, Steve; Ryan, Mark

doi:10.1007/978-3-540-77050-3_11

Cited by 28 publications

(29 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…17) is {{|1 x = b| }, {|1 x = b| }}, and a matching transition for Q 1 can be found for each of these cases, so the agents are bisimilar. In contrast, they are not equivalent in the incomplete symbolic bisimulations in [11] and [15].…”

Section: Examplesmentioning

confidence: 90%

See 1 more Smart Citation

A Fully Abstract Symbolic Semantics for Psi-Calculi

Johansson

Victor

Parrow

2010

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics.A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Psi-calculi can be more general than other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, or the concurrent constraint pi-calculus.Symbolic semantics are necessary for an efficient implementation of the calculus in automated tools exploring state spaces, and the full abstraction property means the semantics of a process does not change from the original.

show abstract

Section: Examplesmentioning

confidence: 90%

“…In relation to the former, we are helped significantly by the absence of structural equivalence rules, which in applied pi-calculus are rather complex. In [15] an intermediate semantics is used to overcome the complexity. In contrast we can directly relate the original and symbolic semantics.…”

Section: Comparison To Related Workmentioning

confidence: 99%

A Fully Abstract Symbolic Semantics for Psi-Calculi

Johansson

Victor

Parrow

2010

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…One line of research is providing Symbolic Bisimulation for different model or language. In Calder's work [5], they define a symbolic semantic for full LOTOS, with a symbolic bisimulation over it; Borgstrom et al, Delaune et al and Buscemi et al provide symbolic semantic and equivalence for different variants of pi calculus respectively [3,4,7], and later in 2012 Liu's work provided symbolic bisimulation for full applied pi calculus [16]. The most recent work, Feng et al provide a symbolic bisimulation for quantum processes [10].…”

Section: Related Workmentioning

confidence: 99%

Symbolic bisimulation for open and parameterized systems

Hou

Madelaine

2020

Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Open Automata (OA) are symbolic and parameterized models for open concurrent systems. Here open means partially specified systems, that can be instantiated or assembled to build bigger systems. An important property for such systems is "compositionality", meaning that logical properties, and equivalences, can be checked locally, and will be preserved by composition. In previous work, a notion of equivalence named FH-Bisimulation was defined for open automata, and proved to be a congruence for their composition. But this equivalence was defined for a variant of open automata that are intrinsically infinite, making it unsuitable for algorithmic treatment. We define a new form of equivalence named StrFH-Bisimulation, working on finite encodings of OAs. We prove that StrFH-Bisimulation is consistent and complete with respect to the FH-Bisimulation. Then we propose two algorithms to check StrFH-Bisimulation: the first one requires a (user-defined) relation between the states of two finite OAs, and checks whether it is a StrFH-Bisimulation. The second one takes two finite OAs as input, and builds a "weakest StrFH-bisimulation" such that their initial states are bisimilar. We prove that this algorithm terminates when the data domains are finite. Both algorithms use an SMT-solver as a basis to solve the proof obligations. CCS Concepts • Theory of computation → Logic and verification; Process calculi; • Computing methodologies → Theorem proving algorithms; Model verification and validation; • Hardware → Equivalence checking.

show abstract

“…The universal composability paradigm has been quite successful in the computational approach [31]. The idea of UC is not, however, restricted to the computational setting, and has now a counterpart in symbolic models as well [32,33].…”

Section: A Variety Of Security Propertiesmentioning

confidence: 99%

A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols

Delaune¹,

Hirschi²

2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Cryptographic protocols aim at securing communications over insecure networks such as the Internet, where dishonest users may listen to communications and interfere with them. A secure communication has a different meaning depending on the underlying application. It ranges from the confidentiality of a data to e.g. verifiability in electronic voting systems. Another example of a security notion is privacy.Formal symbolic models have proved their usefulness for analysing the security of protocols. Until quite recently, most results focused on trace properties like confidentiality or authentication. There are however several security properties, which cannot be defined (or cannot be naturally defined) as trace properties and require a notion of behavioural equivalence. Typical examples are anonymity, and privacy related properties. During the last decade, several results and verification tools have been developed to analyse equivalence-based security properties.We propose here a synthesis of decidability and undecidability results for equivalence-based security properties. Moreover, we give an overview of existing verification tools that may be used to verify equivalence-based security properties.

show abstract

Symbolic Bisimulation for the Applied Pi Calculus

Cited by 28 publications

References 16 publications

A Fully Abstract Symbolic Semantics for Psi-Calculi

A Fully Abstract Symbolic Semantics for Psi-Calculi

Symbolic bisimulation for open and parameterized systems

A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols

Contact Info

Product

Resources

About