Skip to main content
Conference ProceedingsOPEN ACCESS

An overview of separation logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4171 LNCS 460-469
DOI: 10.1007/978-3-540-69149-5_49
9Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

After some general remarks about program verification, we introduce separation logic, a novel extension of Hoare logic that can strengthen the applicability and scalability of program verification for imperative programs that use shared mutable data structures or sharedmemory concurrency. © IFIP International Federation for Information Processing 2008.

Cite

CITATION STYLE

APA

Reynolds, J. C. (2008). An overview of separation logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4171 LNCS, pp. 460–469). https://doi.org/10.1007/978-3-540-69149-5_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free