Author:
Clarke Edmund,Veith Helmut
Publisher
Springer Berlin Heidelberg
Reference59 articles.
1. F. Balarin and A. L. Sangiovanni-Vincentelli. An iterative approach to language containment. In Computer-Aided Verification, 1993.
2. T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing erros in counterexample traces. In Annual ACM Symposium on Principles of Programming Languages, 2003.
3. T. Ball and S. K. Rajamani. Getting abstract explanations of spurious counterexamples in C programs, 2002. Microsoft Technical Report MSR-TR-2002-09.
4. S. Barner, D. Geist, and A. Gringauze. Symbolic localization reducation with reconstruction layering and backtracking. In CAV 2002, volume 2404 of LNCS, pages 65-77, 2002.
5. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Inf., 20:207–226, 1983. Full version of POPL’81 paper.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Differentiating between counterexamples for supporting students’ algorithmic thinking;Asian Journal for Mathematics Education;2022-12
2. Verification Witnesses;ACM Transactions on Software Engineering and Methodology;2022-09-08
3. Witnessing Subsystems for Probabilistic Systems with Low Tree Width;Electronic Proceedings in Theoretical Computer Science;2021-09-17
4. Explicating how students revise their algorithms in response to counterexamples: building on small nuanced gains;International Journal of Mathematical Education in Science and Technology;2020-11-04
5. Winning Strategy Tree Construction for BDD-Based ATL Model Checkers;International Journal of Software Engineering and Knowledge Engineering;2020-04