Martin Alt & Florian Martin (1995):
Generation of Efficient Interprocedural Analyzers with PAG.
In: SAS,
LNCS 983.
Springer,
pp. 33–50,
doi:10.1007/3-540-60360-3_31.
Krzysztof R. Apt (1997):
From Chaotic Iteration to Constraint Propagation..
In: ICALP,
LNCS 1256.
Springer,
pp. 36–55,
doi:10.1007/3-540-63165-8_163.
Roberto Bagnara, Patricia M. Hill, Andrea Pescetti & Enea Zaffanella (2007):
On the Design of Generic Static Analyzers for Modern Imperative Languages.
CoRR abs/cs/0703116.
Available at http://arxiv.org/abs/cs/0703116.
Richard S. Bird (1984):
Using Circular Programs to Eliminate Multiple Traversals of Data..
Acta Inf. 21,
pp. 239–250,
doi:10.1007/BF00264249.
Geoffrey L. Burn, Chris Hankin & Samson Abramsky (1986):
Strictness Analysis for Higher-Order Functions..
Sci. Comput. Program. 7(3),
pp. 249–278,
doi:10.1016/0167-6423(86)90010-9.
Baudouin Le Charlier & Pascal Van Hentenryck (1992):
On the Design of Generic Abstract Interpretation Frameworks..
In: WSA,
pp. 229–246.
Patrick Cousot & Radhia Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints..
In: POPL.
ACM,
pp. 238–252,
doi:10.1145/512950.512973.
Patrick Cousot & Radhia Cousot (1978):
Static determination of dynamic properties of recursive procedures.
In: Formal Description of Programming Concepts.
North-Holland,
pp. 237–277.
Available at http://www.di.ens.fr/~cousot/COUSOTpapers/IFIP77.shtml.
Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux & Xavier Rival (2005):
The ASTREÉ Analyzer..
In: ESOP,
LNCS 3444.
Springer,
pp. 21–30,
doi:10.1007/978-3-540-31987-0_3.
Alan Dix (1988):
Finding Fixed Points in Non-Trivial Domains: Proofs of Pending Analysis and Related Algorithms.
Technical Report 107.
Univ. of York.
Available at http://alandix.com/academic/papers/fixpts-YCS107-88/.
Rodney Farrow (1986):
Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars..
In: SIGPLAN Symposium on Compiler Construction.
ACM,
pp. 85–98,
doi:10.1145/12276.13320.
Christian Fecht & Helmut Seidl (1996):
An Even Faster Solver for General Systems of Equations..
In: SAS,
LNCS 1145.
Springer,
pp. 189–204,
doi:10.1007/3-540-61739-6_42.
Jeroen Fokker & S. Doaitse Swierstra (2009):
Abstract Interpretation of Functional Programs using an Attribute Grammar System..
Electr. Notes Theor. Comput. Sci. 238(5),
pp. 117–133,
doi:10.1016/j.entcs.2009.09.044.
John P. Gallagher & Maurice Bruynooghe (1990):
The Derivation of an Algorithm for Program Specialisation..
In: ICLP,
pp. 732–746,
doi:10.1007/BF03037167.
Chris Hankin & Daniel Le Métayer (1995):
Lazy Type Inference and Program Analysis.
Sci. Comput. Program. 25(2-3),
pp. 219–249,
doi:10.1016/0167-6423(95)00012-7.
John Hughes (1985):
Strictness detection in non-flat domains..
In: Programs as Data Objects,
LNCS 217.
Springer,
pp. 112–135,
doi:10.1007/3-540-16446-4_7.
Sebastian Hunt & Chris Hankin (1991):
Fixed Points and Frontiers: A New Perspective..
J. Funct. Program. 1(1),
pp. 91–120,
doi:10.1017/S0956796800000071.
Kristian Damm Jensen, Peter Hjæresen & Mads Rosendahl (1994):
Efficient Strictness Analysis of Haskell..
In: SAS,
pp. 246–362,
doi:10.1007/3-540-58485-4_51.
Neil D. Jones & Alan Mycroft (1986):
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs..
In: POPL.
ACM Press,
pp. 296–306,
doi:10.1145/512644.512672.
Neil D. Jones & Mads Rosendahl (1994):
Higher-Order Minimal Function Graphs.
In: Algebraic and Logic Programming, ALP'94,
LNCS 850.
Springer,
pp. 242–252,
doi:10.1007/3-540-58431-5_17.
Neil D. Jones & David A. Schmidt (1980):
Compiler generation from denotational semantics..
In: Semantics-Directed Compiler Generation,
LNCS 94.
Springer,
pp. 70–93,
doi:10.1007/3-540-10250-7_19.
Niels Jørgensen (1994):
Finding Fixpoints in Finite Function Spaces Using Neededness Analysis and Chaotic Iteration..
In: SAS.
Springer,
pp. 329–345,
doi:10.1007/3-540-58485-4_50.
Ryszard Kubiak, John Hughes & John Launchbury (1991):
Implementing Projection-based Strictness Analysis.
In: Functional Programming,
pp. 207–224.
Chris Martin & Chris Hankin (1987):
Finding fixed points in finite lattices..
In: FPCA,
LNCS 274.
Springer,
pp. 426–445,
doi:10.1007/3-540-18317-5_23.
Alan Mycroft (1980):
The Theory and Practice of Transforming Call-by-need into Call-by-value..
In: Symposium on Programming,
LNCS 83.
Springer,
pp. 269–281,
doi:10.1007/3-540-09981-6_19.
Sergei A. Romanenko, Claudio Russo & Peter Sestoft (2000):
Moscow ML Language Overview.
Technical Report.
Russian Academy of Science, Moscow.
Available at http://www.itu.dk/people/sestoft/mosml/manual.pdf.
Shmuel Sagiv, O. Edelstein, Nissim Francez & Michael Rodeh (1989):
Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis..
In: POPL.
ACM Press,
pp. 36–48,
doi:10.1145/75277.75281.
David A. Schmidt (1985):
Detecting Global Variables in Denotational Specifications..
ACM Trans. Program. Lang. Syst. 7(2),
pp. 299–310,
doi:10.1145/3318.3323.
eptcs@eptcs.org