메뉴 건너뛰기




Volumn 36, Issue 3, 2001, Pages 142-154

Oracle-based checking of untrusted software

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0037638563     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360216     Document Type: Article
Times cited : (27)

References (27)
  • 2
    • 0000941602 scopus 로고
    • Using typed lambda calculus to implement formal systems on a machine
    • A preliminary version appeared as University of Edinburgh Report ECS-LFCS-87-31
    • A. Avron, P. A. Honsell, I. A. Mason, and R. Pollack. Using typed lambda calculus to implement formal systems on a machine. Journal of Automated Reasoning, 9(3):309-354, 1992. A preliminary version appeared as University of Edinburgh Report ECS-LFCS-87-31.
    • (1992) Journal of Automated Reasoning , vol.9 , Issue.3 , pp. 309-354
    • Avron, A.1    Honsell, P.A.2    Mason, I.A.3    Pollack, R.4
  • 3
    • 0013260541 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
  • 5
    • 84968445083 scopus 로고
    • Higher-order unification with dependent types
    • N. Dershowitz, editor, Chapel Hill, North Carolina, Apr. Springer-Verlag LNCS 355
    • C. Elliott. Higher-order unification with dependent types. In N. Dershowitz, editor, Rewriting Techniques and Applications, pages 121-136, Chapel Hill, North Carolina, Apr. 1989. Springer-Verlag LNCS 355.
    • (1989) Rewriting Techniques and Applications , pp. 121-136
    • Elliott, C.1
  • 6
    • 77956953346 scopus 로고
    • Une extension de l'interprétation de Gödel à l'analyse, et son application àl 'élimination des coupures dans l'analyse et la théorie des types
    • J. E. Fenstad, editor, Proceedings 2nd Scandinavian Logic Symp., Oslo, Norway, 18-20 June 1970, North-Holland, Amsterdam
    • J.-Y. Girard. Une extension de l'interprétation de Gödel à l'analyse, et son application àl 'élimination des coupures dans l'analyse et la théorie des types. In J. E. Fenstad, editor, Proceedings 2nd Scandinavian Logic Symp., Oslo, Norway, 18-20 June 1970, volume 63 of Studies in Logic and the Foundations of Mathematics, pages 63-92. North-Holland, Amsterdam, 1971.
    • (1971) Studies in Logic and the Foundations of Mathematics , vol.63 , pp. 63-92
    • Girard, J.-Y.1
  • 9
    • 0002537243 scopus 로고
    • Concerning formulas of the types A → B V C, A → (Ex)B(x) in intuitionistic formal systems
    • R. Harrop. Concerning formulas of the types A → B V C, A → (Ex)B(x) in intuitionistic formal systems. Journal of Symbolic Logic, pages 27-32, 1960.
    • (1960) Journal of Symbolic Logic , pp. 27-32
    • Harrop, R.1
  • 10
    • 49549145605 scopus 로고
    • A unification algorithm for typed lambda calculus
    • G. Huet. A unification algorithm for typed lambda calculus. Theoretical Computer Science, 1(1):27-57, 1973.
    • (1973) Theoretical Computer Science , vol.1 , Issue.1 , pp. 27-57
    • Huet, G.1
  • 13
    • 0002381028 scopus 로고
    • An empirical study of the runtime behavior of higher-order logic programs
    • D. Miller, editor, July Available as Technical Report MS-CIS-92-86
    • S. Michaylov and F. Pfenning. An empirical study of the runtime behavior of higher-order logic programs. In D. Miller, editor, Proceedings of the Workshop on the λProlog Programming Language, pages 257-271, July 1992. Available as Technical Report MS-CIS-92-86.
    • (1992) Proceedings of the Workshop on the λProlog Programming Language , pp. 257-271
    • Michaylov, S.1    Pfenning, F.2
  • 15
    • 0000968273 scopus 로고
    • A logic programming language with lambda-abstraction, function variables, and simple unification
    • Sept.
    • D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, Sept. 1991.
    • (1991) Journal of Logic and Computation , vol.1 , Issue.4 , pp. 497-536
    • Miller, D.1
  • 17
    • 0000322097 scopus 로고
    • A proof procedure for the logic of hereditary Harrop formulas
    • Aug.
    • G. Nadathur. A proof procedure for the logic of hereditary Harrop formulas. Journal of Automated Reasoning, 11(1):115-145, Aug. 1993.
    • (1993) Journal of Automated Reasoning , vol.11 , Issue.1 , pp. 115-145
    • Nadathur, G.1
  • 18
    • 0001313425 scopus 로고    scopus 로고
    • Higher-order logic programming
    • D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, chapter 8. Oxford University Press
    • G. Nadathur and D. Miller. Higher-order logic programming. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, chapter 8. Oxford University Press, 1998.
    • (1998) Handbook of Logic in Artificial Intelligence and Logic Programming , vol.5
    • Nadathur, G.1    Miller, D.2
  • 20
    • 0004118855 scopus 로고    scopus 로고
    • PhD thesis, Carnegie Mellon University, Sept. Also available as CMU-CS-98-154
    • G. C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, Sept. 1998. Also available as CMU-CS-98-154.
    • (1998) Compiling with Proofs
    • Necula, G.C.1
  • 22
    • 49249101269 scopus 로고    scopus 로고
    • Efficient representation and validation of proofs
    • Indianapolis, June IEEE Computer Society Press
    • G. C. Necula and P. 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
  • 23
    • 0002474842 scopus 로고
    • Logic programming in the LF logical framework
    • G. Huet and G. Plotkin, editors, Cambridge University Press
    • F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
    • (1991) Logical Frameworks , pp. 149-181
    • Pfenning, F.1
  • 24
    • 84957105392 scopus 로고
    • Elf: A meta-language for deductive systems (system description)
    • A. Bundy, editor, LNAI 814, Nancy, France, June 26-July 1, Springer-Verlag
    • F. Pfenning. Elf: A meta-language for deductive systems (system description). In A. Bundy, editor, 12th International Conference on Automated Deduction, LNAI 814, pages 811-815, Nancy, France, June 26-July 1, 1994. Springer-Verlag.
    • (1994) 12th International Conference on Automated Deduction , pp. 811-815
    • Pfenning, F.1
  • 26
    • 84976827574 scopus 로고
    • Towards a theory of type structures
    • Programming Symposium (Colloque sur la Programmation, Paris), Springer-Verlag, Berlin, Heidelberg, and New York
    • J. C. Reynolds. Towards a theory of type structures. In Programming Symposium (Colloque sur la Programmation, Paris), volume 19 of Lecture Notes in Computer Science, pages 408-425. Springer-Verlag, Berlin, Heidelberg, and New York, 1974.
    • (1974) Lecture Notes in Computer Science , vol.19 , pp. 408-425
    • Reynolds, J.C.1
  • 27
    • 0027986032 scopus 로고
    • Typability and type-checking in the second-order λ-calculus are equivalent and undecidable
    • Paris, France, 4-7 July IEEE Computer Society Press
    • J. B. Wells. Typability and type-checking in the second-order λ-calculus are equivalent and undecidable. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 176-185, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
    • (1994) Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science , pp. 176-185
    • Wells, J.B.1


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