{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:18:36Z","timestamp":1725700716464},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327582"},{"type":"electronic","value":"9783642327599"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32759-9_26","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T06:12:30Z","timestamp":1345529550000},"page":"293-307","source":"Crossref","is-referenced-by-count":5,"title":["Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing"],"prefix":"10.1007","author":[{"given":"Yasuhiko","family":"Minamide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Mori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"26_CR2","first-page":"481","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J.\u00a0ACM\u00a011, 481\u2013494 (1964)","journal-title":"J.\u00a0ACM"},{"key":"26_CR3","unstructured":"World Wide\u00a0Web Consortium. HTML5: Editor\u2019s draft 22 (February 2012), \n                  \n                    http:\/\/dev.w3.org\/html5\/spec\/Overview.html"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient Algorithms for Model Checking Pushdown Systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J. Esparza","year":"2003","unstructured":"Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Information and Computation\u00a0186(2), 355\u2013376 (2003)","journal-title":"Information and Computation"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling. J. ACM\u00a014(1), 172\u2013201 (1967)","journal-title":"J. ACM"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(4:14)2008","volume":"4","author":"M. Hague","year":"2008","unstructured":"Hague, M., Ong, C.-H.L.: Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science\u00a04, 1\u201345 (2008)","journal-title":"Logical Methods in Computer Science"},{"key":"26_CR8","unstructured":"html5lib, \n                  \n                    http:\/\/code.google.com\/p\/html5lib\/"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. J. Automated Reasoning (March 2011) (published online)","DOI":"10.1007\/s10817-011-9223-4"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Li, X., Ogawa, M.: Conditional weighted pushdown systems and applications. In: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pp. 141\u2013150 (2010)","DOI":"10.1145\/1706356.1706382"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Minamide, Y.: Static approximation of dynamically generated Web pages. In: Proceedings of the 14th International World Wide Web Conference, pp. 432\u2013441. ACM Press (2005)","DOI":"10.1145\/1060745.1060809"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S. Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives re-examined. J. of Functional Programming\u00a019, 173\u2013190 (2009)","journal-title":"J. of Functional Programming"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11901914_13","volume-title":"Automated Technology for Verification and Analysis","author":"D. Suwimonteerabuth","year":"2006","unstructured":"Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 141\u2013153. Springer, Heidelberg (2006)"},{"key":"26_CR14","unstructured":"Suwimonteerabuth, D.: Reachability in Pushdown Systems: Algorithms and Applications. PhD thesis, Technischen Universit\u00e4t M\u00fcnchen (2009)"},{"key":"26_CR15","unstructured":"Validator.nu. The validator.nu html parser, \n                  \n                    http:\/\/about.validator.nu\/htmlparser\/"}],"container-title":["Lecture Notes in Computer Science","FM 2012: Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32759-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:12:16Z","timestamp":1558300336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32759-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327582","9783642327599"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32759-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}