A SAT-based algorithm for reparameterization in symbolic simulation

Proceedings - Design Automation Conference

Volumn , Issue , 2004, Pages 524-529

  Chauhan, Pankaj ^a   Clarke, Edmund M ^a   Kroening, Daniel ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Bounded Model Checking; Parametric Representation; Safety Property Checking; SAT checkers; Symbolic Simulation

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SIMULATION; PARAMETER ESTIMATION; SET THEORY; VECTORS;

BOUNDED MODEL CHECKING; PARAMETRIC REPRESENTATION; SAFETY PROPERTY CHECKING; SAT CHECKERS; SYMBOLIC SIMULATION;

CIRCUIT THEORY;

EID: 4444250081     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996566.996711     Document Type: Conference Paper

References (12)

1. M. D. Aagaard, R. B. Jones, and C.-J. H. Seger. Formal verification using parametric representations of boolean constraints. In Proceedings of Design Automation Conference (DAC'99), pages 402-407. ACM Press, June 1999.
2. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proceedings of the Design Automation Conference (DAC'99), pages 317-320, 1999.
3. P. Chauhan, E. M. Clarke, and D. Kroening. Using SAT based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University, School of Computer Science, 2003.
4. P. Chauhan, E. M. Clarke, S. Sapra, J. Kukula, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Proceedings of FMCAD'02, volume 2517 of LNCS, pages 33-50, November 2002.
5. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
6. O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In Proc. Intl. Conf. on Computer-Aided Design (ICCAD), pages 78-82. IEEE Computer Society Press, November 1990.
7. A. Goel and R. E. Bryant. Set manipulation with boolean functional vectors for symbolic reachability analysis. In Proceedings of Design Automation and Test in Europe (DATE'03), pages 10816-10821, 2003.
8. D. Kroening and O. Strichman. Efficient computation of recurrence diameters. In L. Zuck, P. Attie, A. Cortesi, and S. Mukhopadhyay, editors, 4th International Conference on Verification, Model Checking, and Abstract Interpretation, volume 2575 of Lecture Notes in Computer Science, pages 298-309. Springer Verlag, January 2003.
9. K. L. McMillan. Interpolation and SAT-based model checking. In F. Somenzi and W. Hunt, editors, Conference on Computer Aided Verification (CAV 2003), volume 2725 of Lecture Notes in Computer Science, pages 1-13. Springer, July 2003.
10. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In H. Garavel and J. Hatcliff, editors, Tools and Algorithms for the Construction and Analysis of Systems, 9th International Conference (TACAS 2003), volume 2619 of Lecture Notes in Computer Science, pages 2-17. Springer, 2003.
11. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference (DAC'01), pages 530-535, 2001.
12. J. Yang and C.-J. H. Seger. Generalized symbolic trajectory evaluation - abstraction in action. In Proceedings of FMCAD'02, volume 2517 of LNCS, pages 70-86, 2002.