Abstract
Constraint programming (CP) is a powerful technology that has proved very useful in random functional test generation. On the other hand the complexity of the test generation process prevents it from being represented and solved as a single constraint satisfaction problem (CSP). Developers of test generation tools have to decompose the problem into a set of smaller tasks and to make CP work in interaction with other technologies, e.g. architectural simulator. The task of turning these foreign technologies into an integral part of the CP search algorithm raises multiple challenges. We propose a method for accomplishing this task by means of so called custom constraints, which are based on demons and custom propagation algorithms. We implemented the method in a framework of ILOG Solver and tested it on a use case of the memory address translation mechanism for protected mode of IA-32 processor
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
