Scenario-Based Hypersequential Programming

Authors:
Naoshi Uchihira;Hideji Kawata;Fumitaka Tamura
Affiliations:
Corporate Research and Development Center, Toshiba Corporation, naoshi.uchihira@{kawata@ssel.,tamu@ssel.}toshiba.co.jp;Corporate Research and Development Center, Toshiba Corporation, naoshi.uchihira@{kawata@ssel.,tamu@ssel.}toshiba.co.jp;Corporate Research and Development Center, Toshiba Corporation, naoshi.uchihira@{kawata@ssel.,tamu@ssel.}toshiba.co.jp
Venue:
International Journal of Parallel Programming - Special issue on international symposium on high performance computing 1997, part I
Year:
2000

Citing 11
Cited 0

Debugging concurrent programs

ACM Computing Surveys (CSUR)
Supercompilers for parallel and vector computers

Supercompilers for parallel and vector computers
Debugging Concurrent Ada Programs by Deterministic Execution

IEEE Transactions on Software Engineering
Where are we headed?

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

Journal of Systems and Software - Special issue on software engineering for distributed computing
Communication and Concurrency

Communication and Concurrency
Hypersequential Programming: A New Way to Develop Concurrent Programs

IEEE Parallel & Distributed Technology: Systems & Technology
Detecting Nondeterminacy in Parallel Programs

IEEE Software
Automatic Extraction of Functional Parallelism from Ordinary Programs

IEEE Transactions on Parallel and Distributed Systems
Scenario-Based Hypersequential Programming: Concept and Example

PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems
Formal languages and their relation to automata

Formal languages and their relation to automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypersequential programming is a new paradigm of concurrent programming. The original concurrent program is first serialized, then the sequential version is tested and debugged, and finally the target concurrent program is synthesized by parallelizing the debugged sequential version. In hypersequential programming, testing and debugging are performed on the sequential version of the program and the correctness is preserved in the subsequent parallelization process. Therefore, it offers both higher productivity and enhanced reliability. This paper describes a practical approach to hypersequential programming using the execution history called scenario. It also formalizes the parallelization process using a new equivalence relation called scenario graph equivalence, and gives the parallelization algorithm.