Subject
Computational Theory and Mathematics,Logic,Theoretical Computer Science,Software
Reference30 articles.
1. Turning SOS rules into equations;Aceto;Inform. Comput.,1994
2. H.R. Anderson, C.P. Stirling, G. Winskel, A compositional proof system for the modal μ-calculus, in: Proceedings of 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 144–153
3. G. Barthe, D. Gurov, M. Huisman, Compositional verification of secure Applet interactions, in: Proceedings of FASE'02, Springer LNCS 2306, 2002, pp. 15–32
4. J. Beattie, A Sequent Calculus for Proving Properties of Processes, M.Sc. dissertation, Division of Informatics, University of Edinburgh, 1997
5. Bisimulation can't be traced;Bloom;J. Assoc. Comput. Mach.,1995
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus;Theoretical Computer Science;2023-05
2. MODAL LOGICS FOR NOMINAL TRANSITION SYSTEMS;LOG METH COMPUT SCI;2021
3. A general account of coinduction up-to;Acta Informatica;2016-06-25
4. Coinduction up-to in a fibrational setting;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
5. A Proof System for Compositional Verification of Probabilistic Concurrent Processes;Lecture Notes in Computer Science;2013