Reconfigurable Processor Verification via Random Test Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for verifying reconfigurable processors, such as using Constraint Satisfaction Problems (CSPs), are inefficient due to the need for both syntactic and semantic knowledge and the complexity of managing thousands of constraints, making it difficult to effectively test these processors.
Innovation Solution
A random test method and apparatus that generates a test program based on an architecture description and test description, allowing for verification by comparing output and input value types between a reconfigurable processor and a simulator, without requiring specific semantic knowledge, and utilizing a value type tracking method to verify operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Constraint Satisfaction Problems (CSPs) are used as test programs, then verification can be performed with structured constraints, but the method requires both syntactic and semantic knowledge and becomes infeasible when dealing with thousands of constraints
Solution Approach 1:
The patent extracts only the syntactic knowledge requirement from the verification process, eliminating the need for semantic knowledge. This is achieved by using a template-based test program generation approach that focuses on structural correctness rather than semantic interpretation, thereby reducing complexity while maintaining verification reliability
Solution Approach 2:
The verification process is segmented into distinct components: template definition, instance generation, and execution. By dividing the monolithic CSP approach into manageable segments, the patent reduces the complexity of constraint management while preserving the ability to verify reconfigurable processor operations
2Reliability
If traditional test programs with thousands of constraints are used, then comprehensive verification coverage can be achieved, but the testing process becomes infeasible due to the large number of constraints
Solution Approach 1:
The patent changes the parameter of test program generation from fixed comprehensive constraints to configurable template instances. By allowing users to define templates with essential verification points and generating multiple instances from these templates, the system achieves comprehensive coverage without the overhead of managing thousands of individual constraints, thereby improving testing efficiency
Solution Approach 2:
The template-based approach creates universal test structures that can be applied across multiple verification scenarios. A single template can generate numerous test instances covering different operational aspects of the reconfigurable processor, achieving comprehensive verification coverage through a unified, efficient mechanism
3Reliability
If semantic knowledge is required for test program generation, then accurate verification can be performed, but the process becomes more complex and less automated
Solution Approach 1:
The system performs self-service by automatically generating test programs from user-defined templates without requiring manual semantic analysis. The template-based approach encapsulates verification logic in reusable structures that can be instantiated and executed automatically, maintaining verification accuracy while maximizing automation extent
Data Source
AI summary
A method for verifying an operation of a reconfigurable processor is provided. The method includes generating a random test program using a test description and an architecture description, executing the generated random test program in the reconfigurable processor and in a simulator, and then comparing types of output values in the execution result.