A realizability model for impredicative Hoare type theory

Authors:
Rasmus Lerchedahl Petersen;Lars Birkedal;Aleksandar Nanevski;Greg Morrisett
Affiliations:
IT University of Copenhagen;IT University of Copenhagen;Harvard University;Harvard University
Venue:
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Year:
2008

Citing 18
Cited 15

Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving Security Using Extensible Lightweight Static Analysis

IEEE Software
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An overview of JML tools and applications

International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
A logical analysis of aliasing in imperative higher-order functions

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Polymorphism and separation in hoare type theory

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
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
On a monadic semantics for freshness

Theoretical Computer Science - Applied semantics: Selected topics
BI-hyperdoctrines, higher-order separation logic, and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Domain-theoretical models of parametric polymorphism

Theoretical Computer Science
Relational parametricity and separation logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Abstract predicates and mutable adts in hoare type theory

ESOP'07 Proceedings of the 16th European conference on Programming
Separation logic for higher-order store

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
BI hyperdoctrines and higher-order separation logic

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Relational reasoning in a nominal semantics for storage

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Ynot: dependent types for imperative programs

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Towards type-theoretic semantics for transactional concurrency

Proceedings of the 4th international workshop on Types in language design and implementation
Design patterns in separation logic

Proceedings of the 4th international workshop on Types in language design and implementation
Separation and information hiding

ACM Transactions on Programming Languages and Systems (TOPLAS)
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Effective interactive proofs for higher-order imperative programs

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Realisability semantics of parametric polymorphism, general references and recursive types

Mathematical Structures in Computer Science
Verifying generics and delegates

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Trace-based verification of imperative programs with I/O

Journal of Symbolic Computation
Partiality, state and dependent types

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
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
Formalized verification of snapshotable trees: separation and sharing

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
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
Separation logic for object-oriented programming

Aliasing in Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can specify and reason about mutable abstract data types. The model ensures soundness of the extension of Hoare Type Theory with impredicative polymorphism; makes the connections to separation logic clear, and provides a basis for investigation of further sound extensions of the theory, in particular equations between computations and types.