Author:
Lomuscio Alessio,Qu Hongyang,Raimondi Franco
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;R. Alur,1998
2. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)
3. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1990)
4. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), 65–75 (1988)
5. Clarke, E., Lu, Y., Jha, S., Veith, H.: Tree-like counterexamples in model checking. In: the 17
th
IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (2002)
Cited by
163 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献