Verification of Chare-kernel programs

Book · Sun Jan 01 00:00:00 EST 1989

OSTI ID:6468038

Bhansali, S; Kale, L V ^[1]

---

1. Univ. of Illinois at Urbana-Champaign, IL (US)

Experience with concurrent programming has shown that concurrent programs can conceal bugs even after extensive testing. Thus, there is a need for practical techniques which can establish the correctness of parallel programs. This paper proposes a method for showing how to prove the partial correctness of programs written in the Chare-kernel language, which is a language designed to support the parallel execution of computation with irregular structures. The proof is based on the lattice proof technique and is divided into two parts. The first part is concerned with the program behavior within a single chare instance, whereas the second part captures the inter-chare interaction.

• OSTI ID: 6468038
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
IMPLEMENTATION
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
PROGRAMMING
990200* - Mathematics & Computers