ACM Home Page
Please provide us with feedback. Feedback
Assume-guarantee testing
Full text PdfPdf (257 KB)
Source ACM SIGSOFT Software Engineering Notes archive
Volume 31 ,  Issue 2  (March 2006) table of contents
SESSION: Specification and Verification of Component-Based Systems Workshop (SAVCBS 2005) table of contents
Article No. 1  
Year of Publication: 2006
ISSN:0163-5948
Also published in ...
Authors
Colin Blundell  University of Pennsylvania, Philadelphia, PA
Dimitra Giannakopoulou  RIACS/NASA Ames, NASA Ames Research Center, Moffett Field, CA
Corina S. Pǎsǎreanu  QSS/NASA Ames, NASA Ames Research Center, Moffett Field, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 49,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1145/1108768.1123060

ABSTRACT

Verification techniques for component-based systems should ideally be able to predict properties of the assembled system through analysis of individual components before assembly. This work introduces such a modular technique in the context of testing. Assume-guarantee testing relies on the (automated) decomposition of key system-level requirements into local component requirements at design time. Developers can verify the local requirements by checking components in isolation; failed checks may indicate violations of system requirements, while valid traces from different components compose via the assume-guarantee proof rule to potentially provide system coverage. These local requirements also form the foundation of a technique for efficient predictive testing of assembled systems: given a correct system run, this technique can predict violations by alternative system runs without constructing those runs. We discuss the application of our approach to testing a multi-threaded NASA application, where we treat threads as components.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
H. Barringer, D. Giannakopoulou, and C. S. Pǎsǎreanu. Proof rules for automated compositional verification through learning. In International Workshop on Specification and Verification of Component-Based Systems, Sept. 2003.
 
3
H. Barringer, A. Goldberg, K. Havelund, and K. Sen. Rule-based runtime verification. In International Conference on Verification, Model Checking and Abstract Interpretation, Jan. 2004.
 
4
 
5
J. M. Cobleigh, D. Giannakopoulou, and C. S. Pǎsǎreanu. Learning assumptions for compositional verification. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr. 2003.
6
 
7
 
8
 
9
 
10
11
12
 
13
14
 
15
C. B. Jones. Specification and design of (parallel) programs. In IFIP World Computer Congress, Sept. 1983.
 
16
J. Levy, H. Saidi, and T. E. Uribe. Combining monitors for run-time system verification. Electronic Notes in Theoretical Computer Science, 70(4), Dec. 2002.
 
17
 
18
 
19
K. Sen, G. Rosu, and G. Agha. Detecting errors in multithreaded programs by generalized predictive analysis of executions. In Conference on Formal Methods for Open Object-Based Distributed Systems, 2005.
 
20
21


Collaborative Colleagues:
Colin Blundell: colleagues
Dimitra Giannakopoulou: colleagues
Corina S. Pǎsǎreanu: colleagues