Compositional type systems for stack-based low-level languages

Authors:
Ando Saabas;Tarmo Uustalu
Affiliations:
Institute of Cybernetics at Tallinn University of Technology, Tallinn, Estonia;Institute of Cybernetics at Tallinn University of Technology, Tallinn, Estonia
Venue:
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Year:
2006

Citing 9
Cited 2

A type system for Java bytecode subroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of programs for secure information flow

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
An indexed model of recursive types for foundational proof-carrying code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stack-based typed assembly language

Journal of Functional Programming
Non-interference for a JVM-like language

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
A compositional logic for control flow and its application in foundational proof-carrying code

A compositional logic for control flow and its application in foundational proof-carrying code
Monad-independent Hoare logic in HasCasl

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering

A compositional natural semantics and Hoare logic for low-level languages

Theoretical Computer Science
Certify Once, Trust Anywhere: Modular Certification of Bytecode Programs for Certified Virtual Machine

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is widely believed that low-level languages with jumps must be difficult to reason about by being inherently non-modular. We have recently argued that this in untrue and proposed a novel method for developing compositional natural semantics and Hoare logics for low-level languages and demonstrated its viability on the example of a simple low-level language with expressions (Saabas & Uustalu 2005). The central idea is to use the implicit structure of finite disjoint unions present in low-level code as an (ambiguous) phrase structure.Here we apply our method to a stack-based language and develop it further. We define a compositional natural semantics and Hoare logic for this language and go then on to show that, in addition to Hoare logics, one can also derive compositional type systems as weaker specification languages with the same method. We describe type systems for stack-error freedom and secure information flow.