Skip to main content
SpringerLink
Log in

Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

In the electronic computer-aided design area, the test generation problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have some unspecified Primary Inputs (i.e. bits are assigned neither 0 nor 1). In fact, for many purposes, minimally specified tests (or patterns) are preferred. Hence, we have the test pattern optimisation (TPO) problem where the goal is to obtain a test with the maximum number of unspecified bits. In this paper we discuss different modelling approaches and present a TPO tool (Maxx) that substantially outperforms others by combining Branch-and-Bound and local search over distinct models. We apply the usual branch-and-bound search on CLP(FD) over a simple, yet incomplete, logic. A complementary Local Search is performed over an extended model, trying to improve an already computed solution by exploring an extended solution space thanks to the use of an extended logic (too complex for constraint solving). Such extended logic considers sets of dependencies on specified input values, keeping track of sources of unspecified values and their inversion parities. This allows modelling a number of alternative test vectors by unspecification of each possible input bit, thus being able to obtain an improved test vector in linear time. This paper shows, for TPO, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone, obtaining significantly better results than those obtained with a highly efficient tool based on an integer linear programming formulation on a propositional satisfiability model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramovici, M., Breuer, M. A., & Friedman, A. D. (1990). Digital Systems Testing and Testable Design. IEEE Press.

  2. Agrawal, V. D., & Agrawal, P. (1972). An automatic test generation system for ILLIAC IV logic boards. IEEE Trans. Comput. C-21(9): 1015–1017.

    Article  Google Scholar 

  3. Azevedo, F. (2003). Constraint Solving over Multi-valued Logics—Application to Digital Circuits. Frontiers of Artificial Intelligence and Applications Vol 91 (pp. xviii+204). ISBN: 1 58603 304 2. IOS Press.

  4. Azevedo, F., & Barahona, P. (1998). Generation of test patterns for differential diagnosis of digital circuits (extended abstract). In Maher, M. & Puget, J.-F., eds., Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP’98), page 462. Springer.

  5. Azevedo, F., & Barahona, P. (2000). Differentiating diagnostic theories through constraints over an eight-valued logic. In Horn, W., ed., Proceedings of the 14th European Conference on Artificial Intelligence (ECAI’2000), pages 73–77. Amsterdam:IOS Press.

    Google Scholar 

  6. Azevedo, F., & Barahona, P. (2000). Modelling digital circuits problems with set constraints. In J. Lloyd et al. (Eds.), Proceedings of the First International Conference on Computational Logic (CL’2000), pages 414–428. Springer.

  7. Azevedo, F., & Barahona, P. (2001). Interaction of constraint programming and local search for optimisation problems. In Walsh, T., ed., Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP’01), LNCS 2239, pages 554–559. Springer.

  8. Balas, E., & Toth, P. (1985). Branch and Bound Methods, in the Traveling Salesman Problem, pages 361–401. John Wiley & Sons.

    Google Scholar 

  9. Breuer, M. A. (1971). A random and an algorithmic technique for fault detection test generation for sequential circuits. IEEE Trans. Comput. C-20(11): 1364–1370.

    Article  MATH  MathSciNet  Google Scholar 

  10. Chakradhar, S. T., Agrawal, V. D., & Rothweiler, S. G. (1993). A transitive closure algorithm for test generation. IEEE Trans. Comput.-Aided Des. 12(7): 1015–1028.

    Article  Google Scholar 

  11. ECRC (1994). ECLiPSe (a) user manual, (b) extensions of the user manual. Technical Report, ECRC.

  12. Flores, P. F. (2001). Models and algorithms for optimization problems in digital circuits testing. Ph.D. thesis, Universidade Técnica de Lisboa.

  13. Flores, P. F., Neto, H. C., Chakrabarty, K., & Marques-Silva, J. P. (1998). A model and algorithm for computing minimum-size test patterns. In IEEE European Test Workshop (ETW), pages 147–148. IEEE

  14. Flores, P. F., Neto, H. C., & Marques-Silva, J. P. (1998). An exact solution to the minimum-size test pattern problem. In IEEE/ACM International Workshop on Logic Synthesis (IWLS), pages 452–470. IEEE.

  15. Hellebrand, S., Reeb, B., Tarnick, S., & Wunderlich, H.-J. (1995). Pattern generation for a deterministic BIST scheme. In Proceedings of the International Conference on Computer-Aided Design. IEEE.

  16. Ibarra, O. H., & Sahni, S. (1975). Polynomially complete fault detection problems. IEEE Trans. Comput. C-24(3): 242–249.

    Article  MATH  MathSciNet  Google Scholar 

  17. ISCAS (1985). Special Session on ATPG, Proceedings of the IEEE Symposium on Circuits and Systems, pages 663–698. ISCAS.

  18. Krippahl, L., & Barahona, P. (1999). Applying constraint propagation to protein structure determination, in proceedings of the 5th international conference on principles and practice of constraint programming (CP’99). In Jaffar, J., ed., Lecture Notes in Computer Science, Vol. 1713, pages 289–302. Springer-Verlag.

  19. Larrabee, T. (1992). Test pattern generation using boolean satisfiability. IEEE Trans. Comput.-Aided Des. 11(1): 4–15.

    Article  Google Scholar 

  20. Lee, H. K., & Ha, D. S. (1993). On the Generation of Test Patterns for Combinational Circuits. Technical Report Number 12_93, Department of Electrical Engineering, Virginia Polytechnic Institute and State University.

  21. Lu, F., Wang, L.-C., Cheng, K.-T., & Huang, R. C.-Y. (2003). A circuit SAT solver with signal correlation guided learning. In Proceedings of Design, Automation & Test in Europe, pages 892–897. IEEE.

  22. Muth, P. (1976). A nine-valued circuit model for test generation. IEEE Trans. Comput. C–25(6): 630–636.

    Article  MATH  Google Scholar 

  23. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall.

  24. Programming Systems Group of the Swedish Institute of Computer Science (1995). SICStus Prolog User’s Manual. Swedish Institute of Computer Science.

  25. Roth, J. P. (1966). Diagnosis of automata failures: a calculus and a method, IBM. J. Res. Dev. 10(4): 278–291.

    MATH  Google Scholar 

  26. Serra, M. (1997). Digital IC testing: an introduction. In Dorf, R. C., ed., Electrical Engineering Handbook. CRC Press.

  27. Silva, J. P. M., & Sakallah, K. A. (1997). Robust search algorithms for test pattern generation. In Proceedings of the Fault-tolerant Computing Symposium, pages 152–161. IEEE.

  28. Simonis, H. (1989). Test generation using the constraint logic programming language CHIP. In 6th International Conference on Logic Programming, pages 101–112. MIT Press.

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, CENTRIA, FCT/UNL, 2829-516, Caparica, Portugal

    Francisco Azevedo

Authors
  1. Francisco Azevedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francisco Azevedo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Azevedo, F. Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic. Constraints 12, 507–538 (2007). https://doi.org/10.1007/s10601-007-9025-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-007-9025-9

Keywords

Search

Navigation