Peter W. O'Hearn

发表

Modular verification of a non-blocking stack

Peter W. O'Hearn, Richard Bornat, Matthew J. Parkinson, 2007, POPL '07.

Peter W. O'Hearn, P. O'Hearn, 2008, ICLP.

Peter W. O'Hearn, John Power, Makoto Takeyama, 1995, MFPS.

COSMICAH 2005: workshop on verification of COncurrent Systems with dynaMIC Allocated Heaps (a Satellite event of ICALP 2005) - Informal Proceedings

Peter W. O'Hearn, Dino Distefano, Radu Iosif, 2013 .

Objects, interference and the Yoneda embedding

Peter W. O'Hearn, Uday S. Reddy, 1995, MFPS.

Lectures on Separation Logic

Peter W. O'Hearn, P. O'Hearn, 2009 .

A Primer on Separation Logic (and Automatic Program Verification and Analysis)

Peter W. O'Hearn, P. O'Hearn, 2012, Software Safety and Security.

Compositional Shape Analysis by Means of Bi-Abduction

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2011, JACM.

Program logic and equivalence in the presence of garbage collection

Peter W. O'Hearn, Richard Bornat, Cristiano Calcagno, 2003, Theor. Comput. Sci..

On Garbage and Program Logic

Peter W. O'Hearn, Cristiano Calcagno, 2001, FoSSaCS.

Resources, concurrency, and local reasoning

Peter W. O'Hearn, P. O'Hearn, 2007 .

Resources, Concurrency, and Local Reasoning (Abstract)

Peter W. O'Hearn, P. O'Hearn, 2004, ESOP.

Scalable Specification and Reasoning: Challenges for Program Logic

Peter W. O'Hearn, P. O'Hearn, 2005, VSTTE.

Syntactic control of interference revisited

Peter W. O'Hearn, John Power, Makoto Takeyama, 1995, MFPS.

Scalable Shape Analysis for Systems Code

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2008, CAV.

Abductive, Inductive and Deductive Reasoning about Resources

Peter W. O'Hearn, 2010, CSL.

Notes on Separation Logic for Shared-variable Concurrency

Peter W. O'Hearn, 2002 .

BI as an assertion language for mutable data structures

Peter W. O'Hearn, Samin S. Ishtiaq, P. O'Hearn, 2001, POPL '01.

Variance analyses from invariance analyses

Peter W. O'Hearn, Byron Cook, Josh Berdine, 2007, POPL '07.

An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement

Peter W. O'Hearn, John Power, Makoto Takeyama, 1997, TACS.

Continuous Reasoning: Scaling the impact of formal methods

Peter W. O'Hearn, P. O'Hearn, 2018, LICS.

Abstraction for concurrent objects

Peter W. O'Hearn, Hongseok Yang, Noam Rinetzky, 2009, Theor. Comput. Sci..

On the relation between Concurrent Separation Logic and Concurrent Kleene Algebra

Peter W. O'Hearn, Akbar Hussain, Rasmus Lerchedahl Petersen, 2015, J. Log. Algebraic Methods Program..

Fully Abstract Translations and Parametric Polymorphism

Peter W. O'Hearn, Jon G. Riecke, 1994, ESOP.

ALGOL and functional programming

Peter W. O'Hearn, 1997 .

A Local Shape Analysis Based on Separation Logic

Peter W. O'Hearn, Hongseok Yang, Dino Distefano, 2006, TACAS.

Verified Software: A Grand Challenge

Peter W. O'Hearn, Cliff B. Jones, Jim Woodcock, 2006, Computer.

Polymorphism, objects and abstract types

Peter W. O'Hearn, P. O'Hearn, 1998, SIGA.

On Locality and the Exchange Law for Concurrent Processes

Georg Struth, Peter W. O'Hearn, C. A. R. Hoare, 2011, CONCUR.

Reasoning about Shared Mutable Data Structure

Peter W. O'Hearn, John C. Reynolds, 2001 .

A Decidable Fragment of Separation Logic

Peter W. O'Hearn, Cristiano Calcagno, Josh Berdine, 2004, FSTTCS.

The Essence of Reynolds

Peter W. O'Hearn, Uday S. Reddy, Stephen Brookes, 2014, Formal Aspects of Computing.

Embracing Overapproximation for Proving Nontermination

Peter W. O'Hearn, Kaustubh Nimkar, Carsten Fuhs, 2015, Tiny Trans. Comput. Sci..

Symbolic Execution with Separation Logic

Peter W. O'Hearn, Cristiano Calcagno, Josh Berdine, 2005, APLAS.

From Categorical Logic to Facebook Engineering

Peter W. O'Hearn, P. O'Hearn, 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

Concurrent separation logic

Peter W. O'Hearn, Stephen Brookes, P. O'Hearn, 2016, SIGL.

Footprint Analysis: A Shape Analysis That Discovers Preconditions

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2007, SAS.

Separation Logic and Program Analysis

Peter W. O'Hearn, 2006, SAS.

Compositional Shape Analysis by Means of Bi-Abduction

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2011, JACM.

Logics for Resources, Processes and Programs

