A semantic foundation for hidden state

Authors:
Jan Schwinghammer;Hongseok Yang;Lars Birkedal;François Pottier;Bernhard Reus
Affiliations:
Saarland Univ;Queen Mary Univ. of London;IT Univ. of Copenhagen;INRIA;Univ. of Sussex
Venue:
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Year:
2010

Citing 11
Cited 12

Elements of generalized ultrametric domain theory

Theoretical Computer Science
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
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
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Domain-theoretic Foundations of Functional Programming

Domain-theoretic Foundations of Functional Programming
BI-hyperdoctrines, higher-order separation logic, and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Separation logic, abstraction and inheritance

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A Simple Model of Separation Logic for Higher-Order Store

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Nested Hoare triples and frame rules for higher-order store

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic

Realisability semantics of parametric polymorphism, general references and recursive types

Mathematical Structures in Computer Science
The impact of higher-order state and control effects on local relational reasoning

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The next 700 separation logics

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Step-indexed kripke models over recursive worlds

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed store-passing translation for general references

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Hoare logic for higher order store using simple semantics

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Dynamic boundaries: information hiding by second order framing with first order assertions (ESOP invited lecture)

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Crowfoot: a verifier for higher-order store programs

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Capsules and Separation

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries

Journal of the ACM (JACM)
Specification patterns for reasoning about recursion through the store

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first complete soundness proof of the antiframe rule, a recently proposed proof rule for capturing information hiding in the presence of higher-order store. Our proof involves solving a non-trivial recursive domain equation, and it helps identify some of the key ingredients for soundness.