메뉴 건너뛰기




Volumn 4121 LNCS, Issue , 2006, Pages 184-197

A progressive simplifier for satisfiability modulo theories

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; FUNCTION EVALUATION; LINEAR PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

EID: 33749578923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_20     Document Type: Conference Paper
Times cited : (3)

References (24)
  • 1
    • 84962325965 scopus 로고    scopus 로고
    • RTL-datapath verification using integer linear programming
    • Brinkmann, R., Drechsler, R.: RTL-datapath verification using integer linear programming. In: ASP-DAC '02. (2002) 741-746
    • (2002) ASP-DAC '02 , pp. 741-746
    • Brinkmann, R.1    Drechsler, R.2
  • 2
    • 0030679983 scopus 로고    scopus 로고
    • Symbolic timing verification of timing diagrams using presburger formulas
    • Amon, T., Borriello, G., Hu, T., Liu, J.: Symbolic timing verification of timing diagrams using presburger formulas. In: DAC '97. (1997) 226-231
    • (1997) DAC '97 , pp. 226-231
    • Amon, T.1    Borriello, G.2    Hu, T.3    Liu, J.4
  • 4
    • 35048835830 scopus 로고    scopus 로고
    • CVCLite: A new implementation of the cooperating validity checker category b
    • Barrett, C.W., Berezin, S.: CVCLite: A new implementation of the cooperating validity checker category b. In: CAV. (2004) 515-518
    • (2004) CAV , pp. 515-518
    • Barrett, C.W.1    Berezin, S.2
  • 7
    • 26444611230 scopus 로고    scopus 로고
    • A scalable method for solving satisfiability of integer linear arithmetic logic
    • Sheini, H.M., Sakallah, K.A.: A scalable method for solving satisfiability of integer linear arithmetic logic. In: SAT. (2005) 241-256
    • (2005) SAT , pp. 241-256
    • Sheini, H.M.1    Sakallah, K.A.2
  • 8
    • 26444452555 scopus 로고    scopus 로고
    • DPLL(T) with exhaustive theory propagation and its application to difference logic
    • Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: CAV. (2005) 321-334
    • (2005) CAV , pp. 321-334
    • Nieuwenhuis, R.1    Oliveras, A.2
  • 9
    • 26444439129 scopus 로고    scopus 로고
    • A SAT-based decision procedure for mixed logical/integer linear problems
    • Sheini, H.M., Sakallah, K.A.: A SAT-based decision procedure for mixed logical/integer linear problems. In: CPAIOR. (2005) 320-335
    • (2005) CPAIOR , pp. 320-335
    • Sheini, H.M.1    Sakallah, K.A.2
  • 10
    • 84976700950 scopus 로고
    • Simplification by cooperating decision procedures
    • Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. 1(2) (1979) 245-257
    • (1979) ACM Trans. Program. Lang. Syst. , vol.1 , Issue.2 , pp. 245-257
    • Nelson, G.1    Oppen, D.C.2
  • 13
    • 30344450270 scopus 로고    scopus 로고
    • An extensible SAT-solver
    • Eén, N., Sörensson, N.: An extensible SAT-solver. In: SAT. (2003) 502-518
    • (2003) SAT , pp. 502-518
    • Eén, N.1    Sörensson, N.2
  • 14
    • 35248899420 scopus 로고    scopus 로고
    • An online proof-producing decision procedure for mixed-integer linear arithmetic
    • Berezin, S., Ganesh, V., Dill, D.L.: An online proof-producing decision procedure for mixed-integer linear arithmetic. In: TACAS. (2003) 521-536
    • (2003) TACAS , pp. 521-536
    • Berezin, S.1    Ganesh, V.2    Dill, D.L.3
  • 15
    • 26444463842 scopus 로고    scopus 로고
    • Efficient conflict-based learning in an RTL circuit constraint solver
    • Iyer, M.K., Parthasarathy, G., Cheng, K.T.: Efficient conflict-based learning in an RTL circuit constraint solver. In: DATE '05. (2005) 666-671
    • (2005) DATE '05 , pp. 666-671
    • Iyer, M.K.1    Parthasarathy, G.2    Cheng, K.T.3
  • 20
    • 3042511935 scopus 로고    scopus 로고
    • Automatic verification of safety and liveness for XScale-like processor models using WEB refinements
    • Manolios, P., Srinivasan, S.K.: Automatic verification of safety and liveness for XScale-like processor models using WEB refinements. In: DATE. (2004) 168-175
    • (2004) DATE , pp. 168-175
    • Manolios, P.1    Srinivasan, S.K.2
  • 21
    • 84948178956 scopus 로고    scopus 로고
    • Modeling and verification of out-of-order microprocessors in UCLID
    • Lahiri, S.K., Seshia, S.A., Bryant, R.E.: Modeling and verification of out-of-order microprocessors in UCLID. In: FMCAD. (2002) 142-159
    • (2002) FMCAD , pp. 142-159
    • Lahiri, S.K.1    Seshia, S.A.2    Bryant, R.E.3
  • 22
    • 26444489953 scopus 로고    scopus 로고
    • SMT-COMP: Satisfiability Modulo Theories Competition
    • Barrett, C., de Moura, L., Stump, A.: SMT-COMP: Satisfiability Modulo Theories Competition. In: CAV. (2005) 20-23
    • (2005) CAV , pp. 20-23
    • Barrett, C.1    De Moura, L.2    Stump, A.3
  • 23
    • 33749546387 scopus 로고    scopus 로고
    • de Moura, L.: YICES, http://fm.csl.sri.com/yices/ (2005)
    • (2005) YICES
    • De Moura, L.1
  • 24
    • 33745456148 scopus 로고    scopus 로고
    • Decision procedures for SAT, SAT modulo theories and beyond, the BarcelogicTools
    • Nieuwenhuis, R., Oliveras, A.: Decision procedures for SAT, SAT modulo theories and beyond, the BarcelogicTools. In: LPAR. (2005) 23-46
    • (2005) LPAR , pp. 23-46
    • Nieuwenhuis, R.1    Oliveras, A.2


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