A Higher Order Logic Mechanization of the CSP Failure-Divergence Semantics

Camilleri, Albert John

doi:10.1007/978-1-4471-3182-3_9

Cited by 17 publications

(12 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was felt, however, that a rewriting system alone would be quite restrictive, and that a system with a meta-language to facilitate programming additional strategies, as well as provide more general and powerful proof techniques, was required. The mechanization of the csP failure-divergence semantics in HOL described in [3], suggested that HOL might be a suitable environment for supporting process algebras in the manner we are advocating, so the work described in this paper was intended as a first attempt at investigating this.…”

Section: Related Workmentioning

confidence: 99%

“…notion of observational congruence, and derive its axiomatization. There has already been some work to show that it is feasible to mechanize process algebra semantics in tIOL and to mechaaically prove their axiomatization [2,3,17]. Thus, we have decided not to undertake the steps described above for the time being, but to proceed directly to assert the axioms for observational congruence in the ItOL logic and to concentrate our efforts on practical reasoning tools at the axiomatic level.…”

Section: Axiomatizing Ccs In Holmentioning

confidence: 99%

“…Our research stems from two separately developed pieces of work, described in [10] and [3]. In [10], a kernel specification system for a subset of ccs is presented.…”

Section: Related Workmentioning

confidence: 99%

“…The theorem proving system used in the mechanizations described in [3,16] is called HOL [15]. The HOL system, developed by Gordon, is based directly on the LCF theorem prover [24], and the theorem proving methodology supported by HOL is inherited from that originally developed by Milner for LCF.…”

Section: The Hol Systemmentioning

confidence: 99%

“…It has been used to express several other logics and process algebras [16,3], such as Floyd-Hoare logic, temporal and modal logics, VDM-style specifications, Dijkstra's weakest preconditions and cse.…”

Section: The Hol Systemmentioning

confidence: 99%

See 4 more Smart Citations

Combining interaction and automation in process algebra verification

1991

View full text Add to dashboard Cite

Most existing verification tools for process algebras allow the correctness of specifications to be checked in a fully automatic fashion. These systems have the obvious advantage of being easy to use, but unfortunately they also have some drawbacks. In particular, they do not always succeed in completing the verification analysis, due to the problem of state explosion, and they do not provide any insight into the meaning of the intended specifications. In this paper we consider an alternative approach in which both interactive and automatic techniques are combined in the hope that the advantages of automation are retained, and that some of its disadvantages are overcome. To achieve our goal, we use the interactive theorem prover ItOL as a framework for supporting the theory of observational congruence of ccs, and provide a set of automatic proof tools, based on the algebraic axiomatization of the language, which can be used interactively. To illustrate how interaction and automation can be intermixed, we describe two verification strategies which exhibit different degrees of user interaction.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Axiomatizing Ccs In Holmentioning

confidence: 99%

“…Our research stems from two separately developed pieces of work, described in [10] and [3]. In [10], a kernel specification system for a subset of ccs is presented.…”

Section: Related Workmentioning

confidence: 99%

Section: The Hol Systemmentioning

confidence: 99%

Section: The Hol Systemmentioning

confidence: 99%

See 3 more Smart Citations

Combining interaction and automation in process algebra verification

1991

View full text Add to dashboard Cite

show abstract

Embedding the Stable Failures Model of CSP in PVS

Heather

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platform for the formal verification not only of safety specifications, but also of liveness specifications of concurrent systems in theorem provers. Such a platform is particularly good at analyzing infinite-state systems with an arbitrary number of components. We demonstrate the power of this embedding by using it to construct formal proofs that the asymmetric dining philosophers problem with an arbitrary number of philosophers is deterministic and deadlockfree, and that an industrial-scale example, a 'virtual network' [22], with any number of dimensions, is deadlock-free. We have established some generic proof tactics for verification of properties of networks with many components. In addition, our technique of integrating FDR and PVS in our demonstration allows for handling of systems that would be difficult or impossible to analyze using either tool on its own.

show abstract

Process Algebra in PVS

Basten

Hooman

1999

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

A Higher Order Logic Mechanization of the CSP Failure-Divergence Semantics

Cited by 17 publications

References 8 publications

Combining interaction and automation in process algebra verification

Combining interaction and automation in process algebra verification

Embedding the Stable Failures Model of CSP in PVS

Process Algebra in PVS

Contact Info

Product

Resources

About