메뉴 건너뛰기




Volumn 7317 LNCS, Issue , 2012, Pages 157-171

Generalized property directed reachability

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT TRANSITION SYSTEMS; BOOLEAN CONSTRAINT; BOOLEAN PROGRAMS; CONFLICT RESOLUTION; FINITE-STATE REACTIVE SYSTEMS; FIXED POINT OPERATOR; HARDWARE MODELS; MODEL SEARCH; ONE DIMENSION; REACHABILITY; TWO-DIMENSION;

EID: 84864212783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31612-8_13     Document Type: Conference Paper
Times cited : (215)

References (14)
  • 1
    • 84856199014 scopus 로고    scopus 로고
    • Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
    • Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. Springer, Heidelberg
    • Albarghouthi, A., Gurfinkel, A., Chechik, M.: Whale: An Interpolation-Based Algorithm for Inter-procedural Verification. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 39-55. Springer, Heidelberg (2012)
    • LNCS , vol.7148 , Issue.2012 , pp. 39-55
    • Albarghouthi, A.1    Gurfinkel, A.2    Chechik, M.3
  • 2
    • 0036039066 scopus 로고    scopus 로고
    • The SLAM project: Debugging system software via static analysis
    • Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. SIGPLAN Not. 37(1), 1-3 (2002)
    • (2002) SIGPLAN Not. , vol.37 , Issue.1 , pp. 1-3
    • Ball, T.1    Rajamani, S.K.2
  • 3
    • 0006860609 scopus 로고
    • Existential Fixed-Point Logic
    • Börger, E. (ed.) Computation Theory and Logic. Springer, Heidelberg
    • Blass, A., Gurevich, Y.: Existential Fixed-Point Logic. In: Börger, E. (ed.) Computation Theory and Logic. LNCS, vol. 270, pp. 20-36. Springer, Heidelberg (1987)
    • (1987) LNCS , vol.270 , pp. 20-36
    • Blass, A.1    Gurevich, Y.2
  • 4
    • 79251570863 scopus 로고    scopus 로고
    • SAT-Based Model Checking without Unrolling
    • Jhala, R., Schmidt, D. (eds.) VMCAI 2011. Springer, Heidelberg
    • Bradley, A.R.: SAT-Based Model Checking without Unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70-87. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6538 , pp. 70-87
    • Bradley, A.R.1
  • 6
    • 84857697806 scopus 로고    scopus 로고
    • Efficient implementation of property-directed reachability
    • Een, N., Mishchenko, A., Brayton, R.: Efficient implementation of property-directed reachability. In: FMCAD (2011)
    • (2011) FMCAD
    • Een, N.1    Mishchenko, A.2    Brayton, R.3
  • 8
    • 84055193176 scopus 로고    scopus 로고
    • Solving Recursion-Free Horn Clauses over LI+UIF
    • Yang, H. (ed.) APLAS 2011. Springer, Heidelberg
    • Gupta, A., Popeea, C., Rybalchenko, A.: Solving Recursion-Free Horn Clauses over LI+UIF. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 188-203. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.7078 , pp. 188-203
    • Gupta, A.1    Popeea, C.2    Rybalchenko, A.3
  • 9
    • 79960379025 scopus 로고    scopus 로고
    • μZ- An Efficient Engine for Fixed Points with Constraints
    • Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. Springer, Heidelberg
    • Hoder, K., Bjørner, N., de Moura, L.: μZ- An Efficient Engine for Fixed Points with Constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 457-462. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6806 , pp. 457-462
    • Hoder, K.1    Bjørner, N.2    De Moura, L.3
  • 10
    • 36949028762 scopus 로고    scopus 로고
    • Algorithms for computing minimal unsatisfiable subsets of constraints
    • Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1-33 (2008)
    • (2008) J. Autom. Reasoning , vol.40 , Issue.1 , pp. 1-33
    • Liffiton, M.H.1    Sakallah, K.A.2
  • 12
    • 84857727658 scopus 로고    scopus 로고
    • Interpolants from Z3 proofs
    • McMillan, K.L.: Interpolants from Z3 proofs. In: FMCAD (2011)
    • (2011) FMCAD
    • McMillan, K.L.1
  • 13
    • 33847102258 scopus 로고    scopus 로고
    • Solving SAT and SAT Modulo Theories: From an abstract DPLL procedure to DPLL(T)
    • Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract DPLL procedure to DPLL(T). J. ACM 53(6) (2006)
    • (2006) J. ACM , vol.53 , Issue.6
    • Nieuwenhuis, R.1    Oliveras, A.2    Tinelli, C.3
  • 14
    • 84957369394 scopus 로고    scopus 로고
    • Safe Datalog Queries with Linear Constraints
    • Maher, M.J., Puget, J.-F. (eds.) CP 1998. Springer, Heidelberg
    • Revesz, P.Z.: Safe Datalog Queries with Linear Constraints. In:Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 355-369. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1520 , pp. 355-369
    • Revesz, P.Z.1


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