Disjunctive image computation for embedded software verification

Proceedings -Design, Automation and Test in Europe, DATE

Volumn 1, Issue , 2006, Pages

  Wang, Chao ^a   Yang, Zijiang ^b   Ivančić, Franjo ^a   Gupta, Aarti ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SOFTWARE; EMBEDDED SYSTEMS; GRAPH THEORY;

EMBEDDED SOFTWARE VERIFICATION; FINITE STATE MODELS; HYPERGRAPH PARTITIONING; IMAGE COMPUTATION ALGORITHM;

IMAGE PROCESSING;

EID: 34047121643     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994.
2. T. Ball and S. K. Rajamani. Bebop: A symboloc model checker for Boolean programs. In Proc. of the SPIN Workshop (SPIN'00), pages 113-130. LNCS 1885.
3. R. K. Ranjan, A. Aziz, R. K. Brayton, B. F. Plessier, and C. Fixley. Efficient BDD algorithms for FSM synthesis and verification. Presented at IWLS95, May 1995.
4. I.-H. Moon, G. D. Hachtel, and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In Formal Methods in Computer Aided Design, pages 73-90. LNCS 1954.
5. C. Wang, G. D. Hachtel, and F. Somenzi. The compositional far side of image computation. In Proc. of Int. Conf. CAD(ICCAD'03), pages 334-340.
6. R. K. Brayton et al. VIS: A system for verification and synthesis. In Computer Aided Verification (CAV'96), pages 428-432. LNCS 1102.
7. J. R. Burch, E. M. Clarke, and D. E. Long. Representing circuits more efficiently in symbolic model checking. In Proc. of Design Automation Conference (DAC'91), pages 403-407.
8. A. Narayan, A. J. Isles, J. Jain, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Reachability analysis using partitioned ROBDDs. In Proc. of Int. Conf. CAD (ICCAD'97), pages 388-393.
9. G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits. In Proc. of Design Automation Conference (DAC'97), pages 728-733.
10. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers, C-35(8):677-691, 1986.
11. S. Edwards, T. Ma, and R. Damiano. Using a hardware model checker to verify software. Presented at Int. Conf. on ASIC, 2001.
12. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167:131-170, 1996.
13. S. Barner and I. Rabinovitz. Efficient symbolic model checking of software using partial disjunctive partitioning. In Correct Hardware Design and Verification Methods (CHARME'03), pages 35-50. LNCS 2860.
14. F. Ivančić, Z. Yang, I. Shlyakhter, M. Ganai, A. Gupta, and P. Ashar. F-SOFT: Software verification platform. In Computer-Aided Verification, pages 301-306, 2005. LNCS 3576.
15. F. Ivančić, I. Shlyakhter, A. Gupta, M. Ganai, V. Kahlon, C. Wang, and Z. Yang. Model checking C program using F-Soft. In Proc. of Int. Conf. on Computer Design, pages 297-308, 2005.
16. H. Cho, G. D. Hachtel, E. Macii, M. Poncino, and F. Somenzi. Automatic state space decomposition for approximate FSM traversal based on circuit analysis. IEEE Trans. on CAD, 15(12):1451-1464, 1996.
17. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. Technical Report 98-019, University of Minnesota, 1998.