ILC: a foundation for automated reasoning about pointer programs

Authors:
Limin Jia;David Walker
Affiliations:
Princeton University, Princeton, NJ;Princeton University, Princeton, NJ
Venue:
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Year:
2006

Citing 21
Cited 6

Logic programming in a fragment of intuitionistic linear logic

Papers presented at the IEEE symposium on Logic in computer science
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enforcing high-level protocols in low-level software

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Flow-sensitive type qualifiers

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Alias Types

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A linear logical framework

Information and Computation
Reasoning about Hierarchical Storage

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An effective theory of type refinements

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Monadic concurrent linear logic programming

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Certifying Compilation for a Language with Stack Allocation

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
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
A focusing inverse method theorem prover for first-order linear logic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
L3: a linear language with locations

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A decidable fragment of separation logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Safe programming with pointers through stateful views

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

Expressing heap-shape contracts in linear logic

Proceedings of the 5th international conference on Generative programming and component engineering
Logic-flow analysis of higher-order programs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations

Journal of Automated Reasoning
Enhancing Program Verification with Lemmas

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automated verification of shape and size properties via separation logic

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Automated verification of shape, size and bag properties via user-defined predicates in separation logic

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how to use Girard's intuitionistic linear logic extended with a classical sublogic to reason about pointer programs. More specifically, first, the paper defines the proof theory for ILC (Intuitionistic Linear logic with Constraints) and shows it is well-defined via a proof of cut elimination. Second, inspired by prior work of O'Hearn, Reynolds, and Yang, the paper explains how to interpret linear logical formulas as descriptions of a program store. Third, this paper defines a simple imperative programming language with mutable references and arrays and gives verification condition generation rules that produce assertions in ILC. Finally, we identify a fragment of ILC, ILC−−, that is both decidable and closed under generation of verification conditions. Since verification condition generation is syntax-directed, we obtain a decidable procedure for checking properties of pointer programs.