Author:
Caires Luís,Lozes Etienne
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. S. Basu, R. Pollack, M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, in: IEEE Symp. on Foundations of Computer Science, 1994.
2. L. Caires, Behavioral and spatial properties in a logic for the Pi-calculus, in: Igor Walukiwicz, (Ed.), Proc. Foundations of Software Science and Computation Structures’ 2004, Lecture Notes in Computer Science, vol. 2987, Springer, Berlin, 2004.
3. L. Caires, L. Cardelli, A spatial logic for concurrency (part II), in: CONCUR 2002 (13th International Conference), Lecture Notes in Computer Science, vol. 2421, Springer, Berlin, 2002.
4. A spatial logic for concurrency (part I);Caires;Inform. and Comput.,2003
5. C. Calcagno, L. Cardelli, A.D. Gordon, Deciding validity in a spatial logic of trees, in: ACM Workshop on Types in Language Design and Implementation, New Orleans, USA, 2003, ACM Press, New York, pp. 62–73.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献