메뉴 건너뛰기




Volumn 86, Issue 1, 2003, Pages 162-173

Transforming equality logic to propositional logic

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; VECTORS;

EID: 18944392188     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80661-3     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 2
    • 84958791713 scopus 로고    scopus 로고
    • Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
    • Bryant R., German S., Velev M. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Transactions on Computational Logic. 2:2001;93-134
    • (2001) ACM Transactions on Computational Logic , vol.2 , pp. 93-134
    • Bryant, R.1    German, S.2    Velev, M.3
  • 3
    • 84944393003 scopus 로고    scopus 로고
    • Boolean satisfiability with transitivity constraints
    • E. Emerson, & A. Sistla. LNCS 1855
    • Bryant R., Velev M. Boolean satisfiability with transitivity constraints. Emerson E., Sistla A. Computer-Aided Verification (CAV'00). LNCS 1855:2000;85-98
    • (2000) Computer-Aided Verification (CAV'00) , pp. 85-98
    • Bryant, R.1    Velev, M.2
  • 5
    • 84958772916 scopus 로고
    • Automated verification of pipelined microprocessor control
    • D. Dill. LNCS 818
    • Burch J., Dill D. Automated verification of pipelined microprocessor control. Dill D. Computer-Aided Verification (CAV'94). LNCS 818:1994;68-80
    • (1994) Computer-Aided Verification (CAV'94) , pp. 68-80
    • Burch, J.1    Dill, D.2
  • 6
    • 84863922391 scopus 로고    scopus 로고
    • BDD based procedures for a theory of equality with uninterpreted functions
    • Proceedings of Conference on Computer-Aided Verification (CAV)
    • Goel A., K. Sajid, H. Zhou, A. Aziz and V. Singhal, BDD based procedures for a theory of equality with uninterpreted functions, in: Proceedings of Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427 (1998), pp. 244-255.
    • (1998) Lecture Notes in Computer Science , vol.1427 , pp. 244-255
    • Goel, A.1    Sajid, H.2    Zhou, A.3    Aziz, K.4    Singhal, V.5
  • 7
    • 84956855748 scopus 로고    scopus 로고
    • Equational binary decision diagrams
    • M. Parigot, & A. Voronkov. Lecture Notes in Artificial Intelligence 1955
    • Groote J.F., van de Pol J.C. Equational binary decision diagrams. Parigot M., Voronkov A. Logic for Programming and Reasoning (LPAR). Lecture Notes in Artificial Intelligence 1955:2000;161-178
    • (2000) Logic for Programming and Reasoning (LPAR) , pp. 161-178
    • Groote, J.F.1    Van De Pol, J.C.2
  • 10
    • 84958754487 scopus 로고    scopus 로고
    • Finite instantiations in equivalence logic with uninterpreted functions
    • LNCS 2102
    • Rodeh Y., Shtrichman O. Finite instantiations in equivalence logic with uninterpreted functions. Computer Aided Verification (CAV'01). LNCS 2102:2001;144-154
    • (2001) Computer Aided Verification (CAV'01) , pp. 144-154
    • Rodeh, Y.1    Shtrichman, O.2
  • 11
    • 2442511090 scopus 로고    scopus 로고
    • A proof system and a decision procedure for equality logic
    • Eindhoven University of Technology (2003), available via
    • Tveretina O. and H. Zantema, A proof system and a decision procedure for equality logic, Technical Report CS-report 03-02, Eindhoven University of Technology (2003), available via http://www.win.tue.nl/~hzantema/TZ.pdf.
    • Technical Report CS-report , vol.3 , Issue.2
    • Tveretina, O.1    Zantema, H.2


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