메뉴 건너뛰기




Volumn , Issue , 2010, Pages 189-197

Predicate abstraction with adjustable-block encoding

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK SIZES; C PROGRAMS; FUNDAMENTAL PROPERTIES; PREDICATE ABSTRACTIONS; PROGRAM OPERATION; SINGLE PARAMETER; SOFTWARE MODEL CHECKERS;

EID: 79956063334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (104)

References (22)
  • 1
    • 56249143748 scopus 로고    scopus 로고
    • CALYSTO: Scalable and precise extended static checking
    • ACM
    • D. Babic and A. J. Hu, "CALYSTO: Scalable and precise extended static checking," in Proc. ICSE. ACM, 2008, pp. 211-220.
    • (2008) Proc. ICSE , pp. 211-220
    • Babic, D.1    Hu, A.J.2
  • 2
    • 35048871556 scopus 로고    scopus 로고
    • SLAM and static driver verifier: Technology transfer of formal methods inside microsoft
    • Springer
    • T. Ball, B. Cook, V. Levin, and S. Rajamani, "SLAM and Static Driver Verifier: Technology transfer of formal methods inside Microsoft," in Proc. IFM, LNCS 2999. Springer, 2004, pp. 1-20.
    • (2004) Proc. IFM, LNCS 2999 , pp. 1-20
    • Ball, T.1    Cook, B.2    Levin, V.3    Rajamani, S.4
  • 3
    • 84903151157 scopus 로고    scopus 로고
    • Boolean and Cartesian Abstraction for Model Checking C programs
    • Tools and Algorithms for the Construction and Analysis of Systems 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001 Proceedings
    • T. Ball, A. Podelski, and S. K. Rajamani, "Boolean and cartesian abstractions for model checking C programs," in Proc. TACAS, LNCS 2031. Springer, 2001, pp. 268-283. (Pubitemid 33254664)
    • (2001) Lecture Notes in Computer Science , Issue.2031 , pp. 268-283
    • Ball, T.1    Podelski, A.2    Rajamani, S.K.3
  • 5
    • 84885205652 scopus 로고    scopus 로고
    • Weakest-precondition of unstructured programs
    • ACM
    • M. Barnett and K. R. M. Leino, "Weakest-precondition of unstructured programs," in Proc. PASTE. ACM, 2005, pp. 82-87.
    • (2005) Proc. PASTE , pp. 82-87
    • Barnett, M.1    Leino, K.R.M.2
  • 8
    • 35348992492 scopus 로고    scopus 로고
    • Configurable software verification: Concretizing the convergence of model checking and program analysis
    • Springer
    • D. Beyer, T. A. Henzinger, and G. Théoduloz, "Configurable software verification: Concretizing the convergence of model checking and program analysis," in Proc. CAV, LNCS 4590. Springer, 2007, pp. 504-518.
    • (2007) Proc. CAV, LNCS 4590 , pp. 504-518
    • Beyer, D.1    Henzinger, T.A.2    Théoduloz, G.3
  • 9
    • 48949106358 scopus 로고    scopus 로고
    • CSISAT: Interpolation for LA+EUF
    • LNCS 5123, Springer
    • D. Beyer, D. Zufferey, and R. Majumdar, "CSISAT: Interpolation for LA+EUF," in Proc. CAV, LNCS 5123. Springer, 2008, pp. 304-308.
    • (2008) Proc. CAV , pp. 304-308
    • Beyer, D.1    Zufferey, D.2    Majumdar, R.3
  • 12
    • 4243189286 scopus 로고    scopus 로고
    • Counterexample-guided abstraction refinement for symbolic model checking
    • E. M. 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.M.1    Grumberg, O.2    Jha, S.3    Lu, Y.4    Veith, H.5
  • 14
    • 24644505403 scopus 로고    scopus 로고
    • SATABS: SAT-based predicate abstraction for ANSI-C
    • Tools and Algorithms for the Construction and Analysis of Systems - 11th Int. Conference, TACAS 2005, held as part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2005, Proc.
    • E. M. Clarke, D. Kröning, N. Sharygina, and K. Yorav, "SATABS: SAT-based predicate abstraction for ANSI-C," in Proc. TACAS, LNCS 3440. Springer, 2005, pp. 570-574. (Pubitemid 41273768)
    • (2005) Lecture Notes in Computer Science , vol.3440 , pp. 570-574
    • Clarke, E.1    Kroening, D.2    Sharygina, N.3    Yorav, K.4
  • 15
    • 0001663802 scopus 로고
    • Linear reasoning. A new form of the herbrand-gentzen theorem
    • W. Craig, "Linear reasoning. A new form of the Herbrand-Gentzen theorem," J. Symb. Log., vol. 22, no. 3, pp. 250-268, 1957.
    • (1957) J. Symb. Log. , vol.22 , Issue.3 , pp. 250-268
    • Craig, W.1
  • 16
    • 0026243790 scopus 로고
    • Efficiently computing static single-assignment form and the program dependence graph
    • R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadek, "Efficiently computing static single-assignment form and the program dependence graph," ACM Trans. Program. Lang. Syst., vol. 13, no. 4, pp. 451-490, 1991.
    • (1991) ACM Trans. Program. Lang. Syst. , vol.13 , Issue.4 , pp. 451-490
    • Cytron, R.1    Ferrante, J.2    Rosen, B.K.3    Wegman, M.N.4    Zadek, F.K.5
  • 17
    • 84947441305 scopus 로고    scopus 로고
    • Construction of abstract state graphs with PVS
    • Computer Aided Verification
    • S. Graf and H. Saïdi, "Construction of abstract state graphs with PVS," in Proc. CAV, LNCS 1254. Springer, 1997, pp. 72-83. (Pubitemid 127088966)
    • (1997) Lecture Notes in Computer Science , Issue.1254 , pp. 72-83
    • Graf, S.1    Saidi, H.2
  • 22
    • 84959039613 scopus 로고    scopus 로고
    • CIL: Intermediate language and tools for analysis and transformation of C programs
    • Springer
    • G. C. Necula, S. McPeak, S. P. Rahul, and W. Weimer, "CIL: Intermediate language and tools for analysis and transformation of C programs," in Proc. CC, LNCS 2304. Springer, 2002, pp. 213-228.
    • (2002) Proc. CC, LNCS 2304 , pp. 213-228
    • Necula, G.C.1    McPeak, S.2    Rahul, S.P.3    Weimer, W.4


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