Peter W. O'Hearn, David J. Pym, Didier Galmiche, 2004 .

A Semantic Basis for Local Reasoning

Peter W. O'Hearn, Hongseok Yang, 2002, FoSSaCS.

Automatic Termination Proofs for Programs with Shape-Shifting Heaps

Peter W. O'Hearn, Byron Cook, Josh Berdine, 2006, CAV.

From Start-ups to Scale-ups: Opportunities and Open Problems for Static and Dynamic Program Analysis

Peter W. O'Hearn, Mark Harman, M. Harman, 2018, 2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM).

Smallfoot: Modular Automatic Assertion Checking with Separation Logic

Peter W. O'Hearn, Cristiano Calcagno, Josh Berdine, 2005, FMCO.

Presentation of the SIGPLAN distinguished achievement award to Sir Charles Antony Richard Hoare, FRS, FREng, FBCS; and interview

Peter W. O'Hearn, Andrew P. Black, 2012, POPL '12.

Local Action and Abstract Separation Logic

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

The Logic of Bunched Implications

Peter W. O'Hearn, David J. Pym, P. O'Hearn, 1999, Bulletin of Symbolic Logic.

Linearly Used Continuations

Peter W. O'Hearn, Hayo Thielecke, Josh Berdine, 2000 .

Semantics of noninterference: a natural approach

Peter W. O'Hearn, 1992 .

Refinement and Separation Contexts

Peter W. O'Hearn, Ivana Mijajlovic, Noah Torp-Smith, 2004, FSTTCS.

Algol-like Languages

Peter W. O'Hearn, R. D. Tennent, 1997, Progress in Theoretical Computer Science.

Session details: Award presentation and interview

Peter W. O'Hearn, Andrew P. Black, A. Black, 2012 .

Separation Logic Semantics for Communicating Processes

Peter W. O'Hearn, C. A. R. Hoare, P. O'Hearn, 2008, FICS.

Blaming the client: on data refinement in the presence of pointers

Peter W. O'Hearn, Hongseok Yang, Noah Torp-Smith, 2009, Formal Aspects of Computing.

Introduction to ALGOL-like languages

Peter W. O'Hearn, Richard D. Tennent, 1997 .

Parametricity and local variables

Peter W. O'Hearn, Robert D. Tennent, 1995, JACM.

Semantical Analysis of Specification Logic, 2

Peter W. O'Hearn, Robert D. Tennent, 1993, Inf. Comput..

BI as an assertion language for mutable data structures

Peter W. O'Hearn, Samin Ishtiaq, P. O'Hearn, 2001, POPL '01.

Verification Condition Generation and Variable Conditions in Smallfoot pdf

Peter W. O'Hearn, Cristiano Calcagno, Josh Berdine, 2012, ArXiv.

Moving Fast with Software Verification

Peter W. O'Hearn, Cristiano Calcagno, Dulma Rodriguez, 2015, NFM.

Local Reasoning about Programs that Alter Data Structures

Peter W. O'Hearn, Hongseok Yang, John C. Reynolds, 2001, CSL.

Linear Continuation-Passing

Peter W. O'Hearn, Hayo Thielecke, Uday S. Reddy, 2002, High. Order Symb. Comput..

Abstraction for Concurrent Objects

Peter W. O'Hearn, Hongseok Yang, Noam Rinetzky, 2009, ESOP.

Session details: Semantics

Peter W. O'Hearn, 2013 .

Reasoning about Programs Using a Scientific Method

Peter W. O'Hearn, 2011, ICFEM.

Chapter 18 Syntactic Control of Interference Revisited

Peter W. O'Hearn, Makoto Takeyama, R. D. Tennent, 1997 .

Algebra, Logic, Locality, Concurrency

Peter W. O'Hearn, P. O'Hearn, 2011, APLAS.

Disproving termination with overapproximation

Peter W. O'Hearn, Kaustubh Nimkar, Carsten Fuhs, 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).

Computability and Complexity Results for a Spatial Assertion Language for Data Structures

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2001, APLAS.

Syntactic Control of Interference Revisited

Peter W. O'Hearn, John Power, Makoto Takeyama, 1999, Theor. Comput. Sci..

Algebra, Logic, Locality, Concurrency

Peter W. O'Hearn, 2011, APLAS.

Scaling static analyses at Facebook

Peter W. O'Hearn, Manuel Fähndrich, Francesco Logozzo, 2019, Commun. ACM.

Graphical models of separation logic

Peter W. O'Hearn, C. A. R. Hoare, Ian Wehrman, 2009, Inf. Process. Lett..

Tutorial on Separation Logic (Invited Tutorial)

Peter W. O'Hearn, 2008, CAV.

A Model for Syntactic Control of Interference

Peter W. O'Hearn, 1993, Math. Struct. Comput. Sci..

Formal reasoning and the hacker way (keynote)

Peter W. O'Hearn, 2020, SOAP@PLDI.

Resolution Framework for Finitely-Valued First-Order Logics

Peter W. O'Hearn, Zbigniew Stachniak, 1992, J. Symb. Comput..

RacerD: compositional static race detection

