Author:
Codish Michael,Falaschi Moreno,Marriott Kim,Winsborough William
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. S.D. Brookes and A.W. Roscoe. Deadlock Analysis in Networks of Communicating Processes. Distributed Computing, 4:209–230, 1991.
2. K.M. Chandy and J. Misra. Deadlock Absence Proofs for Networks of Communicating Processes. Information Proc. Letters, 9(4):185, 1979.
3. M. Codish, M. Falaschi, and K. Marriott. Suspension Analyses for Concurrent Logic Programs. ACM Transactions on Programming Languages and Systems, 1993. To appear.
4. C. Codognet, P. Codognet, and M. Corsini. Abstract Interpretation for Concurrent Logic Languages. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 215–232. The MIT Press, Cambridge, Mass., 1990.
5. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238–252, 1977.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CONTINUATION COMPILATION FOR CONCURRENT LOGIC PROGRAMMING;Artificial Intelligence in Real-Time Control 1994;1995
2. The notion of floundering for SLDNF-resolution revisited;Programming Languages: Implementations, Logics and Programs;1995
3. Domain independent ask approximation in CCP;Principles and Practice of Constraint Programming — CP '95;1995
4. Guarded constructive disjunction: Angel or demon?;Principles and Practice of Constraint Programming — CP '95;1995
5. A confluent calculus for concurrent constraint programming with guarded choice;Principles and Practice of Constraint Programming — CP '95;1995