메뉴 건너뛰기




Volumn , Issue , 2001, Pages 29-37

A decision procedure for an extensional theory of arrays

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

EID: 0034858360     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2001.932480     Document Type: Article
Times cited : (116)

References (15)
  • 6
    • 0004018546 scopus 로고
    • Some completeness results in the mathematical theory of computation
    • (1968) Journal of the ACM , vol.15 , Issue.1 , pp. 124-134
    • Kaplan, D.1
  • 7
    • 0004004584 scopus 로고    scopus 로고
    • Formal verification techniques for digital systems
    • PhD thesis, Stanford University
    • (1999)
    • Levitt, J.1
  • 9
    • 0004173988 scopus 로고
    • Techniques for program verification
    • Technical Report CSL-81-10, Xerox PARC, June
    • (1981)
    • Nelson, G.1
  • 12


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