1. [2] Affeldt, R. and Kobayashi, N.: A Coq library for verification of concurrent programs, 4th International Workshop on Logical Frameworks and Meta-Languages (LFM 2004), Cork, Ireland, July 5, 2004, pp.66-83. Preliminary proceedings available at: http://cs-www.cs.yale.edu/homes/carsten/lfm04/. Formal proceedings are to appear in Electronic Notes in Theoretical Computer Science, Elsevier. Coq documentation available at: http://web.yl.is.s.u-tokyo.ac.jp/˜{}affeldt/applpi/.
2. [3] Affeldt, R. and Kobayashi, N.: Partial order reduction for verification of spatial properties of pi-calculus processes, 11th International Workshop on Expressiveness in Concurrency(EXPRESS 2004), London, UK, August 30, 2004, pp.113-127. Preliminary proceedings. Formal proceedings are to appear in Electronic Notes in Theoretical Computer Science, Elsevier.
3. [4] Cardelli, L. and Gordon, A.D.: Anytime, anywhere: modal logics for mobile ambients, 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), Boston, Massachusetts, USA, January 19-21, 2000, pp.365-377, ACM Press (2000).
4. Formal verification of concurrent programs using the Larch prover