Abstract
Psi-calculi is a parametric framework for extensions of the pi-calculus with arbitrary data and logic. All instances of the framework inherit machine-checked proofs of the metatheory such as compositionality and bisimulation congruence. We present a generic analysis tool for psi-calculus instances, enabling symbolic execution and (bi)simulation checking for both unicast and broadcast communication. The tool also provides a library for implementing new psi-calculus instances. We provide examples from traditional communication protocols and wireless sensor networks. We also describe the theoretical foundations of the tool, including an improved symbolic operational semantics, with additional support for scoped broadcast communication.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi
- Martín Abadi and Cédric Fournet. 2001. Mobile values, new names, and secure communication. In Proc. of POPL’01. ACM Press, New York, NY, 104--115. DOI: http://dx.doi.org/10.1145/373243.360213 Google Scholar
Digital Library
- Martín Abadi and Andrew D. Gordon. 1997. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the 4th ACM Conference on Computer and Communications Security. ACM, 36--47. DOI: http://dx.doi.org/10.1145/266420.266432 Google Scholar
Digital Library
- Johannes Åman Pohjola, Johannes Borgström, Joachim Parrow, Palle Raabjerg, and Ioana Rodhe. 2013. Negative Premises in Applied Process Calculi. Technical Report 2013-014. Dept. of Information Technology, Uppsala University.Google Scholar
- K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. 1969. A note on reliable full-duplex transmission over half-duplex links. Commun. ACM 12, 5 (May 1969), 260--261. DOI: http://dx.doi.org/10.1145/362946. 362970 Google Scholar
Digital Library
- Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. 2011. Psi-calculi: A framework for mobile processes with nominal data and logic. Logical Methods Comput. Sci. 7, 1 (2011), Article 11, 44 pages. DOI: http://dx.doi.org/10.2168/LMCS-7(1:11)2011Google Scholar
- Jesper Bengtson and Joachim Parrow. 2009. Psi-calculi in Isabelle. In Proc. of TPHOLs’09 (LNCS). LCNS, Springer, 99--114. DOI: http://dx.doi.org/10.1007/978-3-642-03359-9_9 Google Scholar
Digital Library
- Bruno Blanchet. 2011. Using Horn clauses for analyzing security protocols. In Formal Models and Techniques for Analyzing Security Protocols, Véronique Cortier and Steve Kremer (Eds.). Vol. 5. IOS Press, 86--111. DOI: http://dx.doi.org/10.3233/978-1-60750-714-7-86Google Scholar
- Michele Boreale and Rocco De Nicola. 1996. A symbolic semantics for the π-calculus. Information and Computation 126, 1 (1996), 34--52. DOI: http://dx.doi.org/10.1006/inco.1996.0032 Google Scholar
Digital Library
- Johannes Borgström, Ramūnas Gutkovas, Ioana Rodhe, and Björn Victor. 2013. A parametric tool for applied process calculi. In Proc. of ACSD’13. IEEE, Los Alamitos, CA, 187--192. DOI: http://dx.doi.org/10.1109/ACSD.2013.22Google Scholar
Digital Library
- Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, and Joachim Parrow. 2011. Broadcast psi-calculi with an application to wireless protocols. In Proc. of SEFM’11. Springer, 74--89. DOI: http://dx.doi.org/10.1007/978-3-642-24690-6_7 Google Scholar
Digital Library
- Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, and Joachim Parrow. 2013. Broadcast psi-calculi with an application to wireless protocols. In Software and Systems Modeling (2013). Springer Berlin Heidelberg, 1--16. DOI: http://dx.doi.org/10.1007/s10270-013-0375-z.Google Scholar
- Maria Grazia Buscemi and Ugo Montanari. 2007. CC-Pi: A constraint-based language for specifying service level agreements. In Proc. of ESOP’07, Rocco De Nicola (Ed.). LNCS, Vol. 4421. Springer, 18--32. Google Scholar
Digital Library
- Marco Carbone and Sergio Maffeis. 2003. On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing 10, 2 (2003), 70--98. Google Scholar
Digital Library
- Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. 1993. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems 15, 1 (1993), 36--72. DOI: http://dx.doi.org/10.1145/151646.151648 Google Scholar
Digital Library
- Sjoerd Cranen, Jan Friso Groote, Jeroen J. A. Keiren, Frank P. M. Stappers, Erik P. Vink, Wieger Wesselink, and Tim A. C. Willemse. 2013. An overview of the mCRL2 toolset and its recent advances. In Proc. of TACAS’13 (LNCS), Vol. 7795. Springer, 199--213. DOI: http://dx.doi.org/10.1007/978-3-642-36742-7_15 Google Scholar
Digital Library
- Fatemeh Ghassemi, Willem Fokkink, and Ali Movaghar. 2008. Restricted broadcast process theory. In Proc. of SEFM’08. 345--354. DOI: http://dx.doi.org/10.1109/SEFM.2008.25 Google Scholar
Digital Library
- Jens Chr. Godskesen. 2010. Observables for mobile and wireless broadcasting systems. In Coordination Models and Languages, Dave Clarke and Gul Agha (Eds.). LNCS, Vol. 6116. Springer, 1--15. DOI: http://dx.doi.org/10.1007/978-3-642-13414-2_1 Google Scholar
Digital Library
- Ramūnas Gutkovas and Johannes Borgström. 2013. The Psi-Calculi Workbench. Retrieved from http://www.it.uu.se/research/group/mobility/applied/psiworkbench.Google Scholar
- Matthew Hennessy and Huimin Lin. 1995. Symbolic bisimulations. Theoret. Comput. Sci. 138, 2 (1995), 353--389. DOI: http://dx.doi.org/10.1016/0304-3975(94)00172-F Google Scholar
Digital Library
- Brian Huffman and Christian Urban. 2010. A new foundation for nominal Isabelle. In Proc. of ITP’10. Springer, 35--50. DOI: http://dx.doi.org/10.1007/978-3-642-14052-5_5 Google Scholar
Digital Library
- Magnus Johansson, Jesper Bengtson, Joachim Parrow, and Björn Victor. 2010. Weak equivalences in psi-calculi. In Proc. of LICS 2010. IEEE, 322--331. DOI: http://dx.doi.org/10.1109/LICS.2010.30 Google Scholar
Digital Library
- Magnus Johansson, Björn Victor, and Joachim Parrow. 2012. Computing strong and weak bisimulations for psi-calculi. J. Logic Algebraic Program 81, 3 (2012), 162--180. DOI: http://dx.doi.org/10.1016/j.jlap. 2012.01.001Google Scholar
Cross Ref
- Huimin Lin. 1996. Symbolic transition graph with assignment. In Proc. of CONCUR’96. LNCS, Vol. 1119. Springer, 50--65. DOI: http://dx.doi.org/10.1007/3-540-61604-7_47 Google Scholar
Digital Library
- Huimin Lin. 2000. Computing bisimulations for finite-control pi-calculus. J. Comput. Sci. Technol. 15, 1 (2000), 1--9. DOI: http://dx.doi.org/10.1007/BF02951922Google Scholar
Digital Library
- Yang Liu, Jun Sun, and Jin Song Dong. 2011. PAT 3: An extensible architecture for building multi-domain model checkers. In Proc. of ISSRE’11. IEEE, Los Alamitos, CA, 190--199. DOI: http://dx.doi.org/10.1109/ISSRE.2011.19 Google Scholar
Digital Library
- Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. 2002. TAG: A Tiny AGgregation service for ad-hoc sensor networks. SIGOPS Oper. Syst. Rev. 36, SI (Dec. 2002), 131--146. DOI: http://dx.doi.org/10.1145/844128.844142 Google Scholar
Digital Library
- Massimo Merro. 2007. An observational theory for mobile ad hoc networks. Electronical Notes in Theoretical Computer Science 173 (April 2007), 275--293. DOI: http://dx.doi.org/10.1016/j.entcs.2007.02.039 Google Scholar
Digital Library
- Robin Milner, Joachim Parrow, and David Walker. 1992a. A calculus of mobile processes, I. Inf. Comput. 100, 1 (1992), 1--40. DOI: http://dx.doi.org/10.1016/0890-5401(92)90008-4 Google Scholar
Digital Library
- Robin Milner, Joachim Parrow, and David Walker. 1992b. A calculus of mobile processes, II. Inf. Comput. 100, 1 (1992), 41--77. DOI: http://dx.doi.org/10.1016/0890-5401(92)90009-5 Google Scholar
Digital Library
- Joachim Parrow, Johannes Borgström, Palle Raabjerg, and Johannes Åman Pohjola. 2013. Higher-order psi-calculi. Math. Struct. Comput. Sci. FirstView (June 2013), 1--37. DOI: http://dx.doi.org/10.1017/S0960129513000170Google Scholar
- Andrew M. Pitts. 2003. Nominal logic, a first order theory of names and binding. Inf. Comput. 186, 2 (2003), 165--193. DOI: http://dx.doi.org/10.1016/S0890-5401(03)00138-X Google Scholar
Digital Library
- PolyML. 2013. Poly/ML. Retrieved from http://www.polyml.org.Google Scholar
- Jun Sun, Yang Liu, Jin Song Dong, and Chunqing Chen. 2009. Integrating specification and programs for system modeling and verification. In Proc. TASE’09. IEEE, 127--135. DOI: http://dx.doi.org/10.1109/TASE.2009.32 Google Scholar
Digital Library
- Christian Urban and Christine Tasson. 2005. Nominal techniques in Isabelle/HOL. In CADE, Robert Nieuwenhuis (Ed.). LNCS, Vol. 3632. Springer, 38--53. DOI: http://dx.doi.org/10.1007/11532231_4 Google Scholar
Digital Library
- Björn Victor and Faron Moller. 1994. The mobility workbench—A tool for the π-calculus. In Proc. of CAV’94, David Dill (Ed.). LCNS, Vol. 818. Springer, 428--440. DOI: http://dx.doi.org/10.1007/3-540-58179-0_73Google Scholar
- Lucian Wischik and Philippa Gardner. 2005. Explicit fusions. Theoret. Comput. Sci. 304, 3 (2005), 606--630. DOI: http://dx.doi.org/10.1016/j.tcs.2005.03.017 Google Scholar
Digital Library
Index Terms
The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi
Recommendations
Psi-Calculi in Isabelle
This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi-calculus, and the spi calculus. psi-calculi are significantly ...
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer ScienceA 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 ...
Psi-calculi in Isabelle
TPHOLs '09: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order LogicsPsi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied pi-calculus and the ...






Comments