Conversion by Evaluation

Boespflug, Mathieu

doi:10.1007/978-3-642-11503-5_7

Cited by 5 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In seminal work, Gregoire and Leroy [13] have sped up Coq type checking by compiling to byte-code instead of using an interpreter. Boespflug [6] has obtained further speed-ups by producing native code using stock-compilers.…”

Section: Introductionmentioning

confidence: 99%

A Lambda Term Representation Inspired by Linear Ordered Logic

Abel

Kraus

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional information where to cut the variable context into function and argument part. This way, complete information about free variable occurrence is available at each subterm without requiring a traversal, and environments can be kept exact such that they only assign values to variables that actually occur in the associated term. Our approach avoids space leaks in interpreters that build function closures.In this article, we prove correctness of the new representation and present an experimental evaluation of its performance in a proof checker for the Edinburgh Logical Framework.

show abstract

Section: Introductionmentioning

confidence: 99%

A Lambda Term Representation Inspired by Linear Ordered Logic

Abel

Kraus

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…More recent work on untyped Normalization by Evaluation [25] compiles Coq programs to Objective Caml programs [26], [27].…”

Section: Proof Generationmentioning

confidence: 99%

Certificates for Verifiable Forensics

Jagadeesan

Lubinski

Pitcher

et al. 2014

2014 IEEE 27th Computer Security Foundations Symposium

View full text Add to dashboard Cite

Digital forensics reports typically document the search process that has led to a conclusion; the primary means to verify the report is to repeat the search process. We believe that, as a result, the Trusted Computing Base for digital forensics is unnecessarily large and opaque.We advocate the use of forensic certificates as intermediate artifacts between search and verification. Because a forensic certificate has a precise semantics, it can be verified without knowledge of the search process and forensic tools used to create it. In addition, this precision opens up avenues for the analysis of forensic specifications. We present a case study using the specification of a deleted file.We propose a verification architecture that addresses the enormous size of digital forensics data sets. As a proof of concept, we consider a computer intrusion case study, drawn from the Honeynet project. Our Coq formalization yields a verifiable certificate of the correctness of the underlying forensic analysis.

show abstract

“…KIV (Reif et al, 1998). Boesplfug (Boespflug, 2010) discusses variations of untyped normalisation by evaluation. The main emphasis is on comparing performance of various optimisations of the generated code.…”

Section: Related Workmentioning

confidence: 99%