Minimal Assignments for Bounded Model Checking-Reference-Cited by-同舟云学术

Minimal Assignments for Bounded Model Checking

Published:2004 Issue: Volume: Page:31-45
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Ravi Kavita,Somenzi Fabio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24730-2_3

Reference15 articles.

1. Lecture Notes in Computer Science;A. Biere,1999

2. Brayton, R.K., et al.: VIS:Asystem for verification and synthesis. Technical Report UCB/ERL M95/104, Electronics Research Lab, Univ. of California (December 1995)

3. Brayton, R.K., Somenzi, F.: An exact minimizer for Boolean relations. In: Proceedings of the IEEE International Conference on Computer Aided Design, Santa Clara, CA, November 1989, pp. 316–319 (1989)

4. Lecture Notes in Computer Science;E. Clarke,2002

5. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)

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

1. Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-04

2. Counting bugs in behavioural models using counterexample analysis;Proceedings of the IEEE/ACM 10th International Conference on Formal Methods in Software Engineering;2022-05-18

3. A systematic literature review on counterexample explanation;Information and Software Technology;2022-05

4. The Systematic Design of Responsibility Analysis by Abstract Interpretation;ACM Transactions on Programming Languages and Systems;2022-03-31

5. Making PROGRESS in Property Directed Reachability;Lecture Notes in Computer Science;2022