Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Lecture Notes in Computer Science;J.M. Couvreur,1999
2. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)
3. Lecture Notes in Computer Science;E.M. Clarke,2003
4. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1(2/3), 275–288 (1992)
5. Lecture Notes in Computer Science;P. Gastin,2004
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A systematic literature review on counterexample explanation;Information and Software Technology;2022-05
2. Optimal Proofs for Linear Temporal Logic on Lasso Words;Automated Technology for Verification and Analysis;2018
3. GPU Accelerated Counterexample Generation in LTL Model Checking;Formal Methods and Software Engineering;2014
4. Fast Debugging of PRISM Models;Automated Technology for Verification and Analysis;2014
5. Simplifying Contract-Violating Traces;Electronic Proceedings in Theoretical Computer Science;2012-09-08