{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T21:54:50Z","timestamp":1673301290127},"reference-count":31,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.129.7","type":"journal-article","created":{"date-parts":[[2013,9,8]],"date-time":"2013-09-08T09:10:39Z","timestamp":1378631439000},"page":"84-104","source":"Crossref","is-referenced-by-count":3,"title":["Abstract Interpretation as a Programming Language"],"prefix":"10.4204","volume":"129","author":[{"given":"Mads","family":"Rosendahl","sequence":"first","affiliation":[{"name":"Roskilde University"}]}],"member":"2720","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"conf\/sas\/AltM95","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-60360-3_31","article-title":"Generation of Efficient Interprocedural Analyzers with PAG","volume-title":"SAS","volume":"983","author":"Alt","year":"1995"},{"key":"apt:cha","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-63165-8_163","article-title":"From Chaotic Iteration to Constraint Propagation.","volume-title":"ICALP","volume":"1256","author":"Apt","year":"1997"},{"key":"Bagnara07","article-title":"On the Design of Generic Static Analyzers for Modern Imperative Languages","volume":"abs\/cs\/0703116","author":"Bagnara","year":"2007","journal-title":"CoRR"},{"key":"bird:circ","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00264249","article-title":"Using Circular Programs to Eliminate Multiple Traversals of Data.","volume":"21","author":"Bird","year":"1984","journal-title":"Acta Inf."},{"issue":"3","key":"bha:hos","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness Analysis for Higher-Order Functions.","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Program."},{"key":"lch:genfix","first-page":"229","article-title":"On the Design of Generic Abstract Interpretation Frameworks.","volume-title":"WSA","author":"Charlier","year":"1992"},{"key":"cc:77","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","article-title":"Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.","volume-title":"POPL","author":"Cousot","year":"1977"},{"key":"cc:77c","first-page":"237","article-title":"Static determination of dynamic properties of recursive procedures","volume-title":"Formal Description of Programming Concepts","author":"Cousot","year":"1978"},{"key":"conf\/esop\/CousotCFMMMR05","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","article-title":"The ASTRE\u00c9 Analyzer.","volume-title":"ESOP","volume":"3444","author":"Cousot","year":"2005"},{"key":"f:agfix","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/12276.13320","article-title":"Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars.","volume-title":"SIGPLAN Symposium on Compiler Construction","author":"Farrow","year":"1986"},{"key":"fs:evenfast","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-61739-6_42","article-title":"An Even Faster Solver for General Systems of Equations.","volume-title":"SAS","volume":"1145","author":"Fecht","year":"1996"},{"issue":"5","key":"FokkerS09","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.entcs.2009.09.044","article-title":"Abstract Interpretation of Functional Programs using an Attribute Grammar System.","volume":"238","author":"Fokker","year":"2009","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"B335","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/BF03037167","article-title":"The Derivation of an Algorithm for Program Specialisation.","volume-title":"ICLP","author":"Gallagher","year":"1990"},{"key":"lazytype","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(95)00012-7","article-title":"Lazy Type Inference and Program Analysis","volume":"25","author":"Hankin","year":"1995","journal-title":"Sci. Comput. Program."},{"key":"B66","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-16446-4_7","article-title":"Strictness detection in non-flat domains.","volume-title":"Programs as Data Objects","volume":"217","author":"Hughes","year":"1985"},{"issue":"1","key":"hh:front","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1017\/S0956796800000071","article-title":"Fixed Points and Frontiers: A New Perspective.","volume":"1","author":"Hunt","year":"1991","journal-title":"J. Funct. Program."},{"key":"jhr:esah","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-58485-4_51","article-title":"Efficient Strictness Analysis of Haskell.","volume-title":"SAS","author":"Jensen","year":"1994"},{"key":"jm:mfg","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/512644.512672","article-title":"Data Flow Analysis of Applicative Programs Using Minimal Function Graphs.","volume-title":"POPL","author":"Jones","year":"1986"},{"key":"jr:hmfg","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-58431-5_17","article-title":"Higher-Order Minimal Function Graphs","volume-title":"Algebraic and Logic Programming, ALP'94","volume":"850","author":"Jones","year":"1994"},{"key":"D140","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-10250-7_19","article-title":"Compiler generation from denotational semantics.","volume-title":"Semantics-Directed Compiler Generation","volume":"94","author":"Jones","year":"1980"},{"key":"nj:need","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-58485-4_50","article-title":"Finding Fixpoints in Finite Function Spaces Using Neededness Analysis and Chaotic Iteration.","volume-title":"SAS","author":"J\u00f8rgensen","year":"1994"},{"key":"KubiakHL91","first-page":"207","article-title":"Implementing Projection-based Strictness Analysis","volume-title":"Functional Programming","author":"Kubiak","year":"1991"},{"key":"mh:finlat","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-18317-5_23","article-title":"Finding fixed points in finite lattices.","volume-title":"FPCA","volume":"274","author":"Martin","year":"1987"},{"key":"B104","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-09981-6_19","article-title":"The Theory and Practice of Transforming Call-by-need into Call-by-value.","volume-title":"Symposium on Programming","volume":"83","author":"Mycroft","year":"1980"},{"key":"mr:mfg","first-page":"60","article-title":"Minimal Function Graphs are not Instrumented.","volume-title":"WSA","author":"Mycroft","year":"1992"},{"key":"mr:phd","volume-title":"Abstract Interpretation and Attribute Grammars","author":"Rosendahl","year":"1992"},{"key":"mr:hcfi","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-57186-8_89","article-title":"Higher-Order Chaotic Iteration Sequences.","volume-title":"PLILP","volume":"714","author":"Rosendahl","year":"1993"},{"key":"libag-g579","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/75277.75281","article-title":"Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.","volume-title":"POPL","author":"Sagiv","year":"1989"},{"issue":"2","key":"B161","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/3318.3323","article-title":"Detecting Global Variables in Denotational Specifications.","volume":"7","author":"Schmidt","year":"1985","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"ds:ds","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"Schmidt","year":"1986"},{"key":"B306","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T01:40:10Z","timestamp":1379900410000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1309.5133v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":31,"URL":"https:\/\/doi.org\/10.4204\/eptcs.129.7","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]}}}