Classical BI

DOI10.1145/1480881.1480923MaRDI QIDQ5261530zbMATH OpenOpenAlexFDO

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

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)

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
• Bi-intuitionistic logics: a new instance of an old problem
• scientific article; zbMATH DE number 638618
• Resource separation in dynamic logic of propositional assignments

Cited in

(7)

• scientific article; zbMATH DE number 2051381 (Why is no real title available?)
• On Model Checking Boolean BI
• A unified display proof theory for bunched logic
• Classical BI: Its Semantics and Proof Theory
• Bunched logics displayed
• The virtues of idleness: a decidable fragment of resource agent logic
• An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics

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)