|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Australasian Computer Science Conference (ACSC '01)
Polymorphic CSP Type Checking
Gold Coast, Queensland, Australia
January 29-February 02
ISBN: 0-7695-0963-0
| ASCII Text | x | ||
| Ping Gao, Robert Esser, "Polymorphic CSP Type Checking," Australasian Computer Science Conference, pp. 156, Australasian Computer Science Conference (ACSC '01), 2001. | |||
| BibTex | x | ||
| @article{ 10.1109/ACSC.2001.906637, author = {Ping Gao and Robert Esser}, title = {Polymorphic CSP Type Checking}, journal ={Australasian Computer Science Conference}, volume = {0}, year = {2001}, issn = {1530-0900}, pages = {156}, doi = {http://doi.ieeecomputersociety.org/10.1109/ACSC.2001.906637}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Australasian Computer Science Conference TI - Polymorphic CSP Type Checking SN - 1530-0900 SP EP A1 - Ping Gao, A1 - Robert Esser, PY - 2001 VL - 0 JA - Australasian Computer Science Conference ER - | |||
Communicating Sequential Processes (CSP) is a language used to describe and reason about concurrent systems. It consists of a process algebra combined with a functional language. This combination poses unique problems when attempting to design a type checker. In this paper the differences between a conventional functional language type checker and a type checker for the CSP language are discussed. This type checker was developed to identify polymorphic types, an important first step towards the goal of automating data independence [4 ]. The result of this work has been incorporated into the Adelaide Refinement Checker [8 ] (ARC)-a CSP based tool suite for model checking concurrent systems.
Citation:
Ping Gao, Robert Esser, "Polymorphic CSP Type Checking," acsc, pp.156, Australasian Computer Science Conference (ACSC '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.