Peter W. O'Hearn, Ilya Sergey, Nikos Gorogiannis, 2018, Proc. ACM Program. Lang..

Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2006, SAS.

Shape Analysis for Composite Data Structures

Peter W. O'Hearn, Thomas Wies, Hongseok Yang, 2007, CAV.

Verified Software: Theories, Tools, Experiments, Third International Conference, VSTTE 2010, Edinburgh, UK, August 16-19, 2010. Proceedings

Peter W. O'Hearn, Sriram K. Rajamani, Gary T. Leavens, 2010, VSTTE.

Separation and information hiding

Peter W. O'Hearn, Hongseok Yang, John C. Reynolds, 2004, POPL.

Permission accounting in separation logic

Peter W. O'Hearn, Richard Bornat, Matthew J. Parkinson, 2005, POPL '05.

Algol-Like Languages: v. 2

Peter W. O'Hearn, R. D. Tennent, 1996 .

Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic

Peter W. O'Hearn, Cristiano Calcagno, Samin S. Ishtiaq, 2000, PPDP '00.

Kripke Logical Relations and PCF

Peter W. O'Hearn, Jon G. Riecke, 1995, Inf. Comput..

Space Invading Systems Code

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2009, LOPSTR.

Linear Logic and Interference Control

Peter W. O'Hearn, 1991, Category Theory and Computer Science.

Relational parametricity and local variables

Peter W. O'Hearn, Robert D. Tennent, 1993, POPL '93.

ALGOL-like Languages, Volume 1

Peter W. O'Hearn, R. D. Tennent, R. D. Tennent, 1997 .

Note on theorem proving strategies for resolution counterparts of non-classical logics

Peter W. O'Hearn, Zbigniew Stachniak, 1989, ISSAC '89.

Resources, Concurrency and Local Reasoning

Peter W. O'Hearn, P. O'Hearn, 2004, CONCUR.

From Algol to polymorphic linear lambda-calculus

Peter W. O'Hearn, John C. Reynolds, J. C. Reynolds, 2000, JACM.

Separation logic

Peter W. O'Hearn, P. O'Hearn, 2019, Commun. ACM.

The Complexity of Abduction for Separated Heap Abstractions

Peter W. O'Hearn, Max I. Kanovich, Nikos Gorogiannis, 2011, SAS.

Proving Nontermination via Safety

Peter W. O'Hearn, Kaustubh Nimkar, Carsten Fuhs, 2014, TACAS.

On Scalable Shape Analysis

Peter W. O'Hearn, Hongseok Yang, Cristiano Calcagno, 2007 .

Objects, Interference, and the Yoneda Embedding

Peter W. O'Hearn, Uday S. Reddy, 1999, Theor. Comput. Sci..

09301 Executive Summary - Typing, Analysis, and Verification of Heap-Manipulating Programs

Peter W. O'Hearn, Arnd Poetzsch-Heffter, Shmuel Sagiv, 2009, Typing, Analysis and Verification of Heap-Manipulating Programs.

A true positives theorem for a static race detector

Peter W. O'Hearn, Ilya Sergey, Nikos Gorogiannis, 2018, Proc. ACM Program. Lang..

Experience Developing and Deploying Concurrency Analysis at Facebook

Peter W. O'Hearn, 2018, SAS.

Strong Update, Disposal, and Encapsulation in Bunched Typing

Peter W. O'Hearn, Josh Berdine, 2006, MFPS.

Possible worlds and resources: the semantics of BI

Peter W. O'Hearn, Hongseok Yang, David J. Pym, 2004, Theor. Comput. Sci..

09301 Abstracts Collection - Typing, Analysis, and Verification of Heap-Manipulating Programs

Peter W. O'Hearn, Arnd Poetzsch-Heffter, Shmuel Sagiv, 2009, Typing, Analysis and Verification of Heap-Manipulating Programs.

Resource Interpretations, Bunched Implications and the alpha lambda-Calculus

Peter W. O'Hearn, P. O'Hearn, 1999, TLCA.

Note on Algol and Conservatively Extending Functional Programming

Peter W. O'Hearn, 1996, J. Funct. Program..

Proceedings of the Third international conference on Verified software: theories, tools, experiments

Peter W. O'Hearn, Gary T. Leavens, Sriram K. Rajamani, 2010 .

The essence of Reynolds

Peter W. O'Hearn, Uday S. Reddy, Stephen Brookes, 2014, POPL.

On bunched typing

Peter W. O'Hearn, 2003, J. Funct. Program..

On Algebra of Program Correctness and Incorrectness

Peter W. O'Hearn, C. A. R. Hoare, Bernhard Möller, 2021, RAMiCS.

Applying formal verification to microkernel IPC at meta

Peter W. O'Hearn, Francesco Zappa Nardelli, Quentin Carbonneaux, 2022, CPP.

Computability and Complexity Results for a SpatialAssertion Language for Data

Peter W. O'Hearn, Hongseok Yang, 2001 .

On Affine Typing and Completeness of CPS

Peter W. O'Hearn, Hayo Thielecke, Josh Berdine, 2001 .