{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:51:43Z","timestamp":1759938703106,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1109\/sefm.2007.24","type":"proceedings-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T15:06:17Z","timestamp":1192460777000},"page":"80-92","source":"Crossref","is-referenced-by-count":3,"title":["How to Test Program Generators? A Case Study using flex"],"prefix":"10.1109","author":[{"given":"Prahladavaradan","family":"Sampath","sequence":"first","affiliation":[]},{"given":"A. C.","family":"Rajeev","sequence":"additional","affiliation":[]},{"given":"K. C.","family":"Shashidhar","sequence":"additional","affiliation":[]},{"given":"S.","family":"Ramesh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11506843_23"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:AUSE.0000038938.10589.b9"},{"key":"ref12","first-page":"19","article-title":"Controllable combinatorial coverage in grammar-based testing","author":"l\u00e4mmel","year":"2006","journal-title":"TESTCOM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2005.51"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/52.56422"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349314"},{"article-title":"flex - A fast scanner generator","year":"1995","author":"paxson","key":"ref17"},{"key":"ref18","first-page":"17","article-title":"A structural approach to operational semantics","volume":"60?61","author":"plotkin","year":"2004","journal-title":"J Log Algebr Program"},{"key":"ref19","first-page":"235","article-title":"Translation validation for synchronous languages","author":"pnueli","year":"1998","journal-title":"ICALP"},{"key":"ref4","article-title":"Machine obstructed proof: How many months can it take to verify 30 assembly instructions?","author":"benton","year":"2006","journal-title":"ACM SIGPLAN Workshop on Mechanizing Metatheory"},{"article-title":"Software Testing Techniques","year":"1990","author":"beizer","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/566189.566191"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(97)00017-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190226"},{"key":"ref7","article-title":"Towards testing the implementation of graph transformations","author":"darabos","year":"2006","journal-title":"Proc of the Fifth International Workshop on Graph Transformation and Visual Modelling Techniques ENTCS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_29"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48092-7_10"},{"key":"ref1","first-page":"194","article-title":"Generating test cases for code generators by unfolding graph transformation systems","author":"baldan","year":"2004","journal-title":"ICGT"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48092-7_11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31985-6_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2007.39"},{"journal-title":"The Standard ML Language","year":"0","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1014007.1014017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICFEM.1997.630411"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2003.1240322"}],"event":{"name":"Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)","start":{"date-parts":[[2007,9,10]]},"location":"London, UK","end":{"date-parts":[[2007,9,14]]}},"container-title":["Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4343908\/4343909\/04343926.pdf?arnumber=4343926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T22:28:30Z","timestamp":1489703310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4343926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/sefm.2007.24","relation":{},"subject":[],"published":{"date-parts":[[2007,9]]}}}