{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:39Z","timestamp":1761597039947},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442356"},{"type":"electronic","value":"9783540457893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45789-5_5","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T13:50:10Z","timestamp":1186840210000},"page":"20-35","source":"Crossref","is-referenced-by-count":19,"title":["Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi"],"prefix":"10.1007","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and A.D. Gordon. A Calculus for Cryptographic Protocols-The Spi Calculus. Information and Computation, 148:1\u201370, January 1999.","DOI":"10.1006\/inco.1998.2740"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"A. Aiken. Introduction to Set Constraint-Based Program Analysis. Science of Computer Programming (SCP), 35(2):79\u2013111, 1999.","journal-title":"Science of Computer Programming (SCP)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/363647.363681","volume":"48","author":"D.A. Basin","year":"2001","unstructured":"D.A. Basin and H. Ganzinger. Complexity Analysis Based on Ordered Resolution. Journal of the ACM, 48(1):70\u2013109, 2001.","journal-title":"Journal of the ACM"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"W. Charatonik and A. Podelski. Set Constraints with Intersection. In 12th Ann. IEEE Symp. on Logic in Computer Science (LICS), 362\u2013372, 1997.","DOI":"10.1109\/LICS.1997.614962"},{"key":"5_CR5","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: \n                  http:\/\/www.grappa.univ-lille3.fr\/tata\n                  \n                , 1999."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic Programs as Types of Logic Programs. In 6th Symp. on Logic in Computer Science (LICS), 300\u2013309, 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45744-5_44","volume-title":"First Int. Joint Conference on Automated Reasoning (IJ-CAR)","author":"H. Ganzinger","year":"2001","unstructured":"H. Ganzinger and D.A. McAllester. A New Meta-complexity Theorem for Bottom-Up Logic Programs. In First Int. Joint Conference on Automated Reasoning (IJ-CAR), 514\u2013528. LNCS 2083, 2001."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints. In 5th Ann. IEEE Symp. on Logic in Computer Science (LICS), 42\u201351, 1990.","DOI":"10.1109\/LICS.1990.113732"},{"key":"5_CR9","first-page":"380","volume-title":"Program Flow Analysis: Theory and Applications","author":"N.D. Jones","year":"1981","unstructured":"N.D. Jones and S.S. Muchnick. Complexity of Flow Analysis, Inductive Assertion Synthesis, and a Language due to Dijkstra. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 12, 380\u2013393. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981."},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45022-X_30","volume-title":"27th Int. Coll. on Automata, Languages and Programming (ICALP)","author":"D. Lugiez","year":"2000","unstructured":"D. Lugiez and P. Schnoebelen. Decidable First-Order Transition Logics for PA-Processes. In 27th Int. Coll. on Automata, Languages and Programming (ICALP), 342\u2013353. LNCS 1853, 2000."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/3-540-48294-6_21","volume-title":"6th Static Analysis Symposium (SAS)","author":"D. McAllester","year":"1999","unstructured":"D. McAllester. On the Complexity Analysis of Static Analyses. In 6th Static Analysis Symposium (SAS), 312\u2013329. LNCS 1694, 1999."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"F. Nielson, H. Riis Nielson, and C. L. Hankin. Principles of Program Analysis. Springer, 1999.","DOI":"10.1007\/978-3-662-03811-6"},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-45927-8_18","volume-title":"European Symposium on Programming (ESOP)","author":"F. Nielson","year":"2002","unstructured":"F. Nielson, H. Riis Nielson, and H. Seidl. Automatic Complexity Analysis. In European Symposium on Programming (ESOP), 243\u2013261. LNCS 2305, 2002."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"F. Nielson, H. Riis Nielson, and H. Seidl. Cryptographic Analysis in Cubic Time. In Electronic Notes in Theoretical Computer Science (ENTCS), volume 62. Elsevier Science Publishers, 2002.","DOI":"10.1016\/S1571-0661(04)00316-0"},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-45309-1_17","volume-title":"European Symposium on Programming (ESOP)","author":"F. Nielson","year":"2001","unstructured":"F. Nielson and H. Seidl. Control-Flow Analysis in Cubic Time. In European Symposium on Programming (ESOP), 252\u2013268. LNCS 2028, 2001."},{"key":"5_CR16","unstructured":"F. Nielson and H. Seidl. Succinct Solvers. Tech. Report 01-12, Trier, 2001."},{"key":"5_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/BFb0017466","volume-title":"3rd Int. Conf. on Principles and Practice of Constraint Programming (CP)","author":"L. Pacholski","year":"1997","unstructured":"L. Pacholski and A. Podelski. Set Constraints-a Pearl in Research on Constraints. In Gert Smolka, editor, 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP), volume 1330 of Springer LNCS, 549\u2013561. Springer-Verlag, 1997."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"54","author":"H. Seidl","year":"1994","unstructured":"H. Seidl. Haskell Overloading is DEXPTIME Complete. Information Processing Letters (IPL), 54:57\u201360, 1994.","journal-title":"Information Processing Letters (IPL)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45789-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T08:20:43Z","timestamp":1550737243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45789-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442356","9783540457893"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45789-5_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}