| 2012 | ||
|---|---|---|
| c47 | Andrew P. Black, Peter W. O'Hearn: Presentation of the SIGPLAN distinguished achievement award to Sir Charles Antony Richard Hoare, FRS, FREng, FBCS; and interview. POPL 2012: 1-2 | |
| i1 | Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn: Verification Condition Generation and Variable Conditions in Smallfoot. CoRR abs/1204.4804 (2012) | |
| 2011 | ||
| j29 | Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang: Compositional Shape Analysis by Means of Bi-Abduction. J. ACM 58(6): 26 (2011) | |
| c46 | ||
| c45 | C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth: On Locality and the Exchange Law for Concurrent Processes. CONCUR 2011: 250-264 | |
| c44 | ||
| c43 | ||
| c42 | Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn: The Complexity of Abduction for Separated Heap Abstractions. SAS 2011: 25-42 | |
| 2010 | ||
| j28 | Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith, Hongseok Yang: Blaming the client: on data refinement in the presence of pointers. Formal Asp. Comput. 22(5): 547-583 (2010) | |
| j27 | Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang: Abstraction for concurrent objects. Theor. Comput. Sci. 411(51-52): 4379-4398 (2010) | |
| c41 | ||
| c40 | Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh: Verifying linearizability with hindsight. PODC 2010: 85-94 | |
| e1 | Gary T. Leavens, Peter W. O'Hearn, Sriram K. Rajamani (Eds.): Verified Software: Theories, Tools, Experiments, Third International Conference, VSTTE 2010, Edinburgh, UK, August 16-19, 2010. Proceedings. Lecture Notes in Computer Science 6217, Springer 2010, isbn 978-3-642-15056-2 | |
| 2009 | ||
| j26 | Ian Wehrman, C. A. R. Hoare, Peter W. O'Hearn: Graphical models of separation logic. Inf. Process. Lett. 109(17): 1001-1004 (2009) | |
| j25 | Peter W. O'Hearn, Hongseok Yang, John C. Reynolds: Separation and information hiding. ACM Trans. Program. Lang. Syst. 31(3) (2009) | |
| c39 | Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang: Abstraction for Concurrent Objects. ESOP 2009: 252-266 | |
| c38 | Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang: Compositional shape analysis by means of bi-abduction. POPL 2009: 289-300 | |
| 2008 | ||
| j24 | Tony Hoare, Peter W. O'Hearn: Separation Logic Semantics for Communicating Processes. Electr. Notes Theor. Comput. Sci. 212: 3-25 (2008) | |
| c37 | ||
| c36 | Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn: Scalable Shape Analysis for Systems Code. CAV 2008: 385-398 | |
| c35 | ||
| c34 | Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang: Space Invading Systems Code. LOPSTR 2008: 1-3 | |
| 2007 | ||
| j23 | ||
| j22 | Peter W. O'Hearn: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1-3): 271-307 (2007) | |
| c33 | Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, Hongseok Yang: Shape Analysis for Composite Data Structures. CAV 2007: 178-192 | |
| c32 | ||
| c31 | Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang: Local Action and Abstract Separation Logic. LICS 2007: 366-378 | |
| c30 | Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter W. O'Hearn: Variance analyses from invariance analyses. POPL 2007: 211-224 | |
| c29 | Matthew J. Parkinson, Richard Bornat, Peter W. O'Hearn: Modular verification of a non-blocking stack. POPL 2007: 297-302 | |
| c28 | Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang: Footprint Analysis: A Shape Analysis That Discovers Preconditions. SAS 2007: 402-418 | |
| 2006 | ||
| j21 | Cliff B. Jones, Peter W. O'Hearn, Jim Woodcock: Verified Software: A Grand Challenge. IEEE Computer 39(4): 93-95 (2006) | |
| j20 | Josh Berdine, Peter W. O'Hearn: Strong Update, Disposal, and Encapsulation in Bunched Typing. Electr. Notes Theor. Comput. Sci. 158: 81-98 (2006) | |
| c27 | Josh Berdine, Byron Cook, Dino Distefano, Peter W. O'Hearn: Automatic Termination Proofs for Programs with Shape-Shifting Heaps. CAV 2006: 386-400 | |
| c26 | ||
| c25 | Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang: Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic. SAS 2006: 182-203 | |
| c24 | Dino Distefano, Peter W. O'Hearn, Hongseok Yang: A Local Shape Analysis Based on Separation Logic. TACAS 2006: 287-302 | |
| 2005 | ||
| c23 | Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn: Symbolic Execution with Separation Logic. APLAS 2005: 52-68 | |
| c22 | Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn: Smallfoot: Modular Automatic Assertion Checking with Separation Logic. FMCO 2005: 115-137 | |
| c21 | Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, Matthew J. Parkinson: Permission accounting in separation logic. POPL 2005: 259-270 | |
| c20 | Peter W. O'Hearn: Scalable Specification and Reasoning: Challenges for Program Logic. VSTTE 2005: 116-133 | |
| 2004 | ||
| j19 | David J. Pym, Peter W. O'Hearn, Hongseok Yang: Possible worlds and resources: the semantics of BI. Theor. Comput. Sci. 315(1): 257-305 (2004) | |
| c19 | ||
| c18 | ||
| c17 | Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn: A Decidable Fragment of Separation Logic. FSTTCS 2004: 97-109 | |
| c16 | Ivana Mijajlovic, Noah Torp-Smith, Peter W. O'Hearn: Refinement and Separation Contexts. FSTTCS 2004: 421-433 | |
| c15 | Peter W. O'Hearn, Hongseok Yang, John C. Reynolds: Separation and information hiding. POPL 2004: 268-280 | |
| 2003 | ||
| j18 | ||
| j17 | Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat: Program logic and equivalence in the presence of garbage collection. Theor. Comput. Sci. 3(298): 557-581 (2003) | |
| 2002 | ||
| j16 | Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hayo Thielecke: Linear Continuation-Passing. Higher-Order and Symbolic Computation 15(2-3): 181-208 (2002) | |
| c14 | ||
| 2001 | ||
| c13 | Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn: Computability and Complexity Results for a Spatial Assertion Language for Data Structures. APLAS 2001: 289-300 | |
| c12 | Peter W. O'Hearn, John C. Reynolds, Hongseok Yang: Local Reasoning about Programs that Alter Data Structures. CSL 2001: 1-19 | |
| c11 | ||
| c10 | Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn: Computability and Complexity Results for a Spatial Assertion Language for Data Structures. FSTTCS 2001: 108-119 | |
| c9 | Samin S. Ishtiaq, Peter W. O'Hearn: BI as an Assertion Language for Mutable Data Structures. POPL 2001: 14-26 | |
| 2000 | ||
| j15 | Peter W. O'Hearn, John C. Reynolds: From Algol to polymorphic linear lambda-calculus. J. ACM 47(1): 167-223 (2000) | |
| c8 | Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O'Hearn: Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292. PPDP 2000: 190-201 | |
| 1999 | ||
| j14 | Peter W. O'Hearn, David J. Pym: The logic of bunched implications. Bulletin of Symbolic Logic 5(2): 215-244 (1999) | |
| j13 | Peter J. Freyd, Peter W. O'Hearn, A. John Power, Makoto Takeyama, R. Street, Robert D. Tennent: Bireflectivity. Theor. Comput. Sci. 228(1-2): 49-76 (1999) | |
| j12 | Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent: Syntactic Control of Interference Revisited. Theor. Comput. Sci. 228(1-2): 211-252 (1999) | |
| j11 | Peter W. O'Hearn, Uday S. Reddy: Objects, Interference, and the Yoneda Embedding. Theor. Comput. Sci. 228(1-2): 253-282 (1999) | |
| c7 | Peter W. O'Hearn: Resource Interpretations, Bunched Implications and the alpha lambda-Calculus. TLCA 1999: 258-279 | |
| 1998 | ||
| j10 | ||
| 1997 | ||
| c6 | Yoshiki Kinoshita, Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent: An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. TACS 1997: 191-212 | |
| 1996 | ||
| j9 | Peter W. O'Hearn: Note on Algol and Conservatively Extending Functional Programming. J. Funct. Program. 6(1): 171-180 (1996) | |
| 1995 | ||
| j8 | Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Bireflectivity. Electr. Notes Theor. Comput. Sci. 1: 199-213 (1995) | |
| j7 | Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Syntactic control of interference revisited. Electr. Notes Theor. Comput. Sci. 1: 447-486 (1995) | |
| j6 | Peter W. O'Hearn, Uday S. Reddy: Objects, interference and the Yoneda embedding. Electr. Notes Theor. Comput. Sci. 1: 487-514 (1995) | |
| j5 | Peter W. O'Hearn, Jon G. Riecke: Kripke Logical Relations and PCF. Inf. Comput. 120(1): 107-116 (1995) | |
| j4 | Peter W. O'Hearn, Robert D. Tennent: Parametricity and Local Variables. J. ACM 42(3): 658-709 (1995) | |
| 1994 | ||
| c5 | Peter W. O'Hearn, Jon G. Riecke: Fully Abstract Translations and Parametric Polymorphism. ESOP 1994: 454-468 | |
| 1993 | ||
| j3 | Peter W. O'Hearn, Robert D. Tennent: Semantical Analysis of Specification Logic, 2. Inf. Comput. 107(1): 25-57 (1993) | |
| j2 | Peter W. O'Hearn: A Model for Syntactic Control of Interference. Mathematical Structures in Computer Science 3(4): 435-465 (1993) | |
| c4 | Peter W. O'Hearn, Robert D. Tennent: Relational Parametricity and Local Variables. POPL 1993: 171-184 | |
| 1992 | ||
| j1 | Peter W. O'Hearn, Zbigniew Stachniak: Resolution Framework for Finitely-Valued First-Order Logics. J. Symb. Comput. 13(3): 235-254 (1992) | |
| 1991 | ||
| c3 | Peter W. O'Hearn: Linear Logic and Interference Control. Category Theory and Computer Science 1991: 74-93 | |
| 1989 | ||
| c2 | Peter W. O'Hearn, Zbigniew Stachniak: Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics. ISSAC 1989: 364-372 | |
| c1 | Peter W. O'Hearn, Zbigniew Stachniak: A Resolution Framework for Finitely-Valued First-Order Logics. SCAI 1989: 69-81 | |
Colors in the list of coauthors
Last update Thu May 23 06:03:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page