메뉴 건너뛰기




Volumn 10426 LNCS, Issue , 2017, Pages 97-117

Reluplex: An efficient smt solver for verifying deep neural networks

Author keywords

[No Author keywords available]

Indexed keywords

AIRCRAFT ACCIDENTS; COMPUTER AIDED ANALYSIS; LINEAR PROGRAMMING; SAFETY ENGINEERING;

EID: 85026742103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-63387-9_5     Document Type: Conference Paper
Times cited : (1698)

References (35)
  • 1
    • 33845215878 scopus 로고    scopus 로고
    • Splitting on demand in SAT modulo theories
    • Hermann, M., Voronkov, A. (eds.), Springer, Heidelberg
    • Barrett, C., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Splitting on demand in SAT modulo theories. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 512–526. Springer, Heidelberg (2006). doi:10.1007/11916277 35
    • (2006) LPAR 2006. LNCS (LNAI) , vol.4246 , pp. 512-526
    • Barrett, C.1    Nieuwenhuis, R.2    Oliveras, A.3    Tinelli, C.4
  • 5
    • 0003909736 scopus 로고
    • Linear Programming and Extensions
    • Princeton University Press, Princeton
    • Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
    • (1963)
    • Dantzig, G.1
  • 8
    • 84943527827 scopus 로고    scopus 로고
    • Explaining and harnessing adversarial examples
    • Goodfellow, I., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples, Technical report (2014). http://arxiv.org/abs/1412.6572
    • (2014) Technical Report
    • Goodfellow, I.1    Shlens, J.2    Szegedy, C.3
  • 12
    • 84926650869 scopus 로고    scopus 로고
    • A formally verified hybrid system for the next-generation airborne collision avoidance system
    • Baier, C., Tinelli, C. (eds.), Springer, Heidelberg
    • Jeannin, J.-B., Ghorbal, K., Kouskoulas, Y., Gardner, R., Schmidt, A., Zawadzki, E., Platzer, A.: A formally verified hybrid system for the next-generation airborne collision avoidance system. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 21–36. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46681-0 2
    • (2015) TACAS 2015. LNCS , vol.9035 , pp. 21-36
    • Jeannin, J.-B.1    Ghorbal, K.2    Kouskoulas, Y.3    Gardner, R.4    Schmidt, A.5    Zawadzki, E.6    Platzer, A.7
  • 17
    • 85010647704 scopus 로고    scopus 로고
    • Effective algorithms for the satisfiability of quantifier-free formulas over linear real and integer arithmetic. Ph.D. thesis
    • King, T.: Effective algorithms for the satisfiability of quantifier-free formulas over linear real and integer arithmetic. Ph.D. thesis, New York University (2014)
    • (2014) New York University
    • King, T.1
  • 24
    • 50049124149 scopus 로고    scopus 로고
    • The traffic alert and collision avoidance system
    • Kuchar, J., Drumm, A.: The traffic alert and collision avoidance system. Linc. Lab. J. 16(2), 277–296 (2007)
    • (2007) Linc. Lab. J. , vol.16 , Issue.2 , pp. 277-296
    • Kuchar, J.1    Drumm, A.2
  • 26
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for propositional satisfiability
    • Marques-Silva, J., Sakallah, K.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999)
    • (1999) IEEE Trans. Comput. , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.1    Sakallah, K.2
  • 28
    • 33847102258 scopus 로고    scopus 로고
    • Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)
    • Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM (JACM) 53(6), 937–977 (2006)
    • (2006) J. ACM (JACM) , vol.53 , Issue.6 , pp. 937-977
    • Nieuwenhuis, R.1    Oliveras, A.2    Tinelli, C.3
  • 29
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60–100 (1991)
    • (1991) SIAM Rev , vol.33 , Issue.1 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 30
    • 77955004015 scopus 로고    scopus 로고
    • An abstraction-refinement approach to verification of artificial neural networks
    • Touili, T., Cook, B., Jackson, P. (eds.), Springer, Heidelberg
    • Pulina, L., Tacchella, A.: An abstraction-refinement approach to verification of artificial neural networks. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 243–257. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14295-6 24
    • (2010) CAV 2010. LNCS , vol.6174 , pp. 243-257
    • Pulina, L.1    Tacchella, A.2
  • 31
    • 84864454979 scopus 로고    scopus 로고
    • Challenging SMT solvers to verify neural networks
    • Pulina, L., Tacchella, A.: Challenging SMT solvers to verify neural networks. AI Commun. 25(2), 117–135 (2012)
    • (2012) AI Commun , vol.25 , Issue.2 , pp. 117-135
    • Pulina, L.1    Tacchella, A.2
  • 32
    • 0033316361 scopus 로고    scopus 로고
    • Hierarchical models of object recognition in cortex
    • Riesenhuber, M., Tomaso, P.: Hierarchical models of object recognition in cortex. Nat. Neurosci. 2(11), 1019–1025 (1999). doi:10.1038/14819
    • (1999) Nat. Neurosci. , vol.2 , Issue.11 , pp. 1019-1025
    • Riesenhuber, M.1    Tomaso, P.2
  • 35
    • 0003782186 scopus 로고    scopus 로고
    • Linear Programming: Foundations and Extensions
    • Springer, Heidelberg
    • Vanderbei, R.: Linear Programming: Foundations and Extensions. Springer, Heidelberg (1996)
    • (1996)
    • Vanderbei, R.1


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