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   Summary   Related Articles   Check

....were selected. Currently, the Mathematical Reasoning Group at Edinburgh and the Automated Reasoning Group at Cambridge are running a joint project to link the systems CL A M and HOL. If the integrated framework were chosen to conduct CCS verification, then the appropriate reference is [Nesi 92, Nesi 94] which describes a formalisation of CCS into the HOL system. Linking CL A M to the PAM system is another possibility worth considering. Since PAM is a generic proof framework, especially devoted to process algebras, the formalisation of CCS into PAM is facilitated to a great extent. ....

M. Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Paper 278, Computer Laboratory, University of Cambridge, 1992.

....equivalence between processes in basic CCS, so that it can be decided using existing algorithms for basic CCS. Their algorithm has been implemented. Work on using higher order logic and the general purpose theorem prover HOL to develop an interactive verification tool has been reported in [Nes92]. Their approach is also based on the axiomatisation of behavioural semantics. We are not aware any existing proof tool other than VPAM that can cope with valuepassing process calculi. 3 Inference Systems for Value Passing Processes 3.1 Symbolic Operational Semantics and Symbolic Bisimulations ....

M. Nesi. A formalization of the process algebra CCS in higher order logic. Report Report No. 278, Computer Laboratory, University of Cambridge, 1992.

....on the Coq system [Cp96] In this representation, processes can be directly represented in the logic as elements of a certain type. Hence, this approach dioeers sharply from those where, say, processes are represented at a syntactic level as elements of an inductively dened type (see, e.g. [Mel92, Nes92, AM96]) In our experience [CGJ96, CG96] the representation based on co inductive types is more direct and manageable. This may be a decisive advantage when carrying on formal proofs, and it represents a solid motivation for our study. The introduction of innite itotalj objects relies on recursive ....

M. Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, Computer Laboratory, University of Cambridge, December 1992.

....They could be split into two classes [14] automata theory based e.g. 9, 11] and theorem proving The research reported here was supported by CONACyT studentship 64745 to the first author, and EPSRC grants GR J 80702 and GR J 58619 to the second and third author, respectively. based e.g. [17, 22]. Automata theory based tools are much more popular due to their level of automation, but are not able to deal with systems that contain infinite states or that comprise a finite but unbound number of components. Also, most of the existing tools of either kind make the process of correcting ....

....subexpression ff:F of E, for ff 6= while sequential(S; E) means that S only occurs within Prefix ( or Summation ( combinators in E. Informally, this rule says that two processes are equivalent if they satisfy the same set of recursive equations. Both the PAM system [17] and the HOL system [22], have a tactic which applies UFI forwards, using an AC matching algorithm. Thus proving two process equivalent amounts to AC matching the sets of equations that such processes have been proved to satisfy. Certainly, a bunch of, most of the time tedious, equation manipulations must be performed ....

Nesi, M.: `A Formalization of the Process Algebra CCS in Higher Order Logic', Computer Laboratory, University of Cambridge, Technical Paper 278, 1992.

....parallel composition and hiding. The syntax and semantics of IspCal, all the equational laws, examples, and proofs have been done as conservative extensions to the higher order logic of the HOL [6] theorem prover. The techniques of defining IspCal within HOL are similar to the work done by Nesi [13]. Details of IspCal in HOL and the HOL proofs of the examples are found in http: www.cat.syr.edu chin The rest of this paper is organized as follows. Section 2 describes the Mealy machine model of hardware. Section 3 describes the syntax and semantics of behavioral IspCal expressions while ....

Monica Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambridge, December 1992.

....is good to make clear what this paper is not about. It is not about proving this algebra sound, by providing a semantics, and showing that the algebraic laws hold with respect to that semantics. This is a well trodden path, and has for example been done for CSP by Camilleri [C91] and CCS by Nesi [N92]. Moreover, it is not about a proof for a particular (hardware) design, like a correctness proof for a microprocessor [H89] or an SECD machine [BG90] This paper, and the entire project for that matter, aims at providing an environment in which a user can prove any design at hand, with the same ....

M. Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambrigde Computer Laboratory, December 1992.

....between processes to be reduced to a logical statement, and therefore allowing the use of a general logic based theorem prover to perform equivalence checking. Examples of such systems include: Fle87] which uses the Boyer Moore theorem prover, Boo89] which uses LCF, and [CR90, CIN91, Nes92] which are based on HOL. Note that [Nes92] does not fit comfortably into our categories as the work is based on formalising the semantics of CCS in HOL. Nevertheless, this is certainly a formal approach, rather than a graph based one. Once the transition relations are described, and the ....

....to a logical statement, and therefore allowing the use of a general logic based theorem prover to perform equivalence checking. Examples of such systems include: Fle87] which uses the Boyer Moore theorem prover, Boo89] which uses LCF, and [CR90, CIN91, Nes92] which are based on HOL. Note that [Nes92] does not fit comfortably into our categories as the work is based on formalising the semantics of CCS in HOL. Nevertheless, this is certainly a formal approach, rather than a graph based one. Once the transition relations are described, and the equivalence relations, proof tactics and operators ....

M. Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambridge Computer Laboratory, 1992.

....on the Coq system [Cp96] In this representation, processes can be directly represented in the logic as elements of a certain type. Hence, this approach differs sharply from those where, say, processes are represented at a syntactic level as elements of an inductively defined type (see, e.g. [Mel92, Nes92, AM96]) In our experience [CGJ96, CG96] the representation based on co inductive types is more direct and manageable. This may be a decisive advantage when carrying on formal proofs, and it represents a solid motivation for our study. The introduction of infinite total objects relies on recursive ....

M. Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, Computer Laboratory, University of Cambridge, December 1992.

.... a machine assisted verification process we use the version of higher order logic mechanized by Gordon s HOL system [36] The advantages of using HOL include the fact that mechanizations exist for a wide class of formalisms that have been used to specify user interfaces, including CSP [7] CCS [31], Statecharts [10] Temporal Logic [19, 39] and the Temporal Logic of Actions (TLA) 41] The HOL system consists of a meta language ML and a logic. The HOL logic is a natural deduction logic: assertions in the logic are sequents of the form ( Gamma; t) where Gamma is a set of assumptions ....

Monica Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, University of Cambridge Computing Laboratory, December 1992.

.... of the HOL mechanization with a proof system for the calculus implemented using a more general logical framework, such as Isabelle [20] or the Edinburgh Logical Framework [10] The research most closely related to the theory described in this paper is Monica Nesi s work on a theory of CCS in HOL [19]. This work parallels ours; essentially the same techniques are used to define the syntax and transitional semantics of CCS and to derive rules for observation congruence. A modal logic for CCS (a variant of Hennessy Milner logic [11] is also included in Nesi s theory. One of the main technical ....

M. Nesi, `A Formalization of the Process Algebra CCS in Higher Order Logic', Technical report no. 278, Computer Laboratory, University of Cambridge (December 1992).

No context found.

M. Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, University of Cambridge, Computer Laboratory, December 1992.

No context found.

Monica Nesi. A formalization of the process algebra CCS in higher order logic. Technical Report 278, Computer Laboratory, University of Cambridge, December 1992.

No context found.

M. Nesi. A Formalization of the Process Algebra CCS in Higher Order Logic. Technical Report 278, University of Cambridge Computer Laboratory, 1992.

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