메뉴 건너뛰기




Volumn 16, Issue 5, 1997, Pages 448-457

Symbolic FSM traversais based on the transition relation

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DECISION THEORY; FINITE AUTOMATA;

EID: 0031143141     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.631208     Document Type: Article
Times cited : (6)

References (35)
  • 3
    • 0027835827 scopus 로고    scopus 로고
    • "Exploiting cofactoring for efficient FSM symbolic traversal based on the transition relation," in 93, Oct. 1993, pp. 299-303.
    • G. Cabodi and P. Camurati, "Exploiting cofactoring for efficient FSM symbolic traversal based on the transition relation," in Proc. IEEE ICCD'93, Oct. 1993, pp. 299-303.
    • Proc. IEEE ICCD'
    • Cabodi, G.1    Camurati, P.2
  • 4
    • 0025555497 scopus 로고    scopus 로고
    • "The FSM network model for behavioral synthesis of controldominated machines," in 90, June 1990, pp. 692-697.
    • W. Wolf, "The FSM network model for behavioral synthesis of controldominated machines," in Proc. ACM/IEEE DAC'90, June 1990, pp. 692-697.
    • Proc. ACM/IEEE DAC'
    • Wolf, W.1
  • 5
    • 33747471835 scopus 로고    scopus 로고
    • "A computational theory and implementation of sequential hardware equivalence," in vol. 3, 1991, pp. 293-320.
    • C. Pixley, "A computational theory and implementation of sequential hardware equivalence," in AMS/DIMACS Ser. Discrete Math, and Theoretical Comput. Sci., vol. 3, 1991, pp. 293-320.
    • AMS/DIMACS Ser. Discrete Math, and Theoretical Comput. Sci.
    • Pixley, C.1
  • 6
    • 0027087881 scopus 로고    scopus 로고
    • "Calculating resetability and reset sequences," in 91, Nov. 1991, pp. 376-379.
    • C. Pixley and G. Beihl, "Calculating resetability and reset sequences," in Proc. IEEEICCAD'91, Nov. 1991, pp. 376-379.
    • Proc. IEEEICCAD'
    • Pixley, C.1    Beihl, G.2
  • 7
    • 0027002399 scopus 로고    scopus 로고
    • "Exact calculation of synchronization sequences based on binary decision diagrams," in 92, June 1992, pp. 614-619.
    • C. Pixley, S.-W. Jeong, and G. D. Hachtel, "Exact calculation of synchronization sequences based on binary decision diagrams," in Proc. ACM/IEEE DAC'92, June 1992, pp. 614-619.
    • Proc. ACM/IEEE DAC'
    • Pixley, C.1    Jeong, S.-W.2    Hachtel, G.D.3
  • 8
    • 0025566514 scopus 로고    scopus 로고
    • "Sequential circuit verification using symbolic model checking," in 27: ACM/IEEE Design Automation Conf., Orlando, FL, June 1990, pp. 46-51.
    • J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill, "Sequential circuit verification using symbolic model checking," in DAC27: ACM/IEEE Design Automation Conf., Orlando, FL, June 1990, pp. 46-51.
    • DAC
    • Burch, J.R.1    Clarke, E.M.2    McMillan, K.L.3    Dill, D.L.4
  • 9
    • 33747517924 scopus 로고    scopus 로고
    • "Fast sequential ATPG based on implicit state enumeration," in 91, Sept. 1991, pp. 67-74.
    • H. Cho, G. D. Hachtel, and F. Somenzi, "Fast sequential ATPG based on implicit state enumeration," in Proc. IEEE ITC'91, Sept. 1991, pp. 67-74.
    • Proc. IEEE ITC'
    • Cho, H.1    Hachtel, G.D.2    Somenzi, F.3
  • 10
    • 0027543380 scopus 로고    scopus 로고
    • "Synchronization sequences and symbolic traversal techniques in test generation," vol. 4, pp. 19-31, Feb. 1993.
    • H. Cho, S.-W. Jeong, F. Somenzi, and C. Pixley, "Synchronization sequences and symbolic traversal techniques in test generation," JETTA, vol. 4, pp. 19-31, Feb. 1993.
    • JETTA
    • Cho, H.1    Jeong, S.-W.2    Somenzi, F.3    Pixley, C.4
  • 11
    • 0027632531 scopus 로고    scopus 로고
    • "Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration," vol. 12, pp. 935-945, July 1993.
    • H. Cho, G.cD. Hachtel, and F. Somenzi, "Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration," IEEE Trans. Computer-Aided Design, vol. 12, pp. 935-945, July 1993.
    • IEEE Trans. Computer-Aided Design
    • Cho, H.1    Hachtel, G.C.2    Somenzi, F.3
  • 12
    • 0027542373 scopus 로고    scopus 로고
    • "An approach to sequential circuit diagnosis based on formal verification techniques," vol. 4, pp. 11-17, Feb. 1993.
    • G. Cabodi, P. Camurati, F. Corno, P. Prinetto, and M. Sonza Reorda, "An approach to sequential circuit diagnosis based on formal verification techniques," JETTA, vol. 4, pp. 11-17, Feb. 1993.
    • JETTA
    • Cabodi, G.1    Camurati, P.2    Corno, F.3    Prinetto, P.4    Sonza Reorda, M.5
  • 13
    • 0026133277 scopus 로고    scopus 로고
    • "An efficient verifier for finite state machines," vol. 10, pp. 326-334, Mar. 1991.
    • S. H. Hwang and A. R. Newton, "An efficient verifier for finite state machines," IEEE Trans. Computer-Aided Design, vol. 10, pp. 326-334, Mar. 1991.
    • IEEE Trans. Computer-Aided Design
    • Hwang, S.H.1    Newton, A.R.2
  • 14
    • 84856140605 scopus 로고    scopus 로고
    • "Verification of sequential machines based on symbolic execution," in 407. Springer-Verlag, 1989, pp. 365-373.
    • O. Coudert, C. Berthet, and J. C. Madre, "Verification of sequential machines based on symbolic execution," in Lecture Notes in Computer Science 407. Springer-Verlag, 1989, pp. 365-373.
    • Lecture Notes in Computer Science
    • Coudert, O.1    Berthet, C.2    Madre, J.C.3
  • 15
  • 17
    • 33747471468 scopus 로고    scopus 로고
    • "Verifying temporal properties of sequential machines without building the state diagrams," in 90, June 1990, pp. 75-84.
    • O. Coudert and J. C. Madre, "Verifying temporal properties of sequential machines without building the state diagrams," in Proc. CAV'90, June 1990, pp. 75-84.
    • Proc. CAV'
    • Coudert, O.1    Madre, J.C.2
  • 18
    • 33747518684 scopus 로고    scopus 로고
    • "A method for symbolic verification of synchronous circuits," in 91, Apr. 1991, pp. 229-239.
    • T. Filkorn, "A method for symbolic verification of synchronous circuits," in Proc. IFIP CHDL'91, Apr. 1991, pp. 229-239.
    • Proc. IFIP CHDL'
    • Filkorn, T.1
  • 19
    • 33747452052 scopus 로고    scopus 로고
    • "The backward walk approach in FSM verification," in 93, Apr. 1993, pp. 143-150.
    • S. Krischer, "The backward walk approach in FSM verification," in Proc. IFIP CHDL'93, Apr. 1993, pp. 143-150.
    • Proc. IFIP CHDL'
    • Krischer, S.1
  • 20
    • 0017523387 scopus 로고    scopus 로고
    • "An approach to unified methodology of combinational switching circuits," 26, pp. 745-756, Aug. 1986.
    • E. Cerny and M. A. Marin, "An approach to unified methodology of combinational switching circuits," IEEE Trans. Comput., vol. C26, pp. 745-756, Aug. 1986.
    • IEEE Trans. Comput., Vol. C
    • Cerny, E.1    Marin, M.A.2
  • 21
    • 0022769976 scopus 로고    scopus 로고
    • "Graph-based algorithms for Boolean function manipulation," 35, pp. 677-691, Aug. 1986.
    • R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., vol. C35, pp. 677-691, Aug. 1986.
    • IEEE Trans. Comput., Vol. C
    • Bryant, R.E.1
  • 22
    • 0025558645 scopus 로고    scopus 로고
    • "Efficient implementation of a BDD package," in 90, June 1990, pp. 40-45.
    • K. S. Brace, R. L. Rudell, and R. E. Bryant, "Efficient implementation of a BDD package," in Proc. ACM/IEEE DAC'90, June 1990, pp. 40-45.
    • Proc. ACM/IEEE DAC'
    • Brace, K.S.1    Rudell, R.L.2    Bryant, R.E.3
  • 23
    • 0026913667 scopus 로고    scopus 로고
    • "Symbolic Boolean manipulation with ordered binarydecision diagrams," vol. 24, pp. 293-318, Sept. 1992.
    • R. E. Bryant, "Symbolic Boolean manipulation with ordered binarydecision diagrams," ACM Computing Surveys, vol. 24, pp. 293-318, Sept. 1992.
    • ACM Computing Surveys
    • Bryant, R.E.1
  • 24
    • 0025556059 scopus 로고    scopus 로고
    • "A unified framework for the formal verification of sequential circuits" in 90, Nov. 1990, pp. 126-129.
    • O. Coudert and J. C. Madre, "A unified framework for the formal verification of sequential circuits" in Proc. IEEE ICCAD '90, Nov. 1990, pp. 126-129.
    • Proc. IEEE ICCAD '
    • Coudert, O.1    Madre, J.C.2
  • 25
    • 33747451716 scopus 로고    scopus 로고
    • Symbolic computation of the valid states of the sequential machine: Algorithms and discussion," in 1991 Int. Workshop Formal Methods in VLSI Design, Jan. 1991.
    • Symbolic computation of the valid states of the sequential machine: Algorithms and discussion," in Proc. 1991 Int. Workshop Formal Methods in VLSI Design, Jan. 1991.
    • Proc.
  • 26
    • 0026174710 scopus 로고    scopus 로고
    • "Representing circuits more efficiently in symbolic model checking," in 91, June 1991, pp. 403-407.
    • J. R. Burch, E. M. Clarke, and D. E. Long, "Representing circuits more efficiently in symbolic model checking," in Proc. ACM/IEEE DAC'91, June 1991, pp. 403-407.
    • Proc. ACM/IEEE DAC'
    • Burch, J.R.1    Clarke, E.M.2    Long, D.E.3
  • 29
    • 84968448732 scopus 로고    scopus 로고
    • "Efficient model checking by automated ordering of transition relation partitions," in 94, June 1994, pp. 299-310.
    • D. Geist and I. Beer, "Efficient model checking by automated ordering of transition relation partitions," in Proc. CAV'94, June 1994, pp. 299-310.
    • Proc. CAV'
    • Geist, D.1    Beer, I.2
  • 30
    • 33747506942 scopus 로고    scopus 로고
    • "Efficient BDD algorithms for FSM synthesis and verification," presented in IWLS' 95, May 1995, poster presentation.
    • R. K. Ranjan, A. Aziz, R. K. Brayton, B. Plessier, and C. Pixley, "Efficient BDD algorithms for FSM synthesis and verification," presented in IWLS'95, May 1995, poster presentation.
    • Ranjan, R.K.1    Aziz, A.2    Brayton, R.K.3    Plessier, B.4    Pixley, C.5
  • 31
    • 33747508911 scopus 로고    scopus 로고
    • "CUDD: CU decision diagram package-Release 1.0.4," Tech. Rep., Dep. Elect. Comput. Eng., Univ. Colorado, Boulder, Nov. 1995.
    • F. Somenzi, "CUDD: CU decision diagram package-Release 1.0.4," Tech. Rep., Dep. Elect. Comput. Eng., Univ. Colorado, Boulder, Nov. 1995.
    • Somenzi, F.1
  • 32
    • 0024913805 scopus 로고    scopus 로고
    • "Combinatorial profiles of sequential benchmark circuits," in 89, May 1989, pp. 1929-1934.
    • F. Brglez, D. Bryan, and K. Kozmiriski, "Combinatorial profiles of sequential benchmark circuits," in Proc. IEEE ISCAS'89, May 1989, pp. 1929-1934.
    • Proc. IEEE ISCAS'
    • Brglez, F.1    Bryan, D.2    Kozmiriski, K.3
  • 33
    • 33747517624 scopus 로고    scopus 로고
    • MCNC private communication.
    • MCNC private communication.
  • 34
    • 33747466063 scopus 로고    scopus 로고
    • "Logic synthesis and optimization benchmarks user guide version 3.0," MCNC Rep., Research Triangle Park, NC, Jan. 1991.
    • S. Yang, "Logic synthesis and optimization benchmarks user guide version 3.0," MCNC Rep., Research Triangle Park, NC, Jan. 1991.
    • Yang, S.1
  • 35
    • 33747468286 scopus 로고    scopus 로고
    • "Approximate finite state machine traversal: Extensions and new results," 95, Lake Tahoe, CA, May 1995.
    • H. Cho, G. D. Hachtel, E. Macii, M. Poncino, K. Ravi, and F. Somenzi, "Approximate finite state machine traversal: Extensions and new results," presented at IWLS95, Lake Tahoe, CA, May 1995.
    • Presented at IWLS
    • Cho, H.1    Hachtel, G.D.2    Macii, E.3    Poncino, M.4    Ravi, K.5    Somenzi, F.6


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.