Author:
Bernholtz Orna,Vardi Moshe Y.,Wolper Pierre
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. on Database Systems, 5:241–259, 1980.
2. O. Bernholtz and O. Grumberg. Branching time temporal logic and amorphous tree automata. In Proc. 4th Conferance on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 262–277, Hildesheim, August 1993. Springer-Verlag.
3. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.
4. R. Cleaveland. A linear-time model-checking algorithm for the alternation-free modal Μ-calculus. Formal Methods in System Design, 2:121–147, 1993.
5. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275–288, 1992.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Justifications and a Reconstruction of Parity Game Solving Algorithms;Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems;2023
2. Verifying concurrent probabilistic systems using probabilistic-epistemic logic specifications;Applied Intelligence;2016-04-27
3. On the Weak Index Problem for Game Automata;Logic, Language, Information, and Computation;2015
4. A Faster Tableau for CTL*;Electronic Proceedings in Theoretical Computer Science;2013-07-16
5. Temporal property verification as a program analysis task;Formal Methods in System Design;2012-04-27