Separation logic and abstraction

By Matthew J. Parkinson, Gavin M. Bierman. ACM-SIGACT Symposium on Principles of Programming Languages, 2005

377 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/190b1a31673546e6d65653e023f5f1ce0eb7d265

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Cristiano Calcagno
2. Hongseok Yang
3. Peter W. O'Hearn
4. Reiner Hähnle
5. Matthew J. Parkinson
6. Viktor Vafeiadis
7. André Platzer
8. S. Brookes

In Computational Theory and Mathematics

1. Cristiano Calcagno
2. Peter W. O'Hearn
3. Hongseok Yang
4. Matthew J. Parkinson
5. Viktor Vafeiadis
6. S. Brookes
7. John C. Reynolds
8. Josh Berdine

Citations in the corpus

• Local Action and Abstract Separation Logic (2007, methodology): “Abstract predicates and higher-order separation logic have been used to approach modules, while the treatment here avoids higher-order predicates [26, 6].”
• Deductive Software Verification – The KeY Book (2016, methodology): “Abstraction in separation logic is achieved by abstraction predicates [Parkinson and Bierman, 2005] which serve a similar purpose as object invariants with model fields.”