Mechanized Metatheory for the Masses: The PoplMark Challenge

Aydemir, Brian; Bohannon, Aaron; Fairbairn, Matthew; Foster, J. Nathan; Pierce, Benjamin C.; Sewell, Peter; Vytiniotis, Dimitrios; Washburn, Geoffrey; Weirich, Stephanie; Zdancewic, Steve

doi:10.1007/11541868_4

Cited by 228 publications

(207 citation statements)

References 35 publications

(28 reference statements)

Supporting

Mentioning

205

Contrasting

Order By: Relevance

“…Since both the language and its type system are defined uniformly as theories in the same logic, one can use the standard RLS proof theory to prove properties about languages and type systems for those languages. These preliminary results lead us to believe our approach is a good candidate for the PoplMark Challenge [39].…”

Section: Conclusion and Further Workmentioning

confidence: 75%

A Rewriting Logic Approach to Type Inference

Ellison

Şerbănuţă

Roşu

2009

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. Meseguer and Ros , u proposed rewriting logic semantics (RLS) as a programing language definitional framework that unifies operational and algebraic denotational semantics. RLS has already been used to define a series of didactic and real languages, but its benefits in connection with defining and reasoning about type systems have not been fully investigated. This paper shows how the same RLS style employed for giving formal definitions of languages can be used to define type systems. The same termrewriting mechanism used to execute RLS language definitions can now be used to execute type systems, giving type checkers or type inferencers. The proposed approach is exemplified by defining the Hindley-Milner polymorphic type inferencer W as a rewrite logic theory and using this definition to obtain a type inferencer by executing it in a rewriting logic engine. The inferencer obtained this way compares favorably with other definitions or implementations of W . The performance of the executable definition is within an order of magnitude of that of highly optimized implementations of type inferencers, such as that of OCaml.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 75%

A Rewriting Logic Approach to Type Inference

Ellison

Şerbănuţă

Roşu

2009

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

show abstract

“…Each method description includes a method identifier, its code (set of labelled bytecode instructions), a table of exception handlers, and a signature that gives the type of its arguments and of its result. 2 We note Handler(i, C) = t when there is a handler at program point t for exception of class C thrown at program point i, and Handler(i, C) ↑ otherwise. A method identifier may correspond to several methods in the class hierarchy according to overriding of methods.…”

Section: Programsmentioning

confidence: 99%

“…The need for machine-checked proofs is accentuated by the fact that non-interference proofs are particularly involved (w.r.t. say standard type safety proofs discussed in [2]), and that some lemmas as locally respects involve two parallel executions leading to an explosion of cases. For example, the JVM virtual call has 5 different transitions (call on a null reference which generates a null pointer exception caught or not, normal termination of the callee, termination by an exception caught or not in the caller context) which required 15 distinct proofs to be exhaustively confronted.…”

Section: Remarks On Formal Proofsmentioning

confidence: 99%

A Certified Lightweight Non-interference Java Bytecode Verifier

Barthe

Pichardie

Rezk

2007

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate information flow type systems. Much of previous work on type systems for non-interference has focused on calculi or high-level programming languages, and existing type systems for low-level languages typically omit objects, exceptions, and method calls, and/or do not prove formally the soundness of the type system. We define an information flow type system for a sequential JVM-like language that includes classes, objects, arrays, exceptions and method calls, and prove that it guarantees non-interference. For increased confidence, we have formalized the proof in the proof assistant Coq; an additional benefit of the formalization is that we have extracted from our proof a certified lightweight bytecode verifier for information flow. Our work provides, to our best knowledge, the first sound and implemented information flow type system for such an expressive fragment of the JVM.

show 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 [1] to advocating a general infrastructure for formalizing language meta-theory and semantics [2]. In particular, the logical framework LF [6], based on the dependently typed lambda-calculus, and light-weight variants of it like LF i [11] have played a major role in these applications.…”

Section: Introductionmentioning

confidence: 99%

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Pientka

2006

Automated Reasoning

View full text Add to dashboard Cite

Abstract. In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show that some implicit type information is uniquely determined, and can therefore be safely skipped during higher-order unification. Second, we discuss its impact in practice during type reconstruction and during proof search within the logical framework Twelf. Our experimental results show that implicit type arguments are numerous and large in size, but their impact on run-time is between 10% and 20%. On the other hand optimizations such as eliminating the occurs check are shown to be crucial to achieve significant performance improvements.

show abstract

Mechanized Metatheory for the Masses: The PoplMark Challenge

Cited by 228 publications

References 35 publications

A Rewriting Logic Approach to Type Inference

A Rewriting Logic Approach to Type Inference

A Certified Lightweight Non-interference Java Bytecode Verifier

Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Contact Info

Product

Resources

About