Efficient Debugging in a Formal Verification Environment-Reference-Cited by-同舟云学术

Efficient Debugging in a Formal Verification Environment

Published:2001 Issue: Volume: Page:275-292
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Copty Fady,Irron Amitai,Weissberg Osnat,Kropp Nathan,Gila Kamhi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44798-9_23

Reference12 articles.

1. R. Bryant, “Graph-based Algorithms for Boolean Function Manipulations”,, IEEE Transactions on Computers, C-35:677–691, August 1986.

2. K.L. McMillan. “Symbolic Model Checking”, Kluwer Academics, 1993.

3. K. Ravi, F. Somenzi, “Efficient Fixpoint Computation for Invariant Checking”, In Proceedings of ICCD’9, pp. 467–474.

4. R. Fraer, G. Kamhi, L. Fix, M. Vardi. “Evaluating Semi-Exhaustive Verification Techniques for Bug-Hunting” in Proceedings of SMC’99.

5. R. Fraer, G. Kamhi, B. Ziv, M. Vardi, L. Fix. “Prioritized Traversal: Efficient Reachability Computation for Verification and Falsification”, in Proceedings of CAV’00,Chicago,IL.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Visualization of Checking Results for Graphical Validation Rules;Communications in Computer and Information Science;2015

2. Graded-CTL: Satisfiability and Symbolic Model Checking;Formal Methods and Software Engineering;2009

3. Explaining Counterexamples Using Causality;Computer Aided Verification;2009

4. CTL Model-Checking with Graded Quantifiers;Automated Technology for Verification and Analysis;2008

5. A Framework for Counterexample Generation and Exploration;Fundamental Approaches to Software Engineering;2005