Author:
Amadio Roberto M.,Charatonik Witold
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. R. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science (to appear). Also RR 4147, INRIA.
2. R. Amadio, W. Charatonik. On name generation and set-based analysis in the Dolev-Yao model. RR-INRIA 4379, January 2002.
3. R. Amadio, C. Meyssonnier. On the decidability of fragments of the asynchronous π-calculus. Journal of Nordic Computing (to appear). Also RRINRIA 4241.
4. W. Charatonik and A. Podelski. Set constraints with intersection. In Proc. 12th IEEE LICS, 1997.
5. W. Charatonik, A. Podelski, and J.-M. Talbot. Paths vs. trees in set-based program analysis. In Proc. 27th Annual ACM POPL, 2000.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献