A substructural logic for layered graphs
- Submitting institution
-
University of Aberdeen
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 92735624
- Type
- D - Journal article
- DOI
-
10.1093/logcom/exu002
- Title of journal
- Journal of Logic and Computation
- Article number
- -
- First page
- 953
- Volume
- 24
- Issue
- 4
- ISSN
- 0955-792X
- Open access status
- Out of scope for open access requirements
- Month of publication
- February
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper studies noncommutative and nonassociative generalizations of bunched logic as used as a foundation of Separation Logic which has seen stunning success in advancing formal verification over the last 20 years. The new work introduces models of separation based on graph properties rather than simple set properties. The paper appeared in a leading journal in the area. Follow-up work by collaborators appeared in the leading IJCAR 2016 and IJCAI 2017 conference proceedings and the journal Logical Methods in Computer Science.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
