Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Briais, Sébastien
and
Nestmann, Uwe
2006.
Open Bisimulation, Revisited.
Electronic Notes in Theoretical Computer Science,
Vol. 154,
Issue. 3,
p.
109.
Tiu, Alwen
2007.
Programming Languages and Systems.
Vol. 4807,
Issue. ,
p.
367.
Briais, Sébastien
and
Nestmann, Uwe
2007.
Open bisimulation, revisited.
Theoretical Computer Science,
Vol. 386,
Issue. 3,
p.
236.
Kahsai, Temesghen
and
Miculan, Marino
2008.
Logic and Theory of Algorithms.
Vol. 5028,
Issue. ,
p.
294.
Borgström, Johannes
2009.
A Complete Symbolic Bisimilarity for an Extended Spi Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 242,
Issue. 3,
p.
3.
Bengtson, Jesper
Johansson, Magnus
Parrow, Joachim
and
Victor, Björn
2009.
Psi-calculi: Mobile Processes, Nominal Data, and Logic.
p.
39.
Dawson, Jeremy E.
and
Tiu, Alwen
2009.
Theorem Proving in Higher Order Logics.
Vol. 5674,
Issue. ,
p.
180.
Tiu, Alwen
and
Dawson, Jeremy
2010.
Automating Open Bisimulation Checking for the Spi Calculus.
p.
307.
Martinho, Joana
and
Ravara, António
2011.
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation.
Journal of Automated Reasoning,
Vol. 46,
Issue. 3-4,
p.
293.
Bengtson, Jesper
Johansson, Magnus
Parrow, Joachim
and
Victor, Björn
2011.
Psi-calculi: a framework for mobile processes with nominal data and logic.
Logical Methods in Computer Science,
Vol. Volume 7, Issue 1,
Issue. ,
Koutavas, Vasileios
and
Hennessy, Matthew
2011.
Programming Languages and Systems.
Vol. 6602,
Issue. ,
p.
358.
Blanchet, Bruno
and
Smyth, Ben
2016.
Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers.
p.
310.
Blanchet, Bruno
and
Smyth, Ben
2018.
Automated reasoning for equivalences in the applied pi calculus with barriers.
Journal of Computer Security,
Vol. 26,
Issue. 3,
p.
367.
Abbas, Marat M.
and
Zakharov, Vladimir A.
2018.
Even Simple Processes of π-calculus are Hard for Analysis.
Modeling and Analysis of Information Systems,
Vol. 25,
Issue. 6,
p.
589.
Abbas, M. M.
and
Zakharov, V. A.
2019.
Even Simple π-Calculus Processes Are Difficult to Analyze.
Automatic Control and Computer Sciences,
Vol. 53,
Issue. 7,
p.
573.
Horne, Ross
Mauw, Sjouke
and
Yurkov, Semen
2021.
Theoretical Aspects of Computing – ICTAC 2021.
Vol. 12819,
Issue. ,
p.
235.
Horne, Ross
Mauw, Sjouke
and
Yurkov, Semen
2023.
When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus.
Theoretical Computer Science,
Vol. 959,
Issue. ,
p.
113842.