Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE

In this paper, we examine “program adjustment”, a formal and practical approach to developing correct concurrent programs, by automatically adjusting an imperfect program to satisfy given constraints. A concurrent program is modeled by a finite state process, and program adjustment to satisfy tempor...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software Vol. 33; no. 3; pp. 207 - 221
Main Authors: Uchihira, Naoshi, Honiden, Shinichi
Format: Journal Article
Language:English
Published: New York Elsevier Inc 01.06.1996
Elsevier Sequoia S.A
Subjects:
Computer programming
Multitasking
Parallel processing
Studies
Systems development
Temporal logic
ISSN:0164-1212, 1873-1228
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we examine “program adjustment”, a formal and practical approach to developing correct concurrent programs, by automatically adjusting an imperfect program to satisfy given constraints. A concurrent program is modeled by a finite state process, and program adjustment to satisfy temporal logic constraints is formalized as the synthesis of an arbiter process which partially serializes target (i.e., imperfect) processes to remove harmful nondeterministic behaviors. Compositional adjustment is also proposed for large-scale compound target processes, using process equivalence theory. We have developed a computer-aided programming environment on the parallel computer Multi-PSI, called MENDELS ZONE, that adopts this compositional adjustment. Adjusted programs can be compiled into the kernel language (KL1) and executed on Multi-PSI.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0164-1212
1873-1228
DOI:10.1016/0164-1212(96)00021-0