Overcoming performance barriers: efficient verification techniques for logical frameworks

Authors:
Brigitte Pientka
Affiliations:
School of Computer Science, McGill University, Montreal, Canada
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 18
Cited 0

Natural deduction as higher-order resolution

Journal of Logic Programming
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Logic programming in the LF logical framework

Logical frameworks
A framework for defining logics

Journal of the ACM (JACM)
Proof-carrying authentication

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A semantic model of types and machine instructions for proof-carrying code

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Oracle-based checking of untrusted software

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear Unification of Higher-Order Patterns

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Substitution Tree Indexing

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Temporal Logic for Proof-Carrying Code

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Term indexing

Handbook of automated reasoning
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Small proof witnesses for LF

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Eliminating redundancy in higher-order unification: a lightweight approach

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Tabling for higher-order logic programming

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, logical frameworks which support formalizing language specifications together with their meta-theory have been pervasively used in small and large-scale applications, from certifying code [2] to advocating a general infrastructure for formalizing the meta-theory and semantics of programming languages [5]. In particular, the logical framework LF [9], based on the dependently typed lambda- calculus, and light-weight variants of it like LFi [17] have played a major role in these applications. While the acceptance of logical framework technology has grown and they have matured, one of the most criticized points is concerned with the run-time performance. In this tutorial we give a brief introduction to logical frameworks, describe its state-of-the art and present recent advances in addressing some of the existing performance issues.