April 12, 2016 article Open access Completeness for recursive procedures in separation logic Theoretical Computer Science DOI: 10.1016/j.tcs.2016.04.004 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 10 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Beyond Concurrent Separation Logic: Who is Afraid of Completeness Proofs? 2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 0 citations Footprint Logic for Object-Oriented Components (extended paper) 2024 Formal Aspects of Computing article Computer Science Logic, programming, and type systems Open access 0 citations Dynamic Separation Logic 2023 Electronic Notes in Theoretical Informatics and Computer Science article Computer Science Logic, programming, and type systems Open access 1 citations Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic 2021 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access 3 citations 4 results References 0