Filters








108 Hits in 4.3 sec

Automating Open Bisimulation Checking for the Spi Calculus

Alwen Tiu, Jeremy Dawson
2010 2010 23rd IEEE Computer Security Foundations Symposium  
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives.  ...  We then give a sound and complete procedure for deciding open bisimilarity for finite spi-processes.  ...  Acknowledgment: The authors thank the anonymous referees of an earlier draft of this paper for their comments. This work is supported by the ARC Discovery Project DP0880549.  ... 
doi:10.1109/csf.2010.28 dblp:conf/csfw/TiuD10 fatcat:cmnl3d7eyfahtpssh2oh77ax6y

SPEC: An Equivalence Checker for Security Protocols [chapter]

Alwen Tiu, Nam Nguyen, Ross Horne
2016 Lecture Notes in Computer Science  
SPEC is an automated equivalence checker for security protocols specified in the spi-calculus, an extension of the pi-calculus with cryptographic primitives.  ...  This paper gives an overview of SPEC and discusses techniques to reduce the size of bisimulations, utilising up-to techniques developed for the spi-calculus.  ...  Acknowledgements The authors receive support from MOE Tier 2 grant MOE2014-T2-2-076. The first author receives support from NTU Start Up grant M4081190.020.  ... 
doi:10.1007/978-3-319-47958-3_5 fatcat:i4wkonbjavcivm2sclt5qk3ana

Formalising Observer Theory for Environment-Sensitive Bisimulation [chapter]

Jeremy E. Dawson, Alwen Tiu
2009 Lecture Notes in Computer Science  
This encoding has recently been used in a theory of open bisimulation for the spi-calculus.  ...  We machine-checked some important properties, including decidability of observer deduction and consistency, and some key steps which are crucial to the automation of open bisimulation checking for the  ...  We thank the anonymous referees for their comments on an earlier draft.  ... 
doi:10.1007/978-3-642-03359-9_14 fatcat:ubvpdzp4rjcyzmxmbxstzwp5vi

A Fully Abstract Symbolic Semantics for Psi-Calculi

Magnus Johansson, Björn Victor, Joachim Parrow
2010 Electronic Proceedings in Theoretical Computer Science  
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  ...  The situation for the spi-calculus is better: fully abstract symbolic bisimulation for hedged bisimulation has been defined in [10] , and for open hedged bisimulation (a finer equivalence) in [13] .  ... 
doi:10.4204/eptcs.18.2 fatcat:tuh3jt5mdffghcgoeeetuogiyu

Computing strong and weak bisimulations for psi-calculi

Magnus Johansson, Björn Victor, Joachim Parrow
2012 The Journal of Logic and Algebraic Programming  
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 symbolic semantics makes exactly  ...  The situation for the spi-calculus is better: fully abstract symbolic bisimulation for hedged bisimulation has been defined in [11] , and for open hedged bisimulation in [14] .  ... 
doi:10.1016/j.jlap.2012.01.001 fatcat:nmgtbjgzcfeingexeycwg6nfdm

Spi calculus translated to /spl pi/-calculus preserving may-tests

M. Baldamus, J. Parrow, B. Victor
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
As a consequence, protocols can be described in the spi calculus and analysed with the emerging flora of tools already available for .  ...  The formal correctness proof is nontrivial and interesting in its own; so called context bisimulations and new techniques for compositionality make the proof simpler and more concise.  ...  We would also like to thank the anonymous referees for their remarks and suggestions.  ... 
doi:10.1109/lics.2004.1319597 dblp:conf/lics/BaldamusPV04 fatcat:3sdocx6g7rbzdodtao2gxvuwxe

A bisimulation for dynamic sealing

Eijiro Sumii, Benjamin C. Pierce
2004 Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '04  
We define λ seal , an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual  ...  This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.  ...  Acknowledgements We would like to thank Martín Abadi, Andre Scedrov, Naoki Kobayashi, and the members of Programming Language Club at the University of Pennsylvania for suggestions and support throughout  ... 
doi:10.1145/964001.964015 dblp:conf/popl/SumiiP04 fatcat:7lrf7drgfvgypbms66rhkrau6u

A bisimulation for dynamic sealing

