Skip to main content

Coverage Driven Test Generation and Consistency Algorithm

  • Conference paper
  • First Online:
Book cover Declarative Programming and Knowledge Management (INAP 2013, WLP 2013, WFLP 2013)

Abstract

Coverage driven test generation (CDTG) is an essential part of functional verification where the objective is to generate input stimuli that maximize the functional coverage of a design. CDTG techniques analyze coverage results and adapt the stimulus generation process to improve the coverage. One of the important components of CDTG based tools is the constraint solver. The efficiency of the verification process depends on the performance of the solver. The speed of the solver can be increased if inconsistent values can be removed from the domain of input variables. In this paper, we propose a new efficient consistency algorithm called GACCC-op (generalized arc consistency on conjunction of constraints-optimized) which can be used along with the constraint solver of CDTG tools. The experimental results show that the proposed technique helps to reduce the time required for solution generation of CSPs by 19 %.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. http://www.satlib.org. Accessed 16 Sept 2013

  2. Arangú, M., Salido, M.: A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems. Int. J. Appl. Math. Comput. Sci. 21, 733–744 (2011)

    Article  MATH  Google Scholar 

  3. Arangu, M., Salido, M.A., Barber, F.: Ac3-op: an arc-consistency algorithm for arithmetic constraints. In: Proceedings of the 2009 Conference on Artificial Intelligence Research and Development, pp. 293–300 (2009)

    Google Scholar 

  4. Arangú, M., Salido, M.A., Barber, F.: Ac2001-op: an arc-consistency algorithm for constraint satisfaction problems. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds.) IEA/AIE 2010, Part III. LNCS, vol. 6098, pp. 219–228. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Bessière, C.: Arc-consistency and arc-consistency again. In: Artifical Intelligence, pp. 179–190, January 1994

    Google Scholar 

  6. Bessière, C., Freuder, E.C., Regin, J.-C.: Using inference to reduce arc consistency computation. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol. 1, pp. 592–598 (1995)

    Google Scholar 

  7. Bessière, C., Régin, J.-C.: Local consistency on conjunctions of constraints. In: Proceedings of the ECAI’98 Workshop on Non-binary Constraints, pp. 53–59 (1998)

    Google Scholar 

  8. Bessire, C.: Refining the basic constraint propagation algorithm. In: Proceedings IJCAI01, pp. 309–315 (2001)

    Google Scholar 

  9. Bin, E., Emek, R., Shurek, G., Ziv, A.: Using a constraint satisfaction formulation and solution techniques for random test program generation. IBM Syst. J. 41(3), 386–402 (2002)

    Article  Google Scholar 

  10. van Dongen, M.R.C.: \(\rm {AC-3}_{d}\) an efficient arc-consistency algorithm with a low space-complexity. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 755–760. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Fine, S., Ziv, A.: Coverage directed test generation for functional verification using bayesian networks. In: Proceedings of the Design Automation Conference, pp. 286–291, June 2003

    Google Scholar 

  12. Fournier, L., Arbetman, Y., Levinger, M.: Functional verification methodology for microprocessors using the genesys test-program generator. application to the x86 microprocessors family. In: Design, Automation and Test in Europe Conference and Exhibition, pp. 434–441 (1999)

    Google Scholar 

  13. Iyer, M.: Race a word-level atpg-based constraints solver system for smart random simulation. In: International Test Conference, pp. 299–308 (2003)

    Google Scholar 

  14. Mackworth, A.: Consistency in networks of relations. In: Artificial Intelligence, pp. 99–118 (1977)

    Google Scholar 

  15. Moss, A.: Constraint patterns and search procedures for CP-based random test generation. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 86–103. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Roger, M., Thomas, H.: Arc and path consistency revisited. In: Artificial Intelligence, pp. 225–233 (1986)

    Google Scholar 

  17. Van Hentenryck, P., Deville, Y., Teng, C.: A generic arc consistency algorithm and its specializations. Technical report, Providence, RI, USA (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jomu George Mani Paret .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Paret, J.G.M., Ait Mohamed, O. (2014). Coverage Driven Test Generation and Consistency Algorithm. In: Hanus, M., Rocha, R. (eds) Declarative Programming and Knowledge Management. INAP WLP WFLP 2013 2013 2013. Lecture Notes in Computer Science(), vol 8439. Springer, Cham. https://doi.org/10.1007/978-3-319-08909-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08909-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08908-9

  • Online ISBN: 978-3-319-08909-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics