1. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theor. Comp. Sci. 37(1), 77–121 (1985)
2. Bouali, A., Ressouche, A., Roy, V., de Simone, R.: The FC2TOOLS set. In: Alur, R., Henzinger, T. (eds.) Proceedings of the 8th Conference on Computer-Aided Verification, CAV‘96. Lecture Notes in Computer Science, vol. 1102, pp. 441–45. Springer, New York (1996)
3. Boulton, R., Slind, K., Bundy, A., Gordon, M.: An interface between CLAM and HOL. In: Grundy, J., Newey, M. (eds.) 11th International Conference on Theorem Proving in Higher-Order Logics (TPHOLs’98). Lecture Notes in Computer Science, vol. 1479, pp. 87–104. Springer, Camberra (1998)
4. Bruns, G.: A language for value-passing CCS. LFCS report series ECS-LFCS-91-175, department of computer science. University of Edinburgh (1991)
5. Bundy, A.: The use of explicit plans to guide inductive proofs. In: Lusk, R., Overbeek, R. (eds.) Proceedings of the 9th Conference on Automated Deduction, pp. 111–120. Springer, Argonne (1988) (Also available from Edinburgh as DAI Research Paper No. 349)