Decidability and decompostion in process algebras, 1993. ,
Unique decomposition of processes, Theoretical Computer Science, vol.107, issue.2, pp.357-363, 1993. ,
DOI : 10.1016/0304-3975(93)90176-T
URL : http://doi.org/10.1016/0304-3975(93)90176-t
Axioms for concurrency, 1989. ,
Communication and Concurrency, International Series in Computer Science, 1989. ,
A calculus of mobile processes, part i, Information and Computation, pp.1-40, 1992. ,
Mobile values, new names, and secure communication, Proceedings of the 28th Symposium on Principles of Programming Languages (POPL'01), pp.104-115, 2001. ,
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924
Defining Privacy for Weighted Votes, Single and Multi-voter Coercion, Proceedings of the 17th European Symposium on Research in Computer Security (ESORICS'12), pp.451-468, 2012. ,
DOI : 10.1007/978-3-642-33167-1_26
URL : https://hal.archives-ouvertes.fr/hal-01338037
Verification of parallel systems via decomposition, Proceedings of the Third International Conference on Concurrency Theory (CONCUR'92), pp.62-76, 1992. ,
DOI : 10.1007/BFb0084783
Decoding Choice Encodings, Information and Computation, vol.163, issue.1, pp.1-59, 2000. ,
DOI : 10.1006/inco.2000.2868
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5996
A randomized encoding of the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculus with mixed choice, Theoretical Computer Science, vol.335, issue.2-3, pp.373-404, 2005. ,
DOI : 10.1016/j.tcs.2004.11.020
Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, pp.435-487, 2009. ,
DOI : 10.3233/JCS-2009-0340
A proof of coincidence of labeled bisimilarity and observational equivalence in applied pi calculus, Tech. Rep. ISCAS-SKLCS-11-05, Chinese Academy of Sciences, 2011. ,
A complete symbolic bisimulation for full applied pi calculus, Theoretical Computer Science, vol.458, pp.76-112, 2012. ,
DOI : 10.1016/j.tcs.2012.07.034
Held as Part of the European Joint Conferences on Theory and Practice of Software, Stateful applied pi calculus Principles of Security and Trust -Third International Conference, pp.22-41, 2014. ,
THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE, International Journal of Foundations of Computer Science, vol.03, issue.01, pp.81-97, 1992. ,
DOI : 10.1142/S0129054192000085
A variant of a recursively unsolvable problem, Bulletin of the American Mathematical Society, vol.52, issue.4, pp.264-268, 1946. ,
DOI : 10.1090/S0002-9904-1946-08555-9
Deciding equivalence-based properties using constraint solving, Theoretical Computer Science, vol.492, pp.1-39, 2013. ,
DOI : 10.1016/j.tcs.2013.04.016
URL : https://hal.archives-ouvertes.fr/hal-00881060
Proof System for Applied Pi Calculus, Theoretical Computer Science of IFIP Advances in Information and Communication Technology, pp.229-243, 2010. ,
DOI : 10.1007/978-3-642-15240-5_17
URL : https://hal.archives-ouvertes.fr/hal-01054457
Decomposition orders???another generalisation of the fundamental theorem of arithmetic, Theoretical Computer Science, vol.335, issue.2-3, pp.147-186, 2005. ,
DOI : 10.1016/j.tcs.2004.11.019
Unique parallel decomposition in branching and weak bisimulation semantics, Theoretical Computer Science -7th IFIP TC 1/WG 2.2 International Conference, pp.250-264, 2012. ,
DOI : 10.1007/978-3-642-33475-7_18
URL : https://hal.archives-ouvertes.fr/hal-01556230
On unique decomposition of processes in the applied pi-calculus, Proceedings of the 16th International Conference Foundations of Software Science and Computation Structures (FOSSACS'13), pp.50-64, 2013. ,
On Bisimilarity and Substitution in Presence of Replication, Proceedings of the 37th International Colloquium on Automata , Languages and Programming (ICALP'10), pp.454-465, 2010. ,
DOI : 10.1007/978-3-642-14162-1_38
URL : https://hal.archives-ouvertes.fr/hal-00375604