Eijiro Sumii, Benjamin C. Pierce
2004 SIGPLAN notices  
We define λ seal , an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual  ...  This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.  ...  Acknowledgements We would like to thank Martín Abadi, Andre Scedrov, Naoki Kobayashi, and the members of Programming Language Club at the University of Pennsylvania for suggestions and support throughout  ... 
doi:10.1145/982962.964015 fatcat:3a5ygamor5bwtnwfvx7gtijr2u

A bisimulation for dynamic sealing

Eijiro Sumii, Benjamin C. Pierce
2007 Theoretical Computer Science  
We define λ seal , an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual  ...  This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.  ...  Acknowledgements We would like to thank Martín Abadi, Andre Scedrov, Naoki Kobayashi, and the members of Programming Language Club at the University of Pennsylvania for suggestions and support throughout  ... 
doi:10.1016/j.tcs.2006.12.032 fatcat:uhmz3kpxy5b6pi5fg7pmpwyixe

Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation

Joana Martinho, António Ravara
2010 Journal of automated reasoning  
Moreover, we relate early bisimilarity with the other usual notions, ground, late and open, obtaining a lattice of equivalence relations that clarifies the relationship among the "standard" bisimilarities  ...  We thoroughly study the behavioural theory of epi, a π-calculus extended with polyadic synchronisation.  ...  Special thanks to Luca for all the support and guidance on this research.  ... 
doi:10.1007/s10817-010-9189-7 fatcat:zs6m4k7i65b45codab4zubv4nq

A pure labeled transition semantics for the applied pi calculus

Xiaojuan Cai
2010 Information Sciences  
In this paper, we establish a new semantics for applied pi calculus based upon pure labeled transition system and propose a new formulation of labeled bisimulation.  ...  The applied pi calculus proposed by Abadi and Fournet is successful in the analysis of security protocols. Its semantics mainly depends on several structural rules.  ...  Acknowledgements The author thanks Prof. Yuxi Fu and Dr. Yuxin Deng for their helpful advice on this paper.  ... 
doi:10.1016/j.ins.2010.07.008 fatcat:loda6abh4retzldu7w4pn6iyoy

Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi [chapter]

Uwe Nestmann
2006 Lecture Notes in Computer Science  
The original Pi Calculus arose out of a reformulation and extension of CCS. In turn, it boosted the invention and study of a whole zoo of further process calculi.  ...  Almost 30 years ago, the research on process calculi gained a lot of momentum with the invention of ACP, CCS and CSP.  ...  The members of the moca mailing list, in particular Martin Berger, for some discussion in July/August 2003.  ... 
doi:10.1007/11817949_4 fatcat:lrvgax7zcndafe64u2norsz2qu

A Complete Symbolic Bisimilarity for an Extended Spi Calculus

Johannes Borgström
2009 Electronical Notes in Theoretical Computer Science  
Several symbolic notions of bisimilarity have been defined for the spi calculus and the applied pi calculus.  ...  In this paper, we treat a spi calculus with a general constructor-destructor message algebra, and define a symbolic bisimilarity that is both sound and complete with respect to its concrete counterpart  ...  In [11] , we proposed a symbolic structural operational semantics and a symbolic bisimulation for the spi calculus.  ... 
doi:10.1016/j.entcs.2009.07.078 fatcat:ovgswhcatjev3elxkzezlhlbcy

Modal Logics for Nominal Transition Systems [article]

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramūnas Forsberg Gutkovas, Tjark Weber
2021 arXiv   pre-print
A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence.  ...  We show how to treat different bisimulation variants such as early, late, open and weak in a systematic way, explore the folklore theorem that state predicates can be replaced by actions, and make substantial  ...  We are very grateful to the anonymous referees for many constructive comments.  ... 
arXiv:1904.02564v3 fatcat:ttnxwh57grajbn7yyx2d6frxjy

Modal Logics for Nominal Transition Systems

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramūnas Forsberg Gutkovas, Tjark Weber
2019 Logical Methods in Computer Science  
A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence.  ...  We show how to treat different bisimulation variants such as early, late, open and weak in a systematic way, explore the folklore theorem that state predicates can be replaced by actions, and make substantial  ...  We are very grateful to the anonymous referees for many constructive comments.  ... 
doi:10.23638/lmcs-17(1:6)2021 fatcat:g6xm65ck2jh7xcv4fjbzuqmfny
« Previous Showing results 1 — 15 out of 108 results