The Compositional Far Side of Image Computation

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 334-340

  Wang, Chao ^a   Hachtel, Gary D ^a   Somenzi, Fabio ^a  

^a University of Colorado   (United States)

Author keywords

Binary Decision Diagrams; Image computation; Model checking; Symbolic

Indexed keywords

BINARY DECISION DIAGRAMS; IMAGE COMPUTATIONS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECISION THEORY; INFORMATION ANALYSIS; ITERATIVE METHODS; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS); SYSTEMS ANALYSIS;

IMAGE ANALYSIS;

EID: 0348040122     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV'96), pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
3. J. Burch. Using BDD's to verify multipliers. In 1991 International Workshop on Formal Methods in VLSI Design, Miami, FL, Jan. 1991.
4. P. Chauhan, E. Clarke, S. Jha, J. Kukula, H. Veith, and D. Wang. Using combinatorial optimization methods for quantification scheduling. In T. Margaria and T. F. Melham, editors, Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'01), pages 293-309. Springer-Verlag, Berlin, Sept. 2001. LNCS 2144.
5. P. P. Chauhan, E. M. Clarke, S. Jha, J. Kukula, T. Shiple, H. Veith, and D. Wang. Non-linear quantification scheduling in image computation. In Proceedings of the International Conference on Computer-Aided Design, pages 293-298, San Jose, CA, Nov. 2001.
6. H. Cho, G. D. Hachtel, E. Macii, B. Plessier, and F. Somenzi. Algorithms for approximate FSM traversal based on state space decomposition. In Proceedings of the Design Automation Conference, pages 25-30, Dallas, TX, June 1993.
7. H. Cho and F. Somenzi. Sequential logic optimization based on state space decomposition. In Proceedings of the European Conference on Design Automation, pages 200-204, Paris, France, Feb. 1993.
8. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines based on symbolic execution. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, pages 365-373, Springer-Verlag, 1989. LNCS 407.
9. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using Boolean functional vectors. In L. Claesen, editor, Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Leuven, Belgium, Nov. 1989.
10. O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 126-129, Nov. 1990.
11. D. Geist and I. Beer. Efficient model checking by automated ordering of transition relation partitions. In D. L. Dill, editor, Sixth Conference on Computer Aided Verification (CAV'94), pages 299-310, Berlin, 1994. Springer-Verlag. LNCS 818.
12. S. G. Govindaraju, D. L. Dill, A. J. Hu, and M. A. Horowitz. Approximate reachability with BDDs using overlappping projections. In Proceedings of the Design Automation Conference, pages 451-456, San Francisco, CA, June 1998.
13. R. Hojati, S. C. Krishnan, and R. K. Brayton. Early quantification and partitioned transition relations. In Proceedings of the International Conference on Computer Design, pages 12-19, Austin, TX, Oct. 1996.
14. Y. Hong, P. A. Beerel, L. Lavagno, and E. M. Sentovich. Don't care-based BDD minimization for embedded software. In Proceedings of the Design Automation Conference, pages 506-509, San Francisco, CA, June 1998.
15. Iscas benchmarks. URL: http://www.cbl.ncsu.edu/CBL-_Docs/iscas89.html.
16. H. Jin, A. Kuehlmann, and F. Somenzi. Fine-grain conjunction scheduling for symbolic reachability analysis. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'02), pages 312-326, Grenoble, France, Apr. 2002. LNCS 2280.
17. I.-H. Moon, G. D. Hachtel, and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 73-90. Springer-Verlag, Nov. 2000. LNCS 1954.
18. I.-H. Moon, J.-Y. Jang, G. D. Hachtel, F. Somenzi, C. Pixley, and J. Yuan. Approximate reachability don't cares for CTL model checking. In Proceedings of the International Conference on Computer-Aided Design, pages 351-358, San Jose, CA, Nov. 1998.
19. I.-H. Moon, J. Kukula, T. Shiple, and F. Somenzi. Least fixpoint MBM: Improved technique for approximate reachability. Presented at IWLS99, Lake Tahoe, CA, June 1999.
20. I.-H. Moon, J. H. Kukula, K. Ravi, and F. Somenzi. To split or to conjoin: The question in image computation. In Proceedings of the Design Automation Conference, pages 23-28, Los Angeles, CA, June 2000.
21. R. K. Ranjan, A. Aziz, R. K. Brayton, B. F. Plessier, and C. Pixley. Efficient BDD algorithms for FSM synthesis and verification. Presented at IWLS95, Lake Tahoe, CA, May 1995.
22. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the International Conference on Computer-Aided Design, pages 42-47, Santa Clara, CA, Nov. 1993.
23. T. R. Shiple, R. Hojati, A. L. Sangiovanni-Vincentelli, and R. K. Brayton. Heuristic minimization of BDDs using don't cares. In Proceedings of the Design Automation Conference, pages 225-231, San Diego, CA, June 1994.
24. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit enumeration of finite state machines using BDD's. In Proceedings of the IEEE International Conference on Computer Aided Design, pages 130-133, Nov. 1990.
25. Vis verification benchmarks. URL: http://vlsi.colorado.edu/̃vis.