{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:58:19Z","timestamp":1725494299036},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755951"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75596-8_40","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T14:03:37Z","timestamp":1194098617000},"page":"553-563","source":"Crossref","is-referenced-by-count":1,"title":["Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction"],"prefix":"10.1007","author":[{"given":"Thanyapat","family":"Sakunkonchak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Komatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Dill, D.E.: Model checking and abstraction. In: ACM Transactions on Programming Languages and System TOPLAS, vol.\u00a016 (1994)","DOI":"10.1145\/186025.186051"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Model checking for programming languages using verisoft. In: Proc. of the 24th ACM Symposium on Principles of Programming Languages (1997)","DOI":"10.1145\/263699.263717"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"CAV 1997","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, Springer, Heidelberg (1997)"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45420-9","volume-title":"CAV 2001","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: The SLAM toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, Springer, Heidelberg (2001)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Mujumdar, R., Sutre, G.: Lazy abstraction. In: ACM SIGPLAN-SIGACT Conference on Principles of Programming Languages (2002)","DOI":"10.1145\/503272.503279"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/11564089","volume-title":"TACAS 2005","author":"H. Jain","year":"2005","unstructured":"Jain, H., Ivancic, F., Gupta, A., Ganai, M.K.: Localization and register sharing for predicate abstraction. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, Springer, Heidelberg (2005)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Mujumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL 2004. Proc. of the 31st Annual Symposium on Principles of Programming Languages (2004)","DOI":"10.1145\/964001.964021"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b94220","volume-title":"SPIN 2003","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Mujumdar, R., Sutre, G.: Lazy abstraction. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, Springer, Heidelberg (2003)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"CAV 2000","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, Springer, Heidelberg (2000)"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995. Principles of Programming Languages (1995)","DOI":"10.1145\/199448.199462"},{"key":"40_CR12","unstructured":"Clarke, E.M., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. In: Proceedings of the Model Checking for Dependable Software-Intensive Systems Workshop (2003)"},{"key":"40_CR13","unstructured":"Clarke, E.M., Jain, H., Kroening, D.: Verification of SpecC using predicate abstraction. In: Second ACM-IEEE International Confernece on Formal Methods and Models for Codesign (MEMOCODE 2004) (2004)"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Sakunkonchak, T., Komatsu, S., Fujita, M.: Synchronization verification in system-level design with ILP solvers. In: Third ACM-IEEE International Confernece on Formal Methods and Models for Codesign (MEMOCODE2005) (2005)","DOI":"10.1109\/MEMCOD.2005.1487902"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75596-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:30Z","timestamp":1619519130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75596-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755951"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75596-8_40","relation":{},"subject":[]}}