{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:24:11Z","timestamp":1743103451180,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466803"},{"type":"electronic","value":"9783662466810"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46681-0_24","type":"book-chapter","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T22:56:36Z","timestamp":1427756196000},"page":"289-303","source":"Crossref","is-referenced-by-count":0,"title":["Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Bransen","sequence":"first","affiliation":[]},{"given":"L. Thomas","family":"van Binsbergen","sequence":"additional","affiliation":[]},{"given":"Koen","family":"Claessen","sequence":"additional","affiliation":[]},{"given":"Atze","family":"Dijkstra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2678015.2682543","volume-title":"Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, PEPM 2015","author":"L.T. Binsbergen van","year":"2015","unstructured":"van Binsbergen, L.T., Bransen, J., Dijkstra, A.: Linearly ordered attribute grammars: With automatic augmenting dependency selection. In: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, PEPM 2015, pp. 49\u201360. ACM, New York (2015)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"R.S. Bird","year":"1984","unstructured":"Bird, R.S.: Using circular programs to eliminate multiple traversals of data. Acta Informatica\u00a021, 239\u2013250 (1984)","journal-title":"Acta Informatica"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-27694-1_14","volume-title":"Practical Aspects of Declarative Languages","author":"J. Bransen","year":"2012","unstructured":"Bransen, J., Middelkoop, A., Dijkstra, A., Swierstra, S.D.: The Kennedy-Warren algorithm revisited: Ordering attribute grammars. In: Russo, C., Zhou, N.-F. (eds.) PADL 2012. LNCS, vol.\u00a07149, pp. 183\u2013197. Springer, Heidelberg (2012)"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/566385.566390","volume":"3","author":"R.E. Bryant","year":"2002","unstructured":"Bryant, R.E., Velev, M.N.: Boolean satisfiability with transitivity constraints. ACM Trans. Comput. Logic\u00a03(4), 604\u2013627 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10626-009-0081-8","volume":"19","author":"K. Claessen","year":"2009","unstructured":"Claessen, K., Een, N., Sheeran, M., S\u00f6rensson, N., Voronov, A., \u00c5kesson, K.: Sat-solving in practice. Discrete Event Dynamic Systems\u00a019(4), 495\u2013524 (2009)","journal-title":"Discrete Event Dynamic Systems"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-17511-4_10","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Codish","year":"2010","unstructured":"Codish, M., Zazon-Ivry, M.: Pairwise cardinality networks. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 154\u2013172. Springer, Heidelberg (2010)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971)"},{"key":"24_CR8","first-page":"93","volume-title":"Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell, Haskell 2009","author":"A. Dijkstra","year":"2009","unstructured":"Dijkstra, A., Fokker, J., Swierstra, S.D.: The architecture of the Utrecht Haskell Compiler. In: Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell, Haskell 2009, pp. 93\u2013104. ACM, New York (2009)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg\u00a025, 71\u201376 (1961)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"24_CR10","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":"24_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1297027.1297029","volume-title":"Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems and Applications, OOPSLA 2007","author":"T. Ekman","year":"2007","unstructured":"Ekman, T., Hedin, G.: The JastAdd extensible Java compiler. In: Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems and Applications, OOPSLA 2007, pp. 1\u201318. ACM, New York (2007)"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0022-0000(82)90030-7","volume":"24","author":"J. Engelfriet","year":"1982","unstructured":"Engelfriet, J., Fil\u00e8, G.: Simple multi-visit attribute grammars. Journal of Computer and System Sciences\u00a024(3), 283\u2013314 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR13","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/871895.871902","volume-title":"Proceedings of the 2003 ACM SIGPLAN Workshop on Haskell, Haskell 2003","author":"B. Heeren","year":"2003","unstructured":"Heeren, B., Leijen, D., van IJzendoorn, A.: Helium, for learning haskell. In: Proceedings of the 2003 ACM SIGPLAN Workshop on Haskell, Haskell 2003, pp. 62\u201371. ACM, New York (2003)"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00288644","volume":"13","author":"U. Kastens","year":"1980","unstructured":"Kastens, U.: Ordered attributed grammars. Acta Informatica\u00a013(3), 229\u2013256 (1980)","journal-title":"Acta Informatica"},{"key":"24_CR15","first-page":"32","volume-title":"Proceedings of the 3rd ACM SIGACT-SIGPLAN Symposium on Principles on Programming Languages, POPL 1976","author":"K. Kennedy","year":"1976","unstructured":"Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. In: Proceedings of the 3rd ACM SIGACT-SIGPLAN Symposium on Principles on Programming Languages, POPL 1976, pp. 32\u201349. ACM, New York (1976)"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: Semantics of context-free languages. Mathematical Systems Theory\u00a02(2), 127\u2013145 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-34407-7_1","volume-title":"Implementation and Application of Functional Languages","author":"A. Middelkoop","year":"2012","unstructured":"Middelkoop, A., Elyasov, A.B., Prasetya, W.: Functional instrumentation of actionscript programs with asil. In: Gill, A., Hage, J. (eds.) IFL 2011. LNCS, vol.\u00a07257, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"24_CR18","unstructured":"Saraiva, J.: Purely Functional Implementation of Attribute Grammars: Zuiver Functionele Implementatie Van Attributengrammatica\u2019s. IPA dissertation series. IPA (1999)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/10704973_4","volume-title":"Advanced Functional Programming","author":"S.D. Swierstra","year":"1999","unstructured":"Swierstra, S.D., Alcocer, P.R.A.: Designing and implementing combinator languages. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 150\u2013206. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46681-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T01:21:58Z","timestamp":1651627318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46681-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466803","9783662466810"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46681-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}