메뉴 건너뛰기




Volumn 4590 LNCS, Issue , 2007, Pages 303-306

BAT: The bit-level analysis tool

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; LOGIC PROGRAMMING; PIPELINE PROCESSING SYSTEMS; SPECIFICATION LANGUAGES; STORAGE ALLOCATION (COMPUTER); VERIFICATION;

EID: 38149078029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73368-3_35     Document Type: Conference Paper
Times cited : (14)

References (7)
  • 1
    • 33749846787 scopus 로고    scopus 로고
    • Dutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, 4144, pp. 81-94. Springer, Heidelberg (2006)
    • Dutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
  • 2
    • 26444437248 scopus 로고    scopus 로고
    • Jackson, P., Sheridan, D.: Clause form conversions for boolean circuits. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, 3542, pp. 183-198. Springer, Heidelberg (2005)
    • Jackson, P., Sheridan, D.: Clause form conversions for boolean circuits. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 183-198. Springer, Heidelberg (2005)
  • 3
    • 33751405620 scopus 로고    scopus 로고
    • A complete compositional reasoning framework for the efficient verification of pipelined machines
    • IEEE Computer Society Press, Los Alamitos
    • Manolios, P., Srinivasan, S.K.: A complete compositional reasoning framework for the efficient verification of pipelined machines. In: International Conference on Computer-Aided Design (ICCAD'05), pp. 863-870. IEEE Computer Society Press, Los Alamitos (2005)
    • (2005) International Conference on Computer-Aided Design (ICCAD'05) , pp. 863-870
    • Manolios, P.1    Srinivasan, S.K.2
  • 7
    • 0001340960 scopus 로고
    • On the complexity of derivation in propositional calculus
    • Slisenko, A.O, ed, Consultants Bureau, New York-London
    • Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part2, pp. 115-125. Consultants Bureau, New York-London (1962)
    • (1962) Studies in Constructive Mathematics and Mathematical Logic , Issue.PART2 , pp. 115-125
    • Tseitin, G.S.1


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