Classical BI

DOI10.1145/1480881.1480923zbMATH Open1315.68175OpenAlexW2118698129MaRDI QIDQ5261530FDOQ5261530

Authors: James Brotherston, Cristiano Calcagno 

Publication date: 3 July 2015

Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1480881.1480923

Recommendations

• Classical BI: Its Semantics and Proof Theory
• A modal BI logic for dynamic resource properties
• scientific article; zbMATH DE number 2051381
• Reasoning about resources and information: a linear logic approach
• The semantics of BI and resource tableaux
• A modal separation logic for resource dynamics
• scientific article; zbMATH DE number 7307099
• scientific article; zbMATH DE number 7585718
• scientific article; zbMATH DE number 638618
• Resource separation in dynamic logic of propositional assignments

zbMATH Keywords

semanticscompletenessdisplay logiccut-eliminationbunched implicationsclassical BIresource models

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cited In (7)

• A Unified Display Proof Theory for Bunched Logic
• Title not available (Why is that?)
• On Model Checking Boolean BI
• Classical BI: Its Semantics and Proof Theory
• Bunched logics displayed
• An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics
• The virtues of idleness: a decidable fragment of resource agent logic

This page was built for publication: Classical BI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261530)