Local Reasoning about Programs that Alter Data Structures
- P. O'Hearn, J. C. Reynolds, Hongseok Yang
- Computer ScienceAnnual Conference for Computer Science Logic
- 10 September 2001
An extension of Hoare's logic for reasoning about programs that alter data structures is described, based on a possible worlds model of the logic of bunched implications, and includes spatial conjunction and implication connectives alongside those of classical logic.
Compositional shape analysis by means of bi-abduction
- Cristiano Calcagno, Dino Distefano, P. O'Hearn, Hongseok Yang
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 21 January 2009
A compositional shape analysis, where each procedure is analyzed independently of its callers, based on a generalized form of abduction (inference of explanatory hypotheses) which is the basis of a new interprocedural analysis algorithm.
Local Action and Abstract Separation Logic
- Cristiano Calcagno, P. O'Hearn, Hongseok Yang
- Computer ScienceLogic in Computer Science
- 10 July 2007
Local actions provide a semantics for a generalized form of (sequential) separation logic, and it is shown that the conditions on local actions allow a general soundness proof for a separation logic for concurrency, interpreted over arbitrary separation algebras.
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
- Cristiano Calcagno, Hongseok Yang, P. O'Hearn
- Computer ScienceAsian Symposium on Programming Languages and…
- 13 December 2001
It is shown that validity, even for this restricted language, is not r.e., but that the quantifier-free sublanguage is decidable, and the complexity of model checking and validity for several fragments is considered.
A Local Shape Analysis Based on Separation Logic
- Dino Distefano, P. O'Hearn, Hongseok Yang
- Computer ScienceInternational Conference on Tools and Algorithms…
- 25 March 2006
This work describes a program analysis for linked list programs where the abstract domain uses formulae from separation logic in a manner similar to that described in the previous chapter.
Automated concolic testing of smartphone apps
- Saswat Anand, M. Naik, M. J. Harrold, Hongseok Yang
- Computer ScienceSIGSOFT FSE
- 11 November 2012
The approach is based on concolic testing and generates sequences of events automatically and systematically and alleviates the path-explosion problem by checking a condition on program executions that identifies subsumption between different event sequences.
Replicated data types: specification, verification, optimality
- S. Burckhardt, Alexey Gotsman, Hongseok Yang, M. Zawirski
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 8 January 2014
This work proposes a framework for specifying replicated data types using relations over events and verifying their implementations using replication-aware simulations, and shows how to specify consistency of replicated stores with multiple objects axiomatically, in analogy to prior work on weak memory models.
Shape Analysis for Composite Data Structures
- Josh Berdine, Cristiano Calcagno, Hongseok Yang
- Computer ScienceInternational Conference on Computer Aided…
- 3 July 2007
A shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs and introduces the use of generic higher-order inductive predicates describing spatial relationships together with a method of synthesizing new parameterized spatial predicates which can be used in combination with the higher- order predicates.
Views: compositional reasoning for concurrent programs
- Thomas Dinsdale-Young, L. Birkedal, P. Gardner, Matthew J. Parkinson, Hongseok Yang
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 23 January 2013
This paper presents the "Concurrent Views Framework", a metatheory of concurrent reasoning principles that proves each of these systems is sound without requiring induction on the operational semantics.
Abstraction for concurrent objects
- Ivana Filipovic, P. O'Hearn, N. Rinetzky, Hongseok Yang
- Computer ScienceTheoretical Computer Science
- 28 March 2009
...
...