By Topic

Improving feasible interactions among multiple processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ramineni, K. ; Univ. of California Irvine, Irvine ; Harris, I.G. ; Verma, S.

Hierarchical testing requires the verification of individual processes followed by the verification of the interactions among processes. The large number of potential interactions between processes must be managed in order to make the testing process tractable. Fortunately, many potential interactions are actually infeasible and should be ignored during the verification process. Data dependency between processes indicates the potential for a feasible interaction but absolute feasibility can only be determined by evaluating control-flow paths across interacting processes. We propose a method to identify feasible interactions for testing through static analysis combined with the use of a constraint satisfaction programming (CSP) solving engine.

Published in:

High Level Design Validation and Test Workshop, 2007. HLVDT 2007. IEEE International

Date of Conference:

7-9 Nov. 2007