Proving memory management invariants for a language based on linear logic

Authors:
Jawahar Chirimar;Carl A. Gunter;Jon G. Riecke
Affiliations:
-;-;-
Venue:
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Year:
1992

Citing 12
Cited 9

Linear logic

Theoretical Computer Science
The linear abstract machine

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Proofs and types

Proofs and types
The definition of Standard ML

The definition of Standard ML
On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parameter-passing and the lambda calculus

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Is there a use for linear logic?

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
A semantic model of reference counting and its abstraction (detailed summary)

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures

ACM Computing Surveys (CSUR)
Functional Programming

Functional Programming
A flexible approach to interprocedural data flow analysis and programs with recursive data structures

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A “linear logic” Quicksort

ACM SIGPLAN Notices
The Boyer benchmark meets linear logic

ACM SIGPLAN Lisp Pointers
Linear logic and permutation stacks—the Forth shall be first

ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Sparse polynomials and linear logic

ACM SIGSAM Bulletin
Minimizing reference count updating with deferred and anchored pointers for functional data structures

ACM SIGPLAN Notices
“Use-once” variables and linear objects: storage management, reflection and multi-threading

ACM SIGPLAN Notices
Abstract models of memory management

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
A functional representation of data structures with a hole

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Study of Abramsky's Linear Chemical Abstract Machine

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop tools for the rigorous formulation and proof of properties of runtime management for a sample programming language based on a linear type system. Two semantics are diescribed, one at a level of observable results of computations and one describing linear connectives in terms of memory-management primitives. The two semantics are proven equivalent and the memory-management model is proven to satisfy fundamental correctness criteria for reference counts.