On the complexity of pointer arithmetic in separation logic
From MaRDI portal
Publication:6166154
DOI10.1007/978-3-030-02768-1_18zbMath1519.68054OpenAlexW2897305418MaRDI QIDQ6166154
James Brotherston, Max I. Kanovich
Publication date: 2 August 2023
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10074307/
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
This page was built for publication: On the complexity of pointer arithmetic in separation logic