메뉴 건너뛰기




Volumn , Issue , 2007, Pages 173-180

Checking safety by inductive generalization of counterexamples to induction

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TIME; EXPERIMENTAL DATA; FINITE STATE SYSTEMS; HARD PROBLEMS; LARGE CIRCUITS; SAFETY ANALYSIS; SAFETY SPECIFICATIONS; STATE SPACES;

EID: 47349093657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FAMCAD.2007.15     Document Type: Conference Paper
Times cited : (83)

References (21)
  • 2
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
    • ACM Press
    • P. Cousot and R. Cousot, "Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints," in POPL. ACM Press, 1977, pp. 238-252.
    • (1977) POPL , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 3
    • 0000888571 scopus 로고
    • Un theoreme sur les fonctions d'ensembles
    • B. Knaster, "Un theoreme sur les fonctions d'ensembles," Ann. Soc. Polon. Math., vol. 6, pp. 133-134, 1928.
    • (1928) Ann. Soc. Polon. Math , vol.6 , pp. 133-134
    • Knaster, B.1
  • 4
    • 84972541021 scopus 로고
    • A lattice-theoretical fixpoint theorem and its applications
    • A. Tarski, "A lattice-theoretical fixpoint theorem and its applications," Pacific Journal of Mathematics, vol. 5, no. 2, pp. 285-309, 1955.
    • (1955) Pacific Journal of Mathematics , vol.5 , Issue.2 , pp. 285-309
    • Tarski, A.1
  • 5
    • 70350777567 scopus 로고    scopus 로고
    • K. L. McMillan, Applying SAT methods in unbounded symbolic model checking. in CAV, ser. LNCS, 2404. Springer, 2002, pp. 250-264.
    • K. L. McMillan, "Applying SAT methods in unbounded symbolic model checking." in CAV, ser. LNCS, vol. 2404. Springer, 2002, pp. 250-264.
  • 6
    • 27944466840 scopus 로고    scopus 로고
    • Prime clauses for fast enumeration of satisfying assignments to boolean circuits
    • ACM Press
    • H. Jin and F Somenzi, "Prime clauses for fast enumeration of satisfying assignments to boolean circuits," in DAC. ACM Press, 2005.
    • (2005) DAC
    • Jin, H.1    Somenzi, F.2
  • 7
    • 47349107659 scopus 로고    scopus 로고
    • L. de Moura, H. Ruess, and M. Sorea, Bounded model checking and induction: From refutation to verification, in CAV, ser. LNCS. Springer, 2003.
    • L. de Moura, H. Ruess, and M. Sorea, "Bounded model checking and induction: From refutation to verification," in CAV, ser. LNCS. Springer, 2003.
  • 8
    • 34547140905 scopus 로고    scopus 로고
    • Fast illegal state identification for improving SAT-based induction
    • ACM Press
    • V. C. Vimjam and M. S. Hsiao, "Fast illegal state identification for improving SAT-based induction," in DAC. ACM Press, 2006.
    • (2006) DAC
    • Vimjam, V.C.1    Hsiao, M.S.2
  • 9
    • 34547169076 scopus 로고    scopus 로고
    • Automatic invariant strengthening to prove properties in bounded model checking
    • ACM Press
    • M. Awedh and F Somenzi, "Automatic invariant strengthening to prove properties in bounded model checking," in DAC. ACM Press, 2006.
    • (2006) DAC
    • Awedh, M.1    Somenzi, F.2
  • 10
    • 0034852165 scopus 로고    scopus 로고
    • M. W. Moskewicz, C. F Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an Efficient SAT Solver, in DAC, 2001.
    • M. W. Moskewicz, C. F Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in DAC, 2001.
  • 11
    • 35248845558 scopus 로고    scopus 로고
    • Automatic abstraction without counterexamples
    • TACAS, Springer
    • K. L. McMillan and N. Amla, "Automatic abstraction without counterexamples." in TACAS, ser. LNCS, vol. 2619. Springer, 2003, pp. 2-17.
    • (2003) ser. LNCS , vol.2619 , pp. 2-17
    • McMillan, K.L.1    Amla, N.2
  • 12
    • 33745162025 scopus 로고    scopus 로고
    • K. L. McMillan, Interpolation and SAT-based model checking, in CAV, ser. LNCS, 2725. Springer, 2003, pp. 1-13.
    • K. L. McMillan, "Interpolation and SAT-based model checking," in CAV, ser. LNCS, vol. 2725. Springer, 2003, pp. 1-13.
  • 13
    • 24644519059 scopus 로고    scopus 로고
    • Applications of Craig interpolants in model checking
    • TACAS, Springer
    • _, "Applications of Craig interpolants in model checking." in TACAS, ser. LNCS, vol. 3440. Springer, 2005, pp. 1-12.
    • (2005) ser. LNCS , vol.3440 , pp. 1-12
    • McMillan, K.L.1    Amla, N.2
  • 14
    • 47349133963 scopus 로고    scopus 로고
    • VIS, Online, Available
    • VIS. [Online]. Available: http://visi.colorado.edu/~vis
  • 15
    • 84944319371 scopus 로고    scopus 로고
    • Symbolic model checking without BDDs
    • Springer
    • A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in TACAS. Springer, 1999, pp. 193-207.
    • (1999) TACAS , pp. 193-207
    • Biere, A.1    Cimatti, A.2    Clarke, E.M.3    Zhu, Y.4
  • 16
    • 70350787997 scopus 로고    scopus 로고
    • Checking safety properties using induction and a SAT-solver
    • FMCAD, Springer
    • M. Sheeran, S. Singh, and G. Stalmarck, "Checking safety properties using induction and a SAT-solver," in FMCAD, ser. LNCS, vol. 1954. Springer, 2000.
    • (2000) ser. LNCS , vol.1954
    • Sheeran, M.1    Singh, S.2    Stalmarck, G.3
  • 17
    • 47349084559 scopus 로고    scopus 로고
    • R. Armoni, L. Fix, R. Fraer, S. Huddleston, N. Piterman, and M. Vardi, SAT-based induction for temporal safety properties, in BMC, 2004.
    • R. Armoni, L. Fix, R. Fraer, S. Huddleston, N. Piterman, and M. Vardi, "SAT-based induction for temporal safety properties," in BMC, 2004.
  • 18
    • 4243189286 scopus 로고    scopus 로고
    • Counterexample-guided abstraction refinement for symbolic model checking
    • E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, " Counterexample-guided abstraction refinement for symbolic model checking," J. ACM, vol. 50, no. 5, pp. 752-794, 2003.
    • (2003) J. ACM , vol.50 , Issue.5 , pp. 752-794
    • Clarke, E.1    Grumberg, O.2    Jha, S.3    Lu, Y.4    Veith, H.5
  • 19
    • 27944469105 scopus 로고    scopus 로고
    • H. Jain, D. Kroening, N. Sharygina, and E. M. Clarke, Word level predicate abstraction and refinement for verifying RTL verilog. in DAC, 2005.
    • H. Jain, D. Kroening, N. Sharygina, and E. M. Clarke, "Word level predicate abstraction and refinement for verifying RTL verilog." in DAC, 2005.
  • 20
    • 84860400978 scopus 로고    scopus 로고
    • Yesterday, my program worked. Today, it does not. Why?
    • A. Zeller, "Yesterday, my program worked. Today, it does not. Why?" in ESEC / SIGSOFT FSE, 1999, pp. 253-267.
    • (1999) ESEC / SIGSOFT FSE , pp. 253-267
    • Zeller, A.1
  • 21
    • 33845934488 scopus 로고    scopus 로고
    • A. R. Bradley and Z. Manna, Verification constraint problems with strengthening, in ICTAC, ser. LNCS, 3722. Springer, 2006.
    • A. R. Bradley and Z. Manna, "Verification constraint problems with strengthening," in ICTAC, ser. LNCS, vol. 3722. Springer, 2006.


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