메뉴 건너뛰기




Volumn , Issue , 2004, Pages 272-281

Saturation NOW

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; QUALITY ASSURANCE; VIRTUAL REALITY;

EID: 16244365506     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/qest.2004.1348041     Document Type: Conference Paper
Times cited : (16)

References (22)
  • 2
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Aug.
    • R. E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Trans. Comp., vol. 35, pp. 677-691, Aug. 1986.
    • (1986) IEEE Trans. Comp. , vol.35 , pp. 677-691
    • Bryant, R.E.1
  • 3
    • 0027795477 scopus 로고
    • Breadth-first manipulation of very large binary-decision diagrams
    • IEEE Comp. Soc. Press
    • H. Ochi, Y. Kouichi, and S. Yajima, "Breadth-first manipulation of very large binary-decision diagrams," in ICCAD, pp. 48-55, IEEE Comp. Soc. Press, 1993.
    • (1993) ICCAD , pp. 48-55
    • Ochi, H.1    Kouichi, Y.2    Yajima, S.3
  • 4
    • 84903156410 scopus 로고    scopus 로고
    • Saturation: An efficient iteration strategy for symbolic state space generation
    • LNCS 2031, Springer, Apr.
    • G. Ciardo, G. Luettgen, and R. Siminiceanu, "Saturation: An efficient iteration strategy for symbolic state space generation," in TACAS, LNCS 2031, pp. 328-342, Springer, Apr. 2001.
    • (2001) TACAS , pp. 328-342
    • Ciardo, G.1    Luettgen, G.2    Siminiceanu, R.3
  • 5
    • 0003347456 scopus 로고
    • Symbolic model checking with partitioned transition relations
    • IFIP Transactions, North-Holland, Aug.
    • J.R. Burch, E.M. Clarke, and D.E. Long, "Symbolic model checking with partitioned transition relations," in Int. Conference on Very Large Scale Integration, pp. 49-58, IFIP Transactions, North-Holland, Aug. 1991.
    • (1991) Int. Conference on Very Large Scale Integration , pp. 49-58
    • Burch, J.R.1    Clarke, E.M.2    Long, D.E.3
  • 6
    • 35248894348 scopus 로고    scopus 로고
    • Saturation unbound
    • LNCS 2619, Springer, Apr.
    • G. Ciardo, R. Marmorstein, and R. Siminiceanu, "Saturation unbound," in TACAS, LNCS 2619, pp. 379-393, Springer, Apr. 2003.
    • (2003) TACAS , pp. 379-393
    • Ciardo, G.1    Marmorstein, R.2    Siminiceanu, R.3
  • 7
    • 0000800371 scopus 로고    scopus 로고
    • Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models
    • P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper, "Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models," INFORMS J. Comp., vol. 12, no. 3, pp. 203-222, 2000.
    • (2000) INFORMS J. Comp. , vol.12 , Issue.3 , pp. 203-222
    • Buchholz, P.1    Ciardo, G.2    Donatelli, S.3    Kemper, P.4
  • 8
    • 84947211257 scopus 로고    scopus 로고
    • Efficient symbolic state-space construction for asynchronous systems
    • LNCS 1825, Springer, June
    • G. Ciardo, G. Luettgen, and R. Siminiceanu, "Efficient symbolic state-space construction for asynchronous systems," in ICATPN, LNCS 1825, pp. 103-122, Springer, June 2000.
    • (2000) ICATPN , pp. 103-122
    • Ciardo, G.1    Luettgen, G.2    Siminiceanu, R.3
  • 9
    • 84958976289 scopus 로고    scopus 로고
    • Efficient reachability set generation and storage using decision diagrams
    • LNCS 1639, Springer, June
    • A. S. Miner and G. Ciardo, "Efficient reachability set generation and storage using decision diagrams," in ICATPN, LNCS 1639, pp. 6-25, Springer, June 1999.
    • (1999) ICATPN , pp. 6-25
    • Miner, A.S.1    Ciardo, G.2
  • 10
    • 84948133311 scopus 로고    scopus 로고
    • Using edge-valued decision diagrams for symbolic generation of shortest paths
    • LNCS 2517, Springer, Nov.
    • G. Ciardo and R. Siminiceanu, "Using edge-valued decision diagrams for symbolic generation of shortest paths," in FMCAD, LNCS 2517, pp. 256-273, Springer, Nov. 2002.
    • (2002) FMCAD , pp. 256-273
    • Ciardo, G.1    Siminiceanu, R.2
  • 11
    • 35248883986 scopus 로고    scopus 로고
    • Structural symbolic CTL model checking of asynchronous systems
    • LNCS 2725, Springer, July
    • G. Ciardo and R. Siminiceanu, "Structural symbolic CTL model checking of asynchronous systems," in CAV, LNCS 2725, pp. 40-53, Springer, July 2003.
    • (2003) CAV , pp. 40-53
    • Ciardo, G.1    Siminiceanu, R.2
  • 12
    • 84994842734 scopus 로고
    • Petri net analysis using boolean manipulation
    • LNCS 815, Springer, June
    • E. Pastor, O. Roig, J. Cortadella, and R. Badia, "Petri net analysis using boolean manipulation," in ICATPN, LNCS 815, pp. 416-435, Springer, June 1994.
    • (1994) ICATPN , pp. 416-435
    • Pastor, E.1    Roig, O.2    Cortadella, J.3    Badia, R.4
  • 13
    • 0009617613 scopus 로고    scopus 로고
    • Compositional minimisation of finite state systems using interface specifications
    • S. Graf, B. Steffen, and G. Lüttgen, "Compositional minimisation of finite state systems using interface specifications," Formal Asp. of Comp., vol. 8, no. 5, pp. 607-616, 1996.
    • (1996) Formal Asp. of Comp. , vol.8 , Issue.5 , pp. 607-616
    • Graf, S.1    Steffen, B.2    Lüttgen, G.3
  • 14
    • 84947425596 scopus 로고    scopus 로고
    • Parallelizing the Murphy verifier
    • LNCS 1254, Springer
    • U. Stern and D. L. Dill, "Parallelizing the Murphy verifier," in CAV, LNCS 1254, pp. 256-267, Springer, 1997.
    • (1997) CAV , pp. 256-267
    • Stern, U.1    Dill, D.L.2
  • 15
    • 0031574534 scopus 로고    scopus 로고
    • Automated parallelization of discrete state-space generation
    • D. Nicol and G. Ciardo, "Automated parallelization of discrete state-space generation," J. Par. and Distr. Comp., vol. 47, pp. 153-167, 1997.
    • (1997) J. Par. and Distr. Comp. , vol.47 , pp. 153-167
    • Nicol, D.1    Ciardo, G.2
  • 16
    • 0025486860 scopus 로고
    • A parallel algorithm for constructing binary decision diagrams
    • IEEE Comp. Soc. Press
    • S. Kimura and E. M. Clarke, "A parallel algorithm for constructing binary decision diagrams," in ICCD, pp. 220-223, IEEE Comp. Soc. Press, 1990.
    • (1990) ICCD , pp. 220-223
    • Kimura, S.1    Clarke, E.M.2
  • 17
    • 0028015172 scopus 로고
    • Parallel implementation of BDD algorithms using a distributed shared memory
    • IEEE Comp. Soc. Press
    • Y. Parasuram, E. Stabler, and S.-K. Chin, "Parallel implementation of BDD algorithms using a distributed shared memory," in The Hawaii International Conference on System Sciences, vol. 1, pp. 16-25, IEEE Comp. Soc. Press, 1994.
    • (1994) The Hawaii International Conference on System Sciences , vol.1 , pp. 16-25
    • Parasuram, Y.1    Stabler, E.2    Chin, S.-K.3
  • 18
    • 0029720349 scopus 로고    scopus 로고
    • Implementation of an efficient parallel BDD package
    • ACM Press
    • T. Stornetta and F. Brewer, "Implementation of an efficient parallel BDD package," in DAC, pp. 641-644, ACM Press, 1996.
    • (1996) DAC , pp. 641-644
    • Stornetta, T.1    Brewer, F.2
  • 19
    • 84948959324 scopus 로고    scopus 로고
    • BDDNOW: A parallel BDD package
    • LNCS 1522, Springer
    • K. Milvang-Jensen and A. J. Hu, "BDDNOW: A parallel BDD package," in FMCAD, LNCS 1522, pp. 501-507, Springer, 1998.
    • (1998) FMCAD , pp. 501-507
    • Milvang-Jensen, K.1    Hu, A.J.2
  • 20
    • 35248869318 scopus 로고    scopus 로고
    • A work-efficient distributed algorithm for reachability analysis
    • LNCS 2725, Springer
    • O. Grumberg, T. Heyman, and A. Schuster, "A work-efficient distributed algorithm for reachability analysis," in CAV, LNCS 2725, pp. 54-66, Springer, 2003.
    • (2003) CAV , pp. 54-66
    • Grumberg, O.1    Heyman, T.2    Schuster, A.3
  • 21
    • 0030421678 scopus 로고    scopus 로고
    • Binary decision diagrams on network of workstations
    • IEEE Comp. Soc. Press, Oct.
    • R. K. Ranjan, J. V. Snaghavi, R. K. Brayton, and A. Sangiovanni- Vincentelli, "Binary decision diagrams on network of workstations)," in Proc. ICCD, pp. 358-364, IEEE Comp. Soc. Press, Oct. 1996.
    • (1996) Proc. ICCD , pp. 358-364
    • Ranjan, R.K.1    Snaghavi, J.V.2    Brayton, R.K.3    Sangiovanni-Vincentelli, A.4
  • 22
    • 0031338901 scopus 로고    scopus 로고
    • Reachability analysis using Partitioned-ROBDDs
    • ACM and IEEE Comp. Soc. Press
    • A. Narayan, A. J. Isles, J. Jain, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Reachability analysis using Partitioned-ROBDDs, " in ICCAD, pp. 388-393, ACM and IEEE Comp. Soc. Press, 1997.
    • (1997) ICCAD , pp. 388-393
    • Narayan, A.1    Isles, A.J.2    Jain, J.3    Brayton, R.K.4    Sangiovanni-Vincentelli, A.5


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