default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosh Berdine
Person information
- affiliation: Facebook
- affiliation: Microsoft Research
- affiliation: Queen Mary University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c29]Azalea Raad, Julien Vanegue, Josh Berdine, Peter W. O'Hearn:
A General Approach to Under-Approximate Reasoning About Concurrent Programs. CONCUR 2023: 25:1-25:17- 2022
- [j3]Quang Loc Le
, Azalea Raad, Jules Villard, Josh Berdine, Derek Dreyer, Peter W. O'Hearn:
Finding real bugs in big programs with incorrectness logic. Proc. ACM Program. Lang. 6(OOPSLA1): 1-27 (2022) - [j2]Azalea Raad, Josh Berdine, Derek Dreyer, Peter W. O'Hearn:
Concurrent incorrectness separation logic. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - 2020
- [c28]Azalea Raad, Josh Berdine, Hoang-Hai Dang, Derek Dreyer, Peter W. O'Hearn, Jules Villard:
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic. CAV (2) 2020: 225-252
2010 – 2019
- 2015
- [c27]Aws Albarghouthi, Josh Berdine, Byron Cook, Zachary Kincaid:
Spatial Interpolants. ESOP 2015: 634-660 - [c26]Alexey Bakhirkin, Josh Berdine, Nir Piterman:
A Forward Analysis for Recurrent Sets. SAS 2015: 293-311 - [i2]Aws Albarghouthi, Josh Berdine, Byron Cook, Zachary Kincaid:
Spatial Interpolants. CoRR abs/1501.04100 (2015) - 2014
- [c25]Josh Berdine, Nikolaj S. Bjørner:
Computing All Implied Equalities via SMT-Based Partition Refinement. IJCAR 2014: 168-183 - [c24]Alexey Bakhirkin, Josh Berdine, Nir Piterman:
Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction. SAS 2014: 34-50 - 2013
- [c23]Josh Berdine, Nikolaj S. Bjørner, Samin Ishtiaq, Jael E. Kriener, Christoph M. Wintersteiger:
Resourceful Reachability as HORN-LA. LPAR 2013: 137-146 - [e1]Roberto Giacobazzi, Josh Berdine, Isabella Mastroeni:
Verification, Model Checking, and Abstract Interpretation, 14th International Conference, VMCAI 2013, Rome, Italy, January 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7737, Springer 2013, ISBN 978-3-642-35872-2 [contents] - 2012
- [c22]Josh Berdine, Arlen Cox, Samin Ishtiaq, Christoph M. Wintersteiger:
Diagnosing Abstraction Failure for Separation Logic-Based Analyses. CAV 2012: 155-173 - [i1]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Verification Condition Generation and Variable Conditions in Smallfoot. CoRR abs/1204.4804 (2012) - 2011
- [c21]Josh Berdine, Byron Cook, Samin Ishtiaq:
SLAyer: Memory Safety for Systems-Level Code. CAV 2011: 178-183 - [c20]Alexey Gotsman, Josh Berdine, Byron Cook:
Precision and the Conjunction Rule in Concurrent Separation Logic. MFPS 2011: 171-190 - 2010
- [c19]Aleksandar Nanevski, Viktor Vafeiadis, Josh Berdine:
Structuring the verification of heap-manipulating programs. POPL 2010: 261-274
2000 – 2009
- 2009
- [c18]Josh Berdine:
Automatic Verification of Heap Manipulation Using Separation Logic. SOFSEM 2009: 34 - 2008
- [c17]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 - [c16]Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv:
Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413 - [c15]M. Ridsdale, Mateja Jamnik, Nick Benton, Josh Berdine:
Diagrammatic Reasoning in Separation Logic. Diagrams 2008: 408-411 - [c14]Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine:
Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377 - 2007
- [c13]Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv:
Local Reasoning for Storable Locks and Threads. APLAS 2007: 19-37 - [c12]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 - [c11]Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv:
Thread-modular shape analysis. PLDI 2007: 266-277 - [c10]Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter W. O'Hearn:
Variance analyses from invariance analyses. POPL 2007: 211-224 - [c9]Josh Berdine:
Local reasoning about storable locks. PPDP 2007: 153 - [c8]Stephen Magill, Josh Berdine, Edmund M. Clarke, Byron Cook:
Arithmetic Strengthening for Shape Analysis. SAS 2007: 419-436 - [c7]Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv:
Shape Analysis by Graph Decomposition. TACAS 2007: 3-18 - 2006
- [c6]Josh Berdine, Byron Cook, Dino Distefano, Peter W. O'Hearn:
Automatic Termination Proofs for Programs with Shape-Shifting Heaps. CAV 2006: 386-400 - [c5]Alexey Gotsman, Josh Berdine, Byron Cook:
Interprocedural Shape Analysis with Separated Heap Abstractions. SAS 2006: 240-260 - [c4]Josh Berdine, Peter W. O'Hearn:
Strong Update, Disposal, and Encapsulation in Bunched Typing. MFPS 2006: 81-98 - 2005
- [c3]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Symbolic Execution with Separation Logic. APLAS 2005: 52-68 - [c2]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Smallfoot: Modular Automatic Assertion Checking with Separation Logic. FMCO 2005: 115-137 - 2004
- [c1]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
A Decidable Fragment of Separation Logic. FSTTCS 2004: 97-109 - 2002
- [j1]Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hayo Thielecke:
Linear Continuation-Passing. High. Order Symb. Comput. 15(2-3): 181-208 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
