{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:34:58Z","timestamp":1725748498442},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_10","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T07:21:30Z","timestamp":1378970490000},"page":"92-101","source":"Crossref","is-referenced-by-count":2,"title":["Accurate Computation of Sensitizable Paths Using Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Andres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Sauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"International Technology Roadmap For Semiconductors, \n                  \n                    http:\/\/www.itrs.net"},{"key":"10_CR2","unstructured":"Nangate 45nm open cell library, \n                  \n                    http:\/\/www.nangate.com"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., Schaub, T.: Accurate computation of longest sensitizable paths using answer set programming. In: Drechsler, R., Fey, G. (eds.) Sechste GMM\/GI\/ITG-Fachtagung f\u00fcr Zuverl\u00e4ssigkeit und Entwurf, ZuE 2012 (2012)","DOI":"10.1007\/978-3-642-40564-8_10"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"10_CR5","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Chung, J., Xiong, J., Zolotov, V., Abraham, J.: Testability driven statistical path selection. In: 2011 48th ACM\/EDAC\/IEEE Design Automation Conference, DAC, pp. 417\u2013422 (June 2011)","DOI":"10.1145\/2024724.2024822"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Coudert, O.: An efficient algorithm to verify generalized false paths. In: 2010 47th ACM\/IEEE Design Automation Conference, DAC, pp. 188\u2013193 (June 2010)","DOI":"10.1145\/1837274.1837321"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Das, P., Gupta, S.K.: On generating vectors for accurate post-silicon delay characterization. In: 2011 20th Asian Test Symposium, ATS, pp. 251\u2013260 (November 2011)","DOI":"10.1109\/ATS.2011.39"},{"key":"10_CR9","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo, \n                  \n                    http:\/\/potassco.sourceforge.net"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers (2012)","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"10_CR11","unstructured":"Jiang, J., Sauer, M., Czutro, A., Becker, B., Polian, I.: On the optimality of k longest path generation algorithm under memory constraints. In: Design, Automation and Test in Europe, DATE (2012)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Killpack, K., Kashyap, C., Chiprout, E.: Silicon speedpath measurement and feedback into eda flows. In: 44th ACM\/IEEE Design Automation Conference, DAC 2007, pp. 390\u2013395 (June 2007)","DOI":"10.1109\/DAC.2007.375194"},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TCAD.2006.884863","volume":"26","author":"M.M.V. Kumar","year":"2007","unstructured":"Kumar, M.M.V., Tragoudas, S.: High-quality transition fault ATPG for small delay defects. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a026(5), 983\u2013989 (2007)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Maxwell, P.: Adaptive test directions. In: 2010 15th IEEE European Test Symposium, ETS, pp. 12\u201316 (May 2010)","DOI":"10.1109\/ETSYM.2010.5512789"},{"key":"10_CR15","unstructured":"Qiu, W., Walker, D.M.H.: An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit. In: Proceedings of the International Test Conference, ITC 2003, September 30-October 2, vol.\u00a01, pp. 592\u2013601 (2003)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Sauer, M., Czutro, A., Schubert, T., Hillebrecht, S., Polian, I., Becker, B.: SAT-based analysis of sensitisable paths. In: 2011 IEEE 14th International Symposium on Design and Diagnostics of Electronic Circuits Systems, DDECS, pp. 93\u201398 (April 2011)","DOI":"10.1109\/DDECS.2011.5783055"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Sauer, M., Jiang, J., Czutro, A., Polian, I., Becker, B.: Efficient SAT-based search for longest sensitisable paths. In: 2011 20th Asian Test Symposium, ATS, pp. 108\u2013113 (November 2011)","DOI":"10.1109\/ATS.2011.43"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T02:06:28Z","timestamp":1558058788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}