| Local reasoning about programs that alter data structures P O’Hearn, J Reynolds, H Yang International Workshop on Computer Science Logic, 1-19, 2001 | 890 | 2001 |
| BI as an assertion language for mutable data structures SS Ishtiaq, PW O'hearn Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of …, 2001 | 811 | 2001 |
| Resources, concurrency, and local reasoning PW O’hearn Theoretical Computer Science 375 (1), 271-307, 2007 | 775 | 2007 |
| The logic of bunched implications PW O'Hearn, DJ Pym Bulletin of Symbolic Logic, 215-244, 1999 | 613 | 1999 |
| Compositional shape analysis by means of bi-abduction C Calcagno, D Distefano, PW O’hearn, H Yang Journal of the ACM (JACM) 58 (6), 26, 2011 | 530 | 2011 |
| Smallfoot: Modular automatic assertion checking with separation logic J Berdine, C Calcagno, PW O’hearn International Symposium on Formal Methods for Components and Objects, 115-137, 2005 | 480 | 2005 |
| Permission accounting in separation logic R Bornat, C Calcagno, P O'Hearn, M Parkinson Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of …, 2005 | 446 | 2005 |
| A local shape analysis based on separation logic D Distefano, PW O’hearn, H Yang International Conference on Tools and Algorithms for the Construction and …, 2006 | 409 | 2006 |
| Symbolic execution with separation logic J Berdine, C Calcagno, PW O’hearn Asian Symposium on Programming Languages and Systems, 52-68, 2005 | 400 | 2005 |
| Separation and information hiding PW O'Hearn, H Yang, JC Reynolds ACM Transactions on Programming Languages and Systems (TOPLAS) 31 (3), 1-50, 2009 | 351 | 2009 |
| Scalable shape analysis for systems code H Yang, O Lee, J Berdine, C Calcagno, B Cook, D Distefano, P O’Hearn International Conference on Computer Aided Verification, 385-398, 2008 | 310 | 2008 |
| Local action and abstract separation logic C Calcagno, PW O'Hearn, H Yang 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 366-378, 2007 | 284 | 2007 |
| Shape analysis for composite data structures J Berdine, C Calcagno, B Cook, D Distefano, PW O’hearn, T Wies, ... International Conference on Computer Aided Verification, 178-192, 2007 | 271 | 2007 |
| A decidable fragment of separation logic J Berdine, C Calcagno, PW O’hearn International Conference on Foundations of Software Technology and …, 2004 | 249 | 2004 |
| Moving fast with software verification C Calcagno, D Distefano, J Dubreil, D Gabi, P Hooimeijer, M Luca, ... NASA Formal Methods Symposium, 3-11, 2015 | 222 | 2015 |
| Computability and complexity results for a spatial assertion language for data structures C Calcagno, H Yang, PW O’hearn International Conference on Foundations of Software Technology and …, 2001 | 189 | 2001 |
| Possible worlds and resources: the semantics of BI DJ Pym, PW O'Hearn, H Yang Theoretical Computer Science 315 (1), 257-305, 2004 | 184 | 2004 |
| A semantic basis for local reasoning H Yang, P O’Hearn International Conference on Foundations of Software Science and Computation …, 2002 | 176 | 2002 |
| Abstraction for concurrent objects I Filipović, P O’Hearn, N Rinetzky, H Yang Theoretical Computer Science 411 (51), 4379-4398, 2010 | 175 | 2010 |
| Parametricity and local variables PW O’Hearn, RD Tennent Algol-like Languages, 109-163, 1997 | 161 | 1997 |
Hongseok YangProfessor, School of Computing, KAISTVerified email at kaist.ac.kr
