Results 1  10
of
200
PsiCalculi in Isabelle
 In Proc of the 22nd Conference on Theorem Proving in Higher Order Logics (TPHOLs), volume 5674 of LNCS
"... Abstract. Psicalculi are extensions of the picalculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied picalculus and the concurrent constraint picalculus. We have for ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
formalised psicalculi in the interactive theorem prover Isabelle using its nominal datatype package. One distinctive feature is that the framework needs to treat binding sequences, as opposed to single binders, in an efficient way. While different methods for formalising single binder calculi have been
Higherorder psicalculi
, 2011
"... Psicalculi is a parametric framework for extensions of the picalculus; in earlier work we have explored their expressiveness and algebraic theory. In this paper we consider higherorder psicalculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
calculus can be lifted to its higherorder counterpart in a canonical way. We illustrate this with examples and establish an algebraic theory of higherorder psicalculi. The formal results are obtained by extending our proof repositories in Isabelle/Nominal. 1
Weak Equivalences in Psicalculi
"... Psicalculi extend the picalculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expressive formalisms such as concurrent higherorder constraints and advanced cryptographic primitives. We here establish th ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Psicalculi extend the picalculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expressive formalisms such as concurrent higherorder constraints and advanced cryptographic primitives. We here establish
Psicalculi: Mobile processes, nominal data, and logic
 In Proceedings of LICS 2009
"... A psicalculus is an extension of the picalculus 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 picalculus mechanism to allow for scope migr ..."
Abstract

Cited by 27 (11 self)
 Add to MetaCart
requirements on the nominal data and logic in order to prove general algebraic properties of psicalculi. The proofs have been checked in the interactive proof checker Isabelle. We are the first to formulate a truly compositional labelled operational semantics for calculi of this calibre. Expressiveness
Sorted Psicalculi with Generalised Pattern Matching
"... Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we extend the applicability of psicalculi in three ways. Firstly, we introduce patterns and pattern matching, in order to allow modellin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we extend the applicability of psicalculi in three ways. Firstly, we introduce patterns and pattern matching, in order to allow
Broadcast Psicalculi with an Application to Wireless Protocols
"... Abstract. Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication in order to model wireless protocols. The additions preserve the purity of the ps ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication in order to model wireless protocols. The additions preserve the purity
A Fully Abstract Symbolic Semantics for PsiCalculi
"... We present a symbolic transition system and bisimulation equivalence for psicalculi, and show that it is fully abstract with respect to bisimulation congruence in the nonsymbolic semantics. A psicalculus is an extension of the picalculus with nominal data types for data structures and for logica ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
We present a symbolic transition system and bisimulation equivalence for psicalculi, and show that it is fully abstract with respect to bisimulation congruence in the nonsymbolic semantics. A psicalculus is an extension of the picalculus with nominal data types for data structures
Bells and Whistles: Advanced Language Features in PsiCalculi
, 2013
"... Psicalculi is a parametric framework for process calculi similar to popular picalculus extensions such as the explicit fusion calculus, the applied picalculus and the spi calculus. Remarkably, machinechecked proofs of standard algebraic and congruence properties of bisimilarity apply to every i ..."
Abstract
 Add to MetaCart
Psicalculi is a parametric framework for process calculi similar to popular picalculus extensions such as the explicit fusion calculus, the applied picalculus and the spi calculus. Remarkably, machinechecked proofs of standard algebraic and congruence properties of bisimilarity apply to every
Computing strong and weak bisimulations for psicalculi
, 2011
"... We present a symbolic transition system and strong and weak bisimulation with respect to bisimulation congruences in the nonsymbolic semantics. A procedure which computes the most general constraint under which two agents are bisimilar is developed and proved correct. A psicalculus is an extension ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
calculus is an extension of the picalculus 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 picalculus mechanism to allow for scope migrations. Psicalculi can
A Fully Abstract Symbolic Semantics for PsiCalculi
"... We present a symbolic transition system and bisimulation equivalence for psicalculi, and show that it is fully abstract with respect to bisimulation congruence in the nonsymbolic semantics. A psicalculus is an extension of the picalculus with nominal data types for data structures and for logica ..."
Abstract
 Add to MetaCart
We present a symbolic transition system and bisimulation equivalence for psicalculi, and show that it is fully abstract with respect to bisimulation congruence in the nonsymbolic semantics. A psicalculus is an extension of the picalculus with nominal data types for data structures
Results 1  10
of
200