IBM Skip to main content
  Home     Products & services     Support & downloads     My account  
  Select a country  
Journals Home  
  Systems Journal  
  ·  Current Issue  
  ·  Recent Issues  
  ·  Papers in Progress  
  ·  Search/Index  
  ·  Orders  
  ·  Description  
  ·  Author's Guide  
Journal of Research
and Development
  Staff  
  Contact Us  
  Related links:  
     IBM Research: AI  
     Verification
   Technologies		  
     Constraint.org  
     CP 2002 Conference  
IBM Systems Journal  
Volume 41, Number 3, 2002
Artificial Intelligence
 Table of contents: arrowHTML arrowPDF arrowASCII   This article: arrowHTML arrowPDF arrowASCII arrowCopyright info
   

Using a constraint satisfaction formulation and solution techniques for random test program generation - References
by E. Bin, R. Emek, G. Shurek and A. Ziv

Cited references

  1. J. Bergeron, Writing Testbenches: Functional Verification of HDL Models, Kluwer Academic Publishers, Boston, MA (January 2000).
  2. L. Fournier, Y. Arbetman, and M. Levinger, “Functional Verification Methodology for Microprocessors Using the Genesys Test Program Generator,” Proceedings of the Design Automation and Test in Europe Conference (DATE99), Munich, March 1999, ACM, New York (1999), pp. 434–441.
  3. A. Aharon, A. Bar-David, B. Dorfman, E. Gofman, M. Leibowitz, and V. Schwatzburd, “Verification of the IBM RISC System/6000 by a Dynamic Biased Pseudo-Random Test Program Generator,” IBM Systems Journal 30, No. 4 (1991), 527–538.
  4. A. Aharon, D. Goodman, M. Levinger, Y. Lichtenstein, Y. Malka, C. Metzger, M. Molcho, and G. Shurek, “Test Program Generation for Functional Verification of PowerPC Processors in IBM,” Proceedings of the 32nd Design Automation Conference (DAC95), IEEE, New York (1995), pp. 279–285.
  5. V. Kumar, “Algorithms for Constraint-Satisfaction Problems: A Survey,” A.I. Magazine 13, No. 1 (1992), 32–44.
  6. A. Borning, R. Duisberg, B. Freeman-Benson, A. Kramer, and M. Woolf, “Constraint Hierarchies,” Proceedings of OOPSLA'87, ACM, New York (1987), pp. 48–60.
  7. S. Mittal and B. Falkenhainer, “Dynamic Constraint Satisfaction Problems,” Proceedings of AAAI'90, American Association for Artificial Intelligence, Menlo Park, CA (1990), pp. 25–32.
  8. A. Mackworth, “Consistency in Networks of Relations,” Artificial Intelligence 8, No. 1 (1977), 99–118.
  9. C. Bessiere, E. C. Freuder, and J.-C. Regin, “Using Constraint Metaknowledge to Reduce Arc Consistency Computation,” Artificial Intelligence 107, No. 1 (1999), 125–148.
  10. M. Abramovici, M. Breuer, and A. Friedman, Digital Systems Testing and Testable Design, IEEE, New York (1995).
  11. J. Lee and J. Patel, “Architecture Level Test Generation for Microprocessors,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13, No. 10 (1994), 1288–1300.
  12. A. J. Offutt, “An Integrated Automatic Test Data Generation System,” Journal of System Integration 1, No. 3 (1991), 391–409.
  13. A. Chandra and V. Iyengar, “Constraint Solving for Test Case Generation—A Technique of High Level Design Verification,” Proceedings of the IEEE International Conference on Computer Design (ICCD), IEEE, New York (1992), pp. 245–248.
  14. L. Fournier, D. Lewin, M. Levinger, E. Roytman, and G. Shurek, “Constraint Satisfaction for Test Program Generation,” Proceedings of the IEEE 14th Annual International Phoenix Conference on Computers and Communications, IEEE, New York (1995), pp. 45–48.
  15. V. Chvátal, Linear Programming, W. H. Freeman and Company, New York (1983).
  16. J. Gu, P. W. Purdom, J. Franco, and B. W. Wah, “Algorithms for the Satisfiability (SAT) Problem: A Survey,” Satisfiability Problem: Theory and Applications, D. Du, J. Gu, and P. M. Pardalos, Editors, Volume 35 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI (1997), pp. 19–152.
  17. S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice-Hall, Englewood Cliffs, NJ (1995).
  18. T. Walsh, “SAT v. CSP,” Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP'00), Lecture Notes in Computer Science series, Vol. 1894, Springer-Verlag, New York (2000), pp. 441–456.
  19. A. Hartman, S. Ur, and A. Ziv, “Short vs Long: Size Does Make a Difference,” Proceedings of the IEEE High Level Design Validation and Test Workshop (HLDVT'99), IEEE, New York (1999).
  20. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, “Random Generation of Combinatorial Structures from a Uniform Distribution,” Theoretical Computer Science 43, No. 2–3 (1986), 169–188.
  21. N. Beldiceanu and E. Contjean, “Introducing Global Constraints in CHIP,” Mathematical and Computer Modelling 20, No. 12 (1994), 97–123.
  22. L. Fournier and A. Ziv, “Solving the Generalized Mask Constraint for Test Generation of Binary Floating Point Add Operation,” Theoretical Computer Science, special issue on Real Numbers and Computers (to appear).
  23. T. Ellman, “Abstraction by Approximate Symmetry,” IJCAI'93: Proceedings of the 13th International Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers, San Francisco, CA (1993), pp. 916–921.
  24. The PowerPC Architecture, C. May, E. Silha, R. Simpson, and H. Warren, Editors, Morgan Kaufmann Publishers, San Francisco, CA (1994).
  25. M. H. Sqalli and E. C. Freuder, “Constraint-Based Modeling of Interoperability Problems Using an Object-Oriented Approach,” Proceedings of the Thirteenth Innovative Applications of Artificial Intelligence Conference on Artificial Intelligence, American Association for Artificial Intelligence, Menlo Park, CA (2001).
  26. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, “Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems,” Artificial Intelligence 58, No. 1–3 (1992), 161–205.
  27. C. Bessière and J.-C. Régin, “MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems,” Proceedings of the 2nd International Conference on Principles and Practices of Constraint Programming (CP'96); Lecture Notes in Computer Science series, Volume 1118, Springer-Verlag, New York (1996), pp. 61–75.
  28. D. Frost and R. Dechter, “Look-Ahead Value Ordering for Constraint Satisfaction Problems,” IJCAI'95: Proceedings of the International Joint Conference on Artificial Intelligence, C. Mellish, Editor, Montreal, August 1995, Morgan Kaufmann Publishers, San Francisco, CA (1995).
  29. W. Harvey and P. J. Stuckey, “Constraint Representation for Propagation,” Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98), Lecture Notes in Computer Science series, Volume 1520, Springer-Verlag, New York (1998), pp. 235–249.
  30. F. Bacchus and P. van Beek, “On the Conversion Between Non-Binary and Binary Constraint Satisfaction Problems,” Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), AAAI Press, Menlo Park, CA (1998), pp. 311–318.
  31. C. Bessière and J.-C. Régin, “Arc Consistency for General Constraint Networks: Preliminary Results,” Proceedings of the IJCAI, Morgan Kaufmann Publishers, San Francisco, CA (1997), pp. 398–404.
  32. E. C. Freuder, “A Sufficient Condition for Backtrack-Free Search,” Journal of the Association for Computer Machinery 29, No. 1 (1982), 24–32.
  33. R. Dechter and J. Pearl, “Network-Based Heuristics for Constraint-Satisfaction Problems,” Artificial Intelligence 34, No. 1 (1988), 1–38.
  34. I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications, Siam Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia, PA (2000).
  35. IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Standard 745-1985, American National Standards Institute, Washington, DC (1985).
  36. D. A. Patterson and J. L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Morgan Kaufmann, San Francisco, CA (1997).
  37. E. Tsang, C. Wang, A. Davenport, C. Voudouris, and T. Lau, “A Family of Stochastic Methods for Constraint Satisfaction and Optimization,” Proceedings of the First International Conference on the Practical Application of Constraint Technologies and Logic Programming (PACLP'99), London, April 1999, The Practical Applications Company Ltd. (1999).
  38. B. N. Freeman-Benson, J. Maloney, and A. Borning, “An Incremental Constraint Solver,” Communications of the ACM 33, No. 1 (1990), 54–63.
  39. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier, “The Constraint Logic Programming Language CHIP,” FGCS-88: Proceedings of the International Conference on Fifth-Generation Computer Systems, Tokyo, December 1988, Springer-Verlag, New York (1988), pp. 693–702.
About IBM | Privacy | Legal | Contact