Foundational Typed Assembly Language with Certified Garbage Collection

This paper tackles the issue of increasing dependability of distributed systems in the presence of mobile code. To this end we present a complete Proof-carrying-code (PCC) infrastructure for independent and automatic certification of resource bounds of mobile JVM programs. This includes a certifying compiler for a high-level language, which produces a certificate of bounded heap consumption, and independent certificate validation, realised via proof-checking, on the code-consumer side. Thus, we are now in a position to automatically infer linear upper bounds on the heap consumption of a strict, first-order functional language, generate a certificate encoding a formal proof of such bounded heap consumption and independently validate this certificate at the consumer side by checking the certificate. This prevents mobile code from exhausting resources on the local machine.

show abstract

“…Applications and further developments of FPCC can be found in [9], [10], and also in several publications on the FLINT project, e.g. [11]- [13].…”

Section: Related Workmentioning

confidence: 99%

A Proof-Carrying-Code Infrastructure for Resources

Loidl

MacKenzie

Jost

et al. 2009

2009 Fourth Latin-American Symposium on Dependable Computing

View full text Add to dashboard Cite

show abstract

“…The drive towards increased expressiveness inevitably leads to dependent types, a proven technology for verifying strong correctness properties of real programs [15,9,5,8]. For this reason, researchers have long sought practical ways to include dependent types in programming languages.…”

Section: Background and Motivationmentioning

confidence: 99%

Erasure and Polymorphism in Pure Type Systems

Mishra-Linger

Sheard

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor ∀ indicating parametric polymorphism. The erasure phase is guided by lightweight program annotations. The typing rules guarantee that well-typed programs obey a phase distinction between erasable (compile-time) and non-erasable (run-time) terms.The erasability of an expression depends only on how its value is used in the rest of the program. Despite this simple observation, most languages treat erasability as an intrinsic property of expressions, leading to code duplication problems. Our approach overcomes this deficiency by treating erasability extrinsically.Because the execution model of EPTS generalizes the familiar notions of type erasure and parametric polymorphism, we believe functional programmers will find it quite natural to program in such a setting.

show abstract