Author:
Falaschi Moreno,Gabbrielli Maurizio,Marriott Kim,Palamidessi Catuscia
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. T. Armstrong, K. Marriott, P. Schachte and H. Søndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. Proc. Static Analysis Symposium, SAS'94. B. Le Charlier (Ed.), Springer-Verlag, Vol. 864 in LNCS, pages 266–280, 1994.
2. F.S. de Boer, M. Gabbrielli, E. Marchiori and C. Palamidessi. Proving Concurrent Constraint Programs Correct. In Proc. 21st ACM Symp. Principles of Programming Languages, 1994.
3. F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, Proc. of TAPSOFT/CAAP, LNCS 493, pages 296–319. Springer-Verlag, 1991.
4. volume 700 of LNCS;M. Codish,1993
5. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Compositional Analysis for Concurrent Constraint Programming. In Proc. Eighth IEEE Symp. on Logic In Computer Science, pages 210–221. IEEE Computer Society Press, Los Alamitos, California, 1993.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献