Abstract Interpretation of Prolog Programs
暂无分享，去创建一个
[1] Harald Søndergaard,et al. An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction , 1986, ESOP.
[2] Saumya K. Debray,et al. Automatic Mode Inference for Prolog Programs , 1986, SLP.
[3] Neil D. Jones,et al. Data flow analysis of applicative programs using minimal function graphs , 1986, POPL '86.
[4] Chris Mellish,et al. Some Global Optimizations for a Prolog Compiler , 1985, J. Log. Program..
[5] Alan Mycroft,et al. The Theory and Practice of Transforming Call-by-need into Call-by-value , 1980, Symposium on Programming.
[6] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[7] Sharon Sickel,et al. A Search Technique for Clause Interconnectivity Graphs , 1976, IEEE Transactions on Computers.
[8] Michel Sintzoff,et al. Calculating properties of programs by valuations on specific models , 1972, Proving Assertions About Programs.