A language-based approach to functionally correct imperative programming

Authors:
Edwin Westbrook;Aaron Stump;Ian Wehrman
Affiliations:
Washington University in Saint Louis;Washington University in Saint Louis;Washington University in Saint Louis
Venue:
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Year:
2005

Citing 20
Cited 16

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
The calculus of constructions

Information and Computation - Semantics of Data Types
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A framework for defining logics

Journal of the ACM (JACM)
Graph types

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that

Term rewriting and all that
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Parametric shape analysis via 3-valued logic

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Types and programming languages

Types and programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Dependent types ensure partial correctness of theorem provers

Journal of Functional Programming
The view from the left

Journal of Functional Programming
A syntactic approach to eta equality in type theory

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On equivalence and canonical forms in the LF type theory

ACM Transactions on Computational Logic (TOCL)
Combining programming with theorem proving

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A language-based approach to functionally correct imperative programming

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Safe programming with pointers through stateful views

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

A language-based approach to functionally correct imperative programming

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Roadmap for enhanced languages and methods to aid verification

Proceedings of the 5th international conference on Generative programming and component engineering
Dependent ML An approach to practical programming with dependent types

Journal of Functional Programming
Language-Based Program Verification via Expressive Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Position Paper: Thoughts on Programming with Proof Assistants

Electronic Notes in Theoretical Computer Science (ENTCS)
Imperative LF Meta-Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
AURA: a programming language for authorization and audit

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Ynot: dependent types for imperative programs

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Programming with Proofs: Language-Based Approaches to Totally Correct Software

Verified Software: Theories, Tools, Experiments
A Hoare Logic for Call-by-Value Functional Programs

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Static contract checking for Haskell

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Positively dependent types

Proceedings of the 3rd workshop on Programming languages meets program verification
Modular development of certified program verifiers with a proof assistant1,2

Journal of Functional Programming
Hoare type theory, polymorphism and separation1

Journal of Functional Programming
Generic programming in Ωmega

SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Programming with binders and indexed data-types

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a language-based approach to functionally correct imperative programming is proposed. The approach is based on a programming language called RSP1, which combines dependent types, general recursion, and imperative features in a type-safe way, while preserving decidability of type checking. The methodology used is that of internal verification, where programs manipulate programmer-supplied proofs explicitly as data. The fundamental technical idea of RSP1 is to identify problematic operations as impure, and keep them out of dependent types. The resulting language is powerful enough to verify statically non-trivial properties of imperative and functional programs. The paper presents the ideas through the examples of statically verified merge sort, statically verified imperative binary search trees, and statically verified directed acyclic graphs.