{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T22:12:40Z","timestamp":1768428760892,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319089171","type":"print"},{"value":"9783319089188","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_10","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"139-148","source":"Crossref","is-referenced-by-count":6,"title":["Automatic Evaluation of Context-Free Grammars (System Description)"],"prefix":"10.1007","author":[{"given":"Carles","family":"Creus","sequence":"first","affiliation":[]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Agarwal, A.: edX (2012), https:\/\/www.edx.org"},{"key":"10_CR2","unstructured":"Alexandrova, S., Balandin, A., Compeau, P., Kladov, A., Rayko, M., Sosa, E., Vyahhi, N., Dvorkin, M.: Rosalind (2012), http:\/\/www.rosalind.info"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-70583-3_34","volume-title":"Automata, Languages and Programming","author":"R. Axelsson","year":"2008","unstructured":"Axelsson, R., Heljanko, K., Lange, M.: Analyzing context-free grammars using an incremental SAT solver. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 410\u2013422. Springer, Heidelberg (2008)"},{"issue":"2-4","key":"10_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a04(2-4), 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22110-1_1","volume-title":"Computer Aided Verification","author":"V. Ganesh","year":"2011","unstructured":"Ganesh, V., Kie\u017cun, A., Artzi, S., Guo, P.J., Hooimeijer, P., Ernst, M.: HAMPI: A string solver for testing, analysis and vulnerability detection. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 1\u201319. Springer, Heidelberg (2011)"},{"key":"10_CR7","unstructured":"Garc\u00eda, C., Revilla, M.A.: UVa online judge (1997), http:\/\/uva.onlinejudge.org"},{"issue":"1&2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0743-1066(93)90018-C","volume":"15","author":"J.N. Hooker","year":"1993","unstructured":"Hooker, J.N.: Solving the incremental satisfiability problem. Journal of Logic Programming\u00a015(1&2), 177\u2013186 (1993)","journal-title":"Journal of Logic Programming"},{"key":"10_CR9","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley (2006)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Khan, S.: Khan Academy (2006), https:\/\/www.khanacademy.org","DOI":"10.1002\/ejoc.200500603"},{"key":"10_CR11","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. III: Sorting and Searching. Addison-Wesley (1973)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Annual ACM IEEE Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"10_CR13","unstructured":"Ng, A., Koller, D.: Coursera (2012), https:\/\/www.coursera.org"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Petit, J., Gim\u00e9nez, O., Roura, S.: Jutge.org: an educational programming judge. In: ACM Special Interest Group on Computer Science Education, pp. 445\u2013450 (2012)","DOI":"10.1145\/2157136.2157267"},{"key":"10_CR15","unstructured":"Thrun, S., Stavens, D., Sokolsky, M.: Udacity (2012), https:\/\/www.udacity.com"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Whittemore, J., Kim, J., Sakallah, K.A.: SATIRE: A new incremental satisfiability engine. In: Design Automation Conference, pp. 542\u2013545 (2001)","DOI":"10.1145\/378239.379019"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T08:55:22Z","timestamp":1649580922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}