Author:
Harel David,Kozen Dexter,Tiuryn Jerzy
Reference281 articles.
1. K. Abrahamson. Decidability and expressiveness of logics of processes. PhD thesis, Univ. of Washington, 1980.
2. S. I. Adian. The Burnside Problem and Identities in Groups. Springer-Verlag, 1979.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1975.
4. S. Ambler, M. Kwiatkowska, and N. Measor. Duality and the completeness of the modal μ-calculus. Theor. Comput. Sci., 151(1):3–27, November 1995.
5. H. Andréka, I. Németi, and I. Sain. A complete logic for reasoning about programs via nonstandard model theory, part I. Theor. Comput. Sci., 17:193–212, 1982.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Abstract Look at Awareness Models and Their Dynamics;Electronic Proceedings in Theoretical Computer Science;2023-07-11
2. PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Combining rule- and SMT-based reasoning for verifying floating-point Java programs in KeY;International Journal on Software Tools for Technology Transfer;2023-03-08
4. Modal Logic, an Introduction;Synthese Library;2023
5. Rigidity;Synthese Library;2023