OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Why Separation Logic Works
David Pym, Jonathan Spring, Peter W. O’Hearn
Philosophy & Technology (2018) Vol. 32, Iss. 3, pp. 483-516
Open Access | Times Cited: 19

Showing 19 citing articles:

An analysis of how many undiscovered vulnerabilities remain in information systems
Jonathan Spring
Computers & Security (2023) Vol. 131, pp. 103191-103191
Open Access | Times Cited: 12

Practicing a Science of Security
Jonathan Spring, Tyler Moore, David Pym
(2017), pp. 1-18
Closed Access | Times Cited: 33

The power of modal separation logics
Stéphane Demri, Raul Fervari
Journal of Logic and Computation (2019) Vol. 29, Iss. 8, pp. 1139-1184
Open Access | Times Cited: 11

On Malfunction, Mechanisms and Malware Classification
Giuseppe Primiero, Frida J. Solheim, Jonathan Spring
Philosophy & Technology (2018) Vol. 32, Iss. 2, pp. 339-362
Closed Access | Times Cited: 11

Axiomatising Logics with Separating Conjunction and Modalities
Stéphane Demri, Raul Fervari, Alessio Mansutti
Lecture notes in computer science (2019), pp. 692-708
Open Access | Times Cited: 10

A Complete Axiomatisation for Quantifier-Free Separation Logic
Stéphane Demri, Étienne Lozes, Alessio Mansutti
Logical Methods in Computer Science (2021) Vol. Volume 17, Issue 3
Open Access | Times Cited: 5

Formal Verification of Data Modifications in Cloud Block Storage Based on Separation Logic
Bowen Zhang, Jin Zhao, Hanpin Wang, et al.
Chinese Journal of Electronics (2024) Vol. 33, Iss. 1, pp. 112-127
Open Access

A refinement to the general mechanistic account
Eric Hatleback, Jonathan Spring
European Journal for Philosophy of Science (2019) Vol. 9, Iss. 2
Open Access | Times Cited: 3

Verification of dynamic bisimulation theorems in Coq
Raul Fervari, Francisco Trucco, Beta Ziliani
Journal of Logical and Algebraic Methods in Programming (2021) Vol. 120, pp. 100642-100642
Closed Access | Times Cited: 3

An adaptation-complete proof system for local reasoning about cloud storage systems
Jin Zhao, Bowen Zhang, Lei Zhang, et al.
Theoretical Computer Science (2021) Vol. 903, pp. 39-73
Closed Access | Times Cited: 3

Towards Scientific Incident Response
Jonathan Spring, David Pym
Lecture notes in computer science (2018), pp. 398-417
Closed Access | Times Cited: 2

Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq
Raul Fervari, Francisco Trucco, Beta Ziliani
Lecture notes in computer science (2020), pp. 3-18
Closed Access | Times Cited: 1

A Complete Axiomatisation for Quantifier-Free Separation Logic
Stéphane Demri, Étienne Lozes, Alessio Mansutti
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 1

Internal proof calculi for modal logics with separating conjunction
Stéphane Demri, Raul Fervari, Alessio Mansutti
Journal of Logic and Computation (2021) Vol. 31, Iss. 3, pp. 832-891
Open Access | Times Cited: 1

The Inner and Outer Algebras of Unified Concurrency
Andrew Butterfield
Lecture notes in computer science (2019), pp. 157-175
Closed Access

Internal Calculi for Separation Logics
Stéphane Demri, Étienne Lozes, Alessio Mansutti
arXiv (Cornell University) (2019)
Closed Access

Reasoning about block-based cloud storage systems via separation logic
Jin Zhao, Bowen Zhang, Tianyue Cao, et al.
Theoretical Computer Science (2022) Vol. 936, pp. 43-76
Closed Access

The Origins of Cyberspace
David Pym
Oxford University Press eBooks (2021), pp. 7-31
Closed Access

Page 1

Scroll to top