메뉴 건너뛰기




Volumn 2024, Issue , 2001, Pages 21-39

A scalable architecture for proof-carrying code

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING;

EID: 84958983468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44716-4_2     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 2
    • 49649139118 scopus 로고
    • Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation
    • N. DeBruijn.: Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Mat., 34:381-392, 1972.
    • (1972) Indag. Mat. , vol.34 , pp. 381-392
    • Debruijn, N.1
  • 6
    • 84944090910 scopus 로고    scopus 로고
    • PhD thesis, Carnegie Mellon University, September, Also available as CMU-CS-98-154
    • George C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, September 1998. Also available as CMU-CS-98-154.
    • (1998) Necula. Compiling with Proofs
    • George, C.1
  • 8
    • 49249101269 scopus 로고    scopus 로고
    • Efficient representation and validation of proofs
    • Indianapolis, June, IEEE Computer Society Press
    • George C. Necula and Peter Lee. Efficient representation and validation of proofs. In Thirteenth Annual Symposium on Logic in Computer Science, pages 93-104, Indianapolis, June 1998. IEEE Computer Society Press.
    • (1998) Thirteenth Annual Symposium on Logic in Computer Science , pp. 93-104
    • Necula, G.C.1    Lee, P.2


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