NDLI: Parametric completeness for separation theories

Content Provider	ACM Digital Library
Author	Villard, Jules Brotherston, James
Abstract	In this paper, we close the logical gap between provability in the logic BBI, which is the propositional basis for separation logic, and validity in an intended class of separation models, as employed in applications of separation logic such as program verification. An intended class of separation models is usually specified by a collection of axioms describing the specific model properties that are expected to hold, which we call a separation theory. Our main contributions are as follows. First, we show that several typical properties of separation theories are not definable in BBI. Second, we show that these properties become definable in a suitable hybrid extension of BBI, obtained by adding a theory of naming to BBI in the same way that hybrid logic extends normal modal logic. The binder-free extension captures most of the properties we consider, and the full extension HyBBI(↓) with the usual ↓ binder of hybrid logic covers all these properties. Third, we present an axiomatic proof system for our hybrid logic whose extension with any set of "pure" axioms is sound and complete with respect to the models satisfying those axioms. As a corollary of this general result, we obtain, in a parametric manner, a sound and complete axiomatic proof system for any separation theory from our considered class. To the best of our knowledge, this class includes all separation theories appearing in the published literature.
Starting Page	453
Ending Page	464
Page Count	12
File Format	PDF MP4
ISSN	03621340 15581160
DOI	10.1145/2578855.2535844
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	49
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Separation logic Bunched logic Hybrid logic
Content Type	Audio Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Parametric completeness for separation theories

Proof search for propositional abstract separation logics via labelled sequents

Towards a program logic for JavaScript

Classical BI:a logic for reasoning about dualising resources

High-level separation logic for low-level code

A proof system for separation logic with magic wand

Ynot:dependent types for imperative programs

Modular reasoning for deterministic parallelism

The essence of Reynolds

Parametric completeness for separation theories

Similar Documents

Parametric completeness for separation theories

Proof search for propositional abstract separation logics via labelled sequents

Towards a program logic for JavaScript

Classical BI:a logic for reasoning about dualising resources

High-level separation logic for low-level code

A proof system for separation logic with magic wand

Ynot:dependent types for imperative programs

Modular reasoning for deterministic parallelism

The essence of Reynolds

Parametric completeness for separation theories