Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Bourdoncle F., Efficient chaotic iteration strategies with widenings, in: Proceedings of the International Conference on Formal Methods in Programming and their Applications, Lecture Notes in Computer Science 735 (1993), pp. 128–141.
2. Charlier, B. L. and P. V. Hentenryck, A universal top-down fixpoint algorithm, Technical Report CS-92-25, Brown University, Providence, Rhode Island (1992).
3. Chen L.-L. and W. L. Harrison, An efficient approach to computing fixpoints for complex program analysis, in: Proceedings of the 8th ACM International Conference on Supercomputing (1994), pp. 98–106.
4. Efficient computation of fixpoints that arise in complex program analysis;Chen;Journal of Programming Languages,1995
5. Clack C. and S. L. Peyton Jones, Strictness analysis–-a practical approach, in: J.-P. Jouannaud, editor, Proceedings of the Second International Conference on Functional Programming and Computer Architecture, number 201 in Lecture Notes in Computer Science (1985), pp. 35–49.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献