Linear logical approximations

Authors:
Robert J. Simmons;Frank Pfenning
Affiliations:
Carnegie Mellon University, Pittsburgh, PA, USA;Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Year:
2009

Citing 10
Cited 1

Linear logic

Theoretical Computer Science
The essence of compiling with continuations

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Logic programming in a fragment of intuitionistic linear logic

Papers presented at the IEEE symposium on Logic in computer science
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automated protocol verification in linear logic

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Logical Algorithms

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
An effective fixpoint semantics for linear logic programs

Theory and Practice of Logic Programming
Model checking linear logic specifications

Theory and Practice of Logic Programming
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Relating State-Based and Process-Based Concurrency through Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Logical approximation for program analysis

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The abstract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying operational semantics in a bottom-up, linear logic programming language -- a technique we call "substructural operational semantics" (SSOS) -- manifestly sound program approximations can be derived by simple and intuitive approximations of the logic program. As examples, we describe how to derive a simple alias analysis, 0CFA, and kCFA analysis from a substructural operational semantics of the relevant languages.