1. Andrews P.B., An Introduction to Mathematical Logic and Type Theory: To Truth through Proof, Computer Science and Applied Mathematics Series, Academic Press Inc., 1986.
2. Brookes S. D., and Roscoe A. W., An Improved Failures Model for Communicating Processes, in Seminar on Concurrency, Brookes S. D., Roscoe A. W., Winskel G. (eds.), Lecture Notes in Computer Science, Springer- Verlag, 1985, Vol. 197, pp. 281–305.
3. Camilleri A. J., Mechanizing CSP Trace Theory in Higher Order Logic, IEEE Transactions on Software Engineering, 16 (9), pp. 993–1004, Special Issue on Formal Methods in Software Engineering, Leveson N. (ed. ), September 1990.
4. Camilleri A. J., `Reasoning in CSP via the HOL Theorem Prover’, in Next Decade in Information Technology, IEEE Computer Society Press, Los Alamitos, 1990, pp. 173–183, Proceedings of the 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 22–25 October 1990.
5. Camilleri A. J., Inverardi P., and Nesi M., Combining Interaction and Automation in Process Algebra Verification’, to appear in the proceedings of the Colloquium on Combining Paradigms for Software Development, TAPSOFT ‘81, Brighton, 8–12 April, 1991.