Author:
Nielson Flemming,Nielson Hanne Riis,Seidl Helmut
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. M. Abadi and A.D. Gordon. A Calculus for Cryptographic Protocols-The Spi Calculus. Information and Computation, 148:1–70, January 1999.
2. A. Aiken. Introduction to Set Constraint-Based Program Analysis. Science of Computer Programming (SCP), 35(2):79–111, 1999.
3. D.A. Basin and H. Ganzinger. Complexity Analysis Based on Ordered Resolution. Journal of the ACM, 48(1):70–109, 2001.
4. W. Charatonik and A. Podelski. Set Constraints with Intersection. In 12th Ann. IEEE Symp. on Logic in Computer Science (LICS), 362–372, 1997.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on:
http://www.grappa.univ-lille3.fr/tata
, 1999.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献