This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Application of Concurrency to System Design (ACSD'98)
How to Make Concurrent Programs Highly Reliable- More than State Space Analysis
Fukushima, Japan
March 23-March 26
ISBN: 0-8186-8350-3
Naoshi Uchihira, Toshiba Corporation
In this paper, several approaches to make concurrent programs highly reliable are surveyed. The state space analysis including model checking is the most promising formal verification approach for concurrent programs. However, it is not almighty for actual program development. This paper focuses on harmful nondeterministic behaviors of concurrent programs and introduces three advanced approaches (testing with verification, program adjustment, and hypersequential programming) to detect and remove them, which provide more than state space analysis. We also show our projects and tools going along with these approaches.
Citation:
Naoshi Uchihira, "How to Make Concurrent Programs Highly Reliable- More than State Space Analysis," acsd, pp.16, First International Conference on Application of Concurrency to System Design (ACSD'98), 1998
Usage of this product signifies your acceptance of the Terms of Use.