Journal of the ACM Bibliography

Selected papers that cite this one

• Rajeev Alur, Tomás Feder, and Thomas A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116-146, January 1996.

• Rajeev Alur and Thomas Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35-77, May 1993.

• Jan Chomicki and Damian Niwi\'nski. On the feasibility of checking temporal integrity constraints. Journal of Computer and System Sciences, 51(3):523-535, December 1995.

• E. M. Clarke, O. Grumberg, and R. P. Kurshan. A synthesis of two approaches for verifying finite state concurrent systems. Journal of Logic and Computation, 2(5):605-618, October 1992.

• Costas Courcoubetis and Mihalis Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, July 1995.

• S. Demri and Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases (extended abstract). In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 61-72, Paris France, 25-27 February 1998. Springer.

• Joeri Engelfriet. Minimal temporal epistemic logic. Notre Dame Journal of Formal Logic, 37(2):233-259, Spring 1996.

• Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 228-235, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.

• Kousha Etessami and Thomas Wilke. An Until hierarchy for temporal logic. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 108-117, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• Steven M. German and A. Prasad Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, July 1992.

• Erich Grädel, Phokion G. Kolaitis, and Moshe Y. Vardi. On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic, 3(1):53-69, March 1997.

• Edith Hemaspaandra. The price of universality. Notre Dame Journal of Formal Logic, 37(2):174-203, Spring 1996.

• Orna Kupferman and Orna Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, August 1996.

• Orna Kupferman and Amir Pnueli. Once and For All. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 25-35, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.

• Orna Kupferman, Shmuel Safra, and Moshe Y. Vardi. Relating word and tree automata. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 322-332, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• R. P. Kurshan. The complexity of verification. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 365-371, Montréal, Québec, Canada, 23-25 May 1994.

• Doron Peled, Thomas Wilke, and Pierre Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183-203, 30 March 1998.

• Amir Pnueli and Lenore D. Zuck. Probabilistic verification. Information and Computation, 103(1):1-29, March 1993.

• Y. S. Ramakrishna, P. M. Melliar-Smith, L. E. Moser, L. K. Dillon, and G. Kutty. Interval logics and their decision procedures. Part I: An interval logic. Theoretical Computer Science, 166(1-2):1-47, 20 October 1996. Fundamental study.

• A. Prasad Sistla and Lenore D. Zuck. Reasoning in a restricted temporal logic. Information and Computation, 102(2):167-195, February 1993.

• P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 438-447, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

• Moshe Y. Vardi. On the complexity of modular model checking. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 101-111, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.

• Moshe Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 15 November 1994.

Shortcuts: