{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T02:21:32Z","timestamp":1785291692660,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T00:00:00Z","timestamp":1168992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,1,17]]},"DOI":"10.1145\/1190216.1190226","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:41:00Z","timestamp":1175787660000},"page":"47-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":289,"title":["Compositional dynamic test generation"],"prefix":"10.1145","author":[{"given":"Patrice","family":"Godefroid","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1075382.1075387"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/288195.288305"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/998675.999437"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/566172.566191"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7%3C775::AID-SPE309%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_6_1","volume-title":"Model Checking One Million Lines of C Code. In NDSS'04","author":"Chen H.","unstructured":"H. Chen, D. Dean, and D. Wagner. Model Checking One Million Lines of C Code. In NDSS'04."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537328_2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176887.1176925"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062533"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"M. Das S. Lerner and M. Seigle. ESP: Path-Sensitive Program Verification in Polynomial Time. In PLDI'2002. 10.1145\/512529.512538","DOI":"10.1145\/512529.512538"},{"key":"e_1_3_2_1_11_1","first-page":"21","volume-title":"Proceedings of the 2nd Conference on Computer Science and Engineering","author":"Edvardsson J.","year":"1999","unstructured":"J. Edvardsson. A Survey on Automatic Test Data Generation. In Proceedings of the 2nd Conference on Computer Science and Engineering, pages 21--28, Linkoping, October 1999."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11589976_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"P. Godefroid N. Klarlund and K. Sen. DART: Directed Automated Random Testing. In PLDI'2005. 10.1145\/1065010.1065036","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/786768.786970"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"P. Godefroid. Model Checking for Programming Languages using VeriSoft. In POPL'97. 10.1145\/263699.263717","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_1_16_1","volume-title":"BUGS'2005","author":"Godefroid P.","unstructured":"P. Godefroid. The Soundness of Bugs is What Matters (Position Paper). In BUGS'2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"S. Hallem B. Chelf Y. Xie and D. Engler. A System and Language for Building System-Specific Static Analyses. In PLDI'2002. 10.1145\/512529.512539","DOI":"10.1145\/512529.512539"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1990.131379"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/539883"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081750"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007526"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_24"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.7"}],"event":{"name":"POPL07: The 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Nice France","acronym":"POPL07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190226","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1190216.1190226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:42Z","timestamp":1750243662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,17]]},"references-count":25,"alternative-id":["10.1145\/1190216.1190226","10.1145\/1190216"],"URL":"https:\/\/doi.org\/10.1145\/1190216.1190226","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1190215.1190226","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,1,17]]},"assertion":[{"value":"2007-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}