Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains
暂无分享,去创建一个
Antoine Rauzy | Kaninda Musumbu | Baudouin Le Charlier | Marc-Michel Corsini | A. Rauzy | B. L. Charlier | K. Musumbu | Marc-Michel Corsini
[1] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[2] Giorgio Levi,et al. Declarative Modeling of the Operational Behavior of Logic Languages , 1989, Theor. Comput. Sci..
[3] Kim Marriott,et al. Notes for a Tutorial on Abstract Interpretation of Logic Programs , 1989 .
[4] Pascal Van Hentenryck,et al. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG , 1992, ACM Trans. Program. Lang. Syst..
[5] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[6] Kim Marriott,et al. Bottom-up Abstract Interpretation of Logic Programs , 1988, ICLP/SLP.
[7] Kim Marriott,et al. Suspension analyses for concurrent logic programs , 1994, TOPL.
[8] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[9] David Maier,et al. Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.
[10] Pascal Van Hentenryck,et al. A Universal Top-Down Fixpoint Algorithm , 1992 .
[11] Ulf Nilsson. Abstract Interpretation: A Kind of Magic , 1991, PLILP.
[12] Pascal Van Hentenryck,et al. A Generic Abstract Interpretation Algorithm and its Complexity Analysis , 1991, ICLP.
[13] 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.
[14] Chris Mellish,et al. Abstract Interpretation of Prolog Programs , 1986, ICLP.
[15] Pascal Van Hentenryck,et al. Groundness analysis for Prolog: implementation and evaluation of domain prop , 1993, PEPM '93.