{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:03:59Z","timestamp":1749269039562,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Electronic Testing"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1023\/a:1008224716789","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"217-238","source":"Crossref","is-referenced-by-count":0,"title":["Techniques for Reducing the Number of Decisions and Backtracks in Combinational Test Generation"],"prefix":"10.1007","volume":"12","author":[{"given":"Zohair","family":"Sahraoui","sequence":"first","affiliation":[]},{"given":"Francky","family":"Catthoor","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Six","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"de Man","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"168022_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","volume":"C-30","author":"P. Goel","year":"1981","unstructured":"P. Goel, \u201cAn Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits,\u201d IEEE Trans. on Computers, Vol. C-30, No. 3, pp. 215\u2013222, March 1981.","journal-title":"IEEE Trans. on Computers"},{"issue":"12","key":"168022_CR2","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1109\/TC.1983.1676174","volume":"C-32","author":"H. Fujiwara","year":"1983","unstructured":"H. Fujiwara and T. Shimono, \u201cOn the Acceleration of Test Generation Algorithms,\u201d IEEE Trans. on Computers, Vol. C-32, No. 12, pp. 1137\u20131144, Dec. 1983.","journal-title":"IEEE Trans. on Computers"},{"issue":"4","key":"168022_CR3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/43.275361","volume":"13","author":"H. Cox","year":"1994","unstructured":"H. Cox and J. Rajski, \u201cOn Necessary and Non-conflicting Assignments in Algorithmic Test Pattern Generation,\u201d IEEE Trans. on Computer-Aided Design, Vol. 13, No. 4, pp. 515\u2013530, April 1994.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"168022_CR4","volume-title":"Digital Systems Testing and Testable Design","author":"M. Abramovici","year":"1995","unstructured":"M. Abramovici, M.A. Breuer, and A.D. Friedman, Digital Systems Testing and Testable Design, IEEE Press, Piscataway, New Jersey, 1995."},{"key":"168022_CR5","doi-asserted-by":"crossref","unstructured":"S. Kundu, L.M. Huisman, I. Nair, V. Iyengar, and L.N. Reddy, \u201cA Small Test Generator for Large Designs,\u201d Proc. of the Int. Test Conf., Sept. 1992, pp. 30\u201340.","DOI":"10.1109\/TEST.1992.527801"},{"key":"168022_CR6","doi-asserted-by":"crossref","unstructured":"M. Teramoto, \u201cA Method for Reducing the Search Space in Test Pattern Generation,\u201d Proc. of the Int. Test Conf., Oct. 1993, pp. 429\u2013435.","DOI":"10.1109\/TEST.1993.470669"},{"issue":"7","key":"168022_CR7","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/43.31539","volume":"8","author":"M.H. Schulz","year":"1989","unstructured":"M.H. Schulz and E. Auth, \u201cImproved Deterministic Test Pattern Generation with Applications to Redundancy Identification,\u201d IEEE Trans. on Computer-Aided Design, Vol. 8, No. 7, pp. 811\u2013816, July 1989.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"168022_CR8","unstructured":"F. Brglez and H. Fujiwara, \u201cNeutral Netlist ofTen Combinational Benchmark Circuits and a Target Translator in FORTRAN,\u201d Proc. of the Int. Symp. on Circuits and Systems, June 1985, pp. 663\u2013698."},{"issue":"1","key":"168022_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/43.108614","volume":"11","author":"T. Larrabee","year":"1992","unstructured":"T. Larrabee, \u201cTest Generation Using Boolean Satisfiability,\u201d IEEE Trans. on Computer-Aided Design, Vol. 11, No. 1, pp. 4\u201315, Jan. 1992.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"issue":"3","key":"168022_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"B. Aspvall, M. Plass, and R. Tarjan, \u201cA Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas,\u201d Information Processing Letters, Vol. 8, No. 3, pp. 121\u2013123, March 1979.","journal-title":"Information Processing Letters"},{"issue":"7","key":"168022_CR11","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/43.238038","volume":"12","author":"S.T. Chakradhar","year":"1993","unstructured":"S.T. Chakradhar, V.D. Agrawal, and S.G. Rothweiler, \u201cA Transitive Closure Algorithm for Test Generation,\u201d IEEE Trans. on Computer-Aided Design, Vol. 12, No. 7, pp. 1015\u20131028, July 1993.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"issue":"9","key":"168022_CR12","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1109\/43.310903","volume":"13","author":"W. Kunz","year":"1994","unstructured":"W. Kunz and D.K. Pradhan, \u201cRecursive Learning: A New Implication Technique for Efficient Solutions to CAD Problems,\u201d IEEE Trans. on Computer-Aided Design, Vol. 13, No. 9, pp.1143\u20131158, Sept. 1994.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"168022_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-9260(89)90059-X","volume":"7","author":"S.C. Seth","year":"1989","unstructured":"S.C. Seth and V.D. Agrawal, \u201cA New Model for Computation of Probabilistic Testability in Combinational Circuits,\u201d INTEGRATION, the VLSI Journal, Vol. 7, pp. 49\u201375, July 1989.","journal-title":"INTEGRATION, the VLSI Journal"},{"issue":"6","key":"168022_CR14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"S.B. Akers","year":"1978","unstructured":"S.B. Akers, \u201cBinary Decision Diagrams,\u201d IEEE Trans. on Computers, Vol. C-27, No. 6, pp. 509\u2013516, June 1978.","journal-title":"IEEE Trans. on Computers"},{"issue":"8","key":"168022_CR15","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant, \u201cGraph Based Algorithms for Boolean Function Manipulation,\u201d IEEE Trans. on Computers, Vol. C-35, No. 8, pp. 677\u2013691, Aug. 1986.","journal-title":"IEEE Trans. on Computers"},{"issue":"6","key":"168022_CR16","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TC.1976.1674662","volume":"C-25","author":"S.B. Akers","year":"1976","unstructured":"S.B. Akers, \u201cA Logic System for Fault Test Generation,\u201d IEEE Trans. on Computers, Vol. C-25, No. 6, pp. 620\u2013630, June 1976.","journal-title":"IEEE Trans. on Computers"},{"issue":"1","key":"168022_CR17","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/T-C.1975.224083","volume":"C-24","author":"C.T. Ku","year":"1975","unstructured":"C.T. Ku and G.M. Masson, \u201cThe Boolean Difference and Multiple Fault Analysis,\u201d IEEE Trans. on Computers, Vol. C-24, No. 1, pp. 62\u201371, Jan. 1975.","journal-title":"IEEE Trans. on Computers"},{"issue":"7","key":"168022_CR18","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TC.1968.227417","volume":"C-17","author":"F.F. Sellers","year":"1968","unstructured":"F.F. Sellers, M.Y. Hsiao, and L.W. Bearnson, \u201cAnalyzing Errors with the Boolean Difference,\u201d IEEE Trans. on Computers, Vol. C-17, No. 7, pp. 676\u2013683, July 1968.","journal-title":"IEEE Trans. on Computers"},{"key":"168022_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","volume-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"R.K. Brayton","year":"1984","unstructured":"R.K. Brayton, G. Hachtel, C. McMullen, and A.L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Boston, 1984."},{"key":"168022_CR20","doi-asserted-by":"crossref","unstructured":"R.P. Jacobi and A.M Trullemans, \u201cGenerating Prime and Irredundant Covers for Binary Decision Diagrams,\u201d Proc. of the European Design Automation Conf., March 1992, pp. 104\u2013108.","DOI":"10.1109\/EDAC.1992.205903"},{"key":"168022_CR21","unstructured":"S. Minato, \u201cFast Generation of Irredundant Sum-of-Products Forms from Binary Decision Diagrams,\u201d Proc. of the Synthesis and Simulation Meeting and International Interchange. SASIMI'92\/, 1992, pp. 64\u201373."},{"issue":"12","key":"168022_CR22","first-page":"20","volume":"6","author":"J.A. Waicukauski","year":"1985","unstructured":"J.A. Waicukauski, E.B. Eichelberger, D.O. Forlenza, E. Lindbloom, and T. McCarthy, \u201cFast Simulation for Structured VLSI,\u201d VLSI Systems Design, Vol. 6, No. 12, pp. 20\u201332, Dec. 1985.","journal-title":"VLSI Systems Design"},{"key":"168022_CR23","doi-asserted-by":"crossref","unstructured":"H.B. Min and W.A. Rogers, \u201cSearch Strategy Switching: An Alternative to Increased Backtracking,\u201d Proc. of the Int. Test Conf., Sept. 1989, pp. 803\u2013811.","DOI":"10.1109\/TEST.1989.82369"},{"key":"168022_CR24","doi-asserted-by":"crossref","unstructured":"F. Brglez, D. Bryan, and K. Kozminski, \u201cCombinational Profiles of Sequential Benchmark Circuits,\u201d Proc. of the Int. Symp. on Circuits and Systems, May 1989, pp. 1929\u20131934.","DOI":"10.1109\/ISCAS.1989.100747"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008224716789.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008224716789\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008224716789.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T10:11:36Z","timestamp":1749204696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008224716789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["168022"],"URL":"https:\/\/doi.org\/10.1023\/a:1008224716789","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}