A Stratified Semantics of General References Embeddable in Higher-Order Logic

Authors:
Amal J. Ahmed;Andrew W. Appel;Roberto Virga
Affiliations:
-;-;-
Venue:
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Year:
2002

Citing 0
Cited 16

Possible World Semantics for General Storage in Call-By-Value

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A provably sound TAL for back-end optimization

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Foundational proof checkers with small witnesses

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A Syntactic Approach to Foundational Proof-Carrying Code

Journal of Automated Reasoning
A Trustworthy Proof Checker

Journal of Automated Reasoning
A very modal model of a modern, major, general type system

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Unifying type checking and property checking for low-level code

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational semantics for effect-based program transformations: higher-order store

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Semantic foundations for typed assembly languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Typing termination in a higher-order concurrent imperative language

Information and Computation
Step-indexed kripke models over recursive worlds

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verified software toolchain

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A typed semantics of higher-order store and subtyping

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
A tutorial example of the semantic approach to foundational proof-carrying code

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate a semantic model of general references 驴 that is, mutable memory cells that may contain values of any (statically-checked) closed type, including other references. Our model is in terms of execution sequences on a von Neumann machine; thus, it can be used in a Proof-Carrying Code system where the skeptical consumer checks even the proofs of the typing rules. The model allows us to prove a frame-axiom introduction rule that allows locality of specification and reasoning, even in the event of updates to aliased locations. Our proof is machine-checked in the Twelf metalogic.