{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:07:36Z","timestamp":1794341256847,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540366355","type":"print"},{"value":"9783540366362","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799573_3","type":"book-chapter","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T08:25:42Z","timestamp":1154939142000},"page":"3-10","source":"Crossref","is-referenced-by-count":0,"title":["Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks"],"prefix":"10.1007","author":[{"given":"Brigitte","family":"Pientka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Appel, A.: Foundational proof-carrying code project. personal communication"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/LICS.2001.932501","volume-title":"Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS 2001)","author":"A. Appel","year":"2001","unstructured":"Appel, A.: Foundational proof-carrying code. In: Halpern, J. (ed.) Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS 2001), pp. 247\u2013256. IEEE Computer Society Press, Los Alamitos (2001) (Invited Talk)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Appel, A.W., Felten, E.W.: Proof-carrying authentication. In: ACM Conference on Computer and Communications Security, pp. 52\u201362 (1999)","DOI":"10.1145\/319709.319718"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Appel, W., Felty, A.P.: A semantic model of types and machine instructions for proof-carrying code. In: 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), pp. 243\u2013253 (January 2000)","DOI":"10.1145\/325694.325727"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Aydemir, B., Bohannon, A., Fairbairn, M., Foster, J., Pierce, B., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The poplmark challenge (2005)","DOI":"10.1007\/11541868_4"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-45620-1_3","volume-title":"Automated Deduction - CADE-18","author":"A. Bernard","year":"2002","unstructured":"Bernard, A., Lee, P.: Temporal Logic for Proof-Carrying Code. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol.\u00a02392, p. 31. Springer, Heidelberg (2002)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-45085-6_9","volume-title":"Automated Deduction \u2013 CADE-19","author":"K. Crary","year":"2003","unstructured":"Crary, K., Sarkar, S.: Foundational certified code in a metalogical framework. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 106\u2013120. Springer, Heidelberg (2003)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-59200-8_52","volume-title":"Rewriting Techniques and Applications","author":"P. Graf","year":"1995","unstructured":"Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 117\u2013131. Springer, Heidelberg (1995)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"Huet, G.: A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\u00a01, 27\u201357 (1975)","journal-title":"Theoretical Computer Science"},{"key":"3_CR11","unstructured":"Michaylov, S., Pfenning, F.: An empirical study of the runtime behavior of higher-order logic programs. In: Miller, D. (ed.) Proceedings of the Workshop on the \u03bbProlog Programming Language, Philadelphia, Pennsylvania, pp. 257\u2013271. University of Pennsylvania (July 1992) Available as Technical Report MS-CIS-92-86."},{"key":"3_CR12","first-page":"255","volume-title":"Eighth International Logic Programming Conference","author":"D. Miller","year":"1991","unstructured":"Miller, D.: Unification of simply typed lambda-terms as logic programming. In: Eighth International Logic Programming Conference, Paris, France, pp. 255\u2013269. MIT Press, Cambridge (1991)"},{"key":"3_CR13","first-page":"810","volume-title":"Fifth International Logic Programming Conference","author":"G. Nadathur","year":"1988","unstructured":"Nadathur, G., Miller, D.: An overview of \u03bbProlog. In: Bowen, K.A., Kowalski, R.A. (eds.) Fifth International Logic Programming Conference, Seattle, Washington, pp. 810\u2013827. MIT Press, Cambridge (1988)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-48660-7_25","volume-title":"Automated Deduction - CADE-16","author":"G. Nadathur","year":"1999","unstructured":"Nadathur, G., Mitchell, D.J.: System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of \u03bbProlog. In: Ganzinger, H. (ed.) CADE 1999. LNCS, vol.\u00a01632, pp. 287\u2013291. Springer, Heidelberg (1999)"},{"key":"3_CR15","unstructured":"Nanevski, A., Pfenning, F., Pientka, B.: A contextual modal type theory (2005)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Necula, G., Rahul, S.: Oracle-based checking of untrusted software. In: 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 142\u2013154 (2001)","DOI":"10.1145\/360204.360216"},{"key":"3_CR17","first-page":"93","volume-title":"Proceedings of the 13th Annual Symposium on Logic in Computer Science (LICS 1998)","author":"G.C. Necula","year":"1998","unstructured":"Necula, G.C., Lee, P.: Efficient representation and validation of logical proofs. In: Pratt, V. (ed.) Proceedings of the 13th Annual Symposium on Logic in Computer Science (LICS 1998), Indianapolis, Indiana, pp. 93\u2013104. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0743-1066(86)90015-4","volume":"3","author":"L.C. Paulson","year":"1986","unstructured":"Paulson, L.C.: Natural deduction as higher-order resolution. Journal of Logic Programming\u00a03, 237\u2013258 (1986)","journal-title":"Journal of Logic Programming"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1017\/CBO9780511569807.008","volume-title":"Logical Frameworks","author":"F. Pfenning","year":"1991","unstructured":"Pfenning, F.: Logic programming in the LF logical framework. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 149\u2013181. Cambridge University Press, Cambridge (1991)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Unification and anti-unification in the Calculus of Constructions. In: Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, The Netherlands, pp. 74\u201385 (July 1991)","DOI":"10.1109\/LICS.1991.151632"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM SIGPLAN 1988 Symposium on Language Design and Implementation, Atlanta, Georgia, pp. 199\u2013208 (June 1988)","DOI":"10.1145\/53990.54010"},{"key":"3_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System Description: Twelf - A Meta-Logical Framework for Deductive Systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-24599-5_26","volume-title":"Logic Programming","author":"B. Pientka","year":"2003","unstructured":"Pientka, B.: Higher-Order Substitution Tree Indexing. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 377\u2013391. Springer, Heidelberg (2003)"},{"key":"3_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/11532231_5","volume-title":"Automated Deduction \u2013 CADE-20","author":"B. Pientka","year":"2005","unstructured":"Pientka, B.: Tabling for Higher-Order Logic Programming. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 54\u201368. Springer, Heidelberg (2005)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/11814771_32","volume-title":"Automated Reasoning","author":"B. Pientka","year":"2006","unstructured":"Pientka, B.: Eliminating redundancy in higher-order unification: A lightweight approach. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol.\u00a04130, pp. 362\u2013376. Springer, Heidelberg (2006)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-45085-6_40","volume-title":"Automated Deduction \u2013 CADE-19","author":"B. Pientka","year":"2003","unstructured":"Pientka, B., Pfenning, F.: Optimizing Higher-Order Pattern Unification. In: Baader, F. (ed.) CADE 2003. LNCS, vol.\u00a02741, pp. 473\u2013487. Springer, Heidelberg (2003)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-56610-4_78","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"Z. Qian","year":"1993","unstructured":"Qian, Z.: Linear unification of higher-order patterns. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 391\u2013405. Springer, Heidelberg (1993)"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1016\/B978-044450813-3\/50028-X","volume-title":"Handbook of Automated Reasoning","author":"I.V. Ramakrishnan","year":"2001","unstructured":"Ramakrishnan, I.V., Sekar, R., Voronkov, A.: Term indexing. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a02, pp. 1853\u20131962. Elsevier Science Publishers B.V., Amsterdam (2001)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/11562931_29","volume-title":"Logic Programming","author":"S. Sarkar","year":"2005","unstructured":"Sarkar, S., Pientka, B., Crary, K.: Small Proof Witnesses for LF. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 387\u2013401. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799573_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:16Z","timestamp":1605625876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799573_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540366355","9783540366362"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11799573_3","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11799573","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}