Modeling and Verifying Concurrent Programs with Finite Chu Spaces

• Published in: Journal of computer science and technology Vol. 25; no. 6; pp. 1168 - 1183
• Main Author: 杜旭涛 邢春晓 周立柱
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01.11.2010; Springer Nature B.V
• Subjects: Algebra; Algorithms; Artificial Intelligence; Behavior; Computer Science; Data Structures and Information Theory; Design; Enrichment; Exception handling; Information Systems Applications (incl.Internet); Mathematical analysis; Mathematical models; Program verification (computers); Programming languages; R&D; Regular Paper; Research & development; Semantics; Software; Software Engineering; Specifications; Theory of Computation; 同步机制; 并发程序; 并行编程语言; 异常处理; 有限空间; 进程代数; 验证算法; process algebra; Chu spaces; verification; denotational semantics; concurrency
• ISSN: 1000-9000; 1860-4749
• DOI: 10.1007/s11390-010-9397-y

Finite Chu spaces are proposed for the modeling and verification of concurrent programs.In order to model not only typical concurrent behaviors but also modern exception handling and synchronization mechanisms,we design an enriched process algebra of Chu spaces from a practical point of view.To illustrate the power of finite Chu spaces and the process algebra while abstracting away from language-specific details,an imaginary concurrent programming language（ICL） is designed.A denotational semantics of ICL is presented using finite Chu spaces and the enriched process algebra.The valuation functions are fairly straightforward since the carefully designed operators have done much of the job.The enriched process algebra is also used as the specification language for Chu spaces,with which process-algebraic properties can be specified.Verification algorithms are presented with their time complexities discussed.