Polymorphic CSP type checking

Author

Gao, Ping ; Esser, Robert

Author_Institution

Dept. of Comput. Sci., Adelaide Univ., SA, Australia

fYear

2001

fDate

2001

Firstpage

156

Lastpage

162

Abstract

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. The result of this work has been incorporated into the Adelaide Refinement Checker (ARC)-a CSP based tool suite for model checking concurrent systems

Keywords

communicating sequential processes; distributed algorithms; type theory; Adelaide Refinement Checker; CSP based tool suite; concurrent systems; data independence; functional language; model checking; polymorphic communicating sequential processes type checking; polymorphic types; process algebra; type checker; Algebra; Buffer storage; Computer errors; Computer science; Data communication; Functional programming; Inference algorithms; Laboratories; Real time systems; State-space methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science Conference, 2001. ACSC 2001. Proceedings. 24th Australasian

Conference_Location

Gold Coast, Qld.

ISSN

1530-0900

Print_ISBN

0-7695-0963-0

Type

conf

DOI

10.1109/ACSC.2001.906637

Filename

906637