M. Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, University of Cambridge, Computer Laboratory, December 1992. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Planning Proofs of Correctness of CCS Systems UNIVER - Monroy-Borja (1997) (Correct)
A Verification Tool for Value-Passing Processes - Lin (1993) (6 citations) (Correct)
Analysis of a Guard Condition in Type Theory - Amadio, Coupet-Grimal (1997) (8 citations) (Correct)
Proof Planning the Verification of CCS Programs - Monroy, Bundy, Ireland, Hesketh (Correct)
An Instruction Set Process Calculus - Shiu-Kai Chin And (Correct)
Algebraic Proof Assistants in HOL - Rix Groenboom (1995) (3 citations) (Correct)
Verification of LOTOS Specifications using Term Rewriting.. - Kirkwood (1994) (Correct)
Analysis of a Guard Condition in Type Theory - Amadio, Coupet-Grimal (1997) (8 citations) (Correct)
A Framework for Machine-Assisted User Interface.. - Bumbulis, Alencar.. (1995) (Correct)
A Mechanized Theory of the pi-calculus in HOL - Melham (1992) (6 citations) (Correct)
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
A Thread of HOL Development - Norrish, Slind (2002) (1 citation) (Correct)
Verification of LOTOS Specifications using Term Rewriting.. - Kirkwood (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC