Strong Update, Disposal, and Encapsulation in Bunched Typing

Authors:
Josh Berdine;Peter W. O'Hearn
Affiliations:
Microsoft Research11Work performed while supported by the EPSRC at Queen Mary, University of London;Queen Mary, University of London
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 13
Cited 5

Is there a use for linear logic?

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic control of interference

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of 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
Alias Types for Recursive Data Structures

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bunched typing

Journal of Functional Programming
Semantics of Separation-Logic Typing and Higher-Order Frame Rules

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A step-indexed model of substructural state

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Frame rules from answer types for code pointers

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
L3: a linear language with locations

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

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Classical BI: a logic for reasoning about dualising resources

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bunched polymorphism

Mathematical Structures in Computer Science
Bunching for Regions and Locations

Electronic Notes in Theoretical Computer Science (ENTCS)
A Unified Display Proof Theory for Bunched Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Bunched Logics Displayed

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model.