A Generalized Semantics for Constraint Logic Programs
暂无分享,去创建一个
[1] Roberto Barbuti,et al. A general framework for semantics-based bottom-up abstract interpretation of logic programs , 1993, TOPL.
[2] Roberto Barbuti,et al. Modelling Prolog control , 1992, POPL '92.
[3] A. Cortesi,et al. Prop revisited: propositional formula as abstract domain for groundness analysis , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[4] D. Scott. Domains for Denotational Semantics , 1982, ICALP.
[5] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.
[6] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.