Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarHongseok Yang
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
[c64]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A convenient category for higher-order probability theory. LICS 2017: 1-12- [e2]Hongseok Yang:
Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings. Lecture Notes in Computer Science 10201, Springer 2017, ISBN 978-3-662-54433-4 [contents] - [i10]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A Convenient Category for Higher-Order Probability Theory. CoRR abs/1701.02547 (2017) - [i9]Andrea Cerone, Alexey Gotsman, Hongseok Yang:
Algebraic Laws for Weak Consistency. CoRR abs/1702.06028 (2017) - 2016
- [j20]Hila Peleg, Sharon Shoham, Eran Yahav, Hongseok Yang:
Symbolic automata for representing big code. Acta Inf. 53(4): 327-356 (2016) - [j19]Hakjoo Oh, Wonchan Lee, Kihong Heo, Hongseok Yang, Kwangkeun Yi:
Selective X-Sensitive Analysis Guided by Impact Pre-Analysis. ACM Trans. Program. Lang. Syst. 38(2): 6:1-6:45 (2016) - [c63]Mahsa Najafzadeh, Alexey Gotsman, Hongseok Yang, Carla Ferreira, Marc Shapiro:
The CISE tool: proving weakly-consistent applications correct. PaPoC@EuroSys 2016: 2:1-2:3 - [c62]David Tolpin, Jan-Willem van de Meent, Hongseok Yang, Frank Wood:
Design and Implementation of Probabilistic Programming Language Anglican. IFL 2016: 6:1-6:12 - [c61]Sam Staton, Hongseok Yang, Frank Wood, Chris Heunen, Ohad Kammar:
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. LICS 2016: 525-534 - [c60]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and Complexity of Collaborative Text Editing. PODC 2016: 259-268 - [c59]Alexey Gotsman, Hongseok Yang, Carla Ferreira, Mahsa Najafzadeh, Marc Shapiro:
'Cause I'm strong enough: reasoning about consistency choices in distributed systems. POPL 2016: 371-384 - [c58]Radu Grigore, Hongseok Yang:
Abstraction refinement guided by a learnt probabilistic model. POPL 2016: 485-498 - [c57]Kihong Heo, Hakjoo Oh, Hongseok Yang:
Learning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static Analysis. SAS 2016: 237-256 - [i8]Sam Staton, Hongseok Yang, Chris Heunen, Ohad Kammar, Frank Wood:
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. CoRR abs/1601.04943 (2016) - [i7]Mike Wu, Yura N. Perov, Frank Wood, Hongseok Yang:
Spreadsheet Probabilistic Programming. CoRR abs/1606.04216 (2016) - [i6]David Tolpin, Jan-Willem van de Meent, Hongseok Yang, Frank Wood:
Design and Implementation of Probabilistic Programming Language Anglican. CoRR abs/1608.05263 (2016) - [i5]Kwonsoo Chae, Hakjoo Oh, Kihong Heo, Hongseok Yang:
Automatically generating features for learning program analysis heuristics. CoRR abs/1612.09394 (2016) - 2015
- [c56]Jan-Willem van de Meent, Hongseok Yang, Vikash Mansinghka, Frank Wood:
Particle Gibbs with Ancestor Sampling for Probabilistic Programs. AISTATS 2015 - [c55]
- [c54]Hakjoo Oh, Hongseok Yang, Kwangkeun Yi:
Learning a strategy for adapting a program analysis via bayesian optimisation. OOPSLA 2015: 572-588 - [c53]Ghila Castelnuovo, Mayur Naik, Noam Rinetzky, Mooly Sagiv, Hongseok Yang:
Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis. SAS 2015: 252-274 - [c52]Andrea Cerone, Alexey Gotsman, Hongseok Yang:
Transaction Chopping for Parallel Snapshot Isolation. DISC 2015: 388-404 - [i4]Jan-Willem van de Meent, Hongseok Yang, Vikash Mansinghka, Frank Wood:
Particle Gibbs with Ancestor Sampling for Probabilistic Programs. CoRR abs/1501.06769 (2015) - [i3]Radu Grigore, Hongseok Yang:
Abstraction Refinement Guided by a Learnt Probabilistic Model. CoRR abs/1511.01874 (2015) - 2014
- [c51]Ravi Mangal, Mayur Naik, Hongseok Yang:
A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join. ESOP 2014: 513-533 - [c50]
- [c49]Xin Zhang, Ravi Mangal, Radu Grigore, Mayur Naik, Hongseok Yang:
On abstraction refinement for program analyses in Datalog. PLDI 2014: 239-248 - [c48]Xin Zhang, Ravi Mangal, Mayur Naik, Hongseok Yang:
Hybrid top-down and bottom-up interprocedural analysis. PLDI 2014: 249-258 - [c47]Hakjoo Oh, Wonchan Lee, Kihong Heo, Hongseok Yang, Kwangkeun Yi:
Selective context-sensitivity guided by impact pre-analysis. PLDI 2014: 475-484 - [c46]Sebastian Burckhardt, Alexey Gotsman, Hongseok Yang, Marek Zawirski:
Replicated data types: specification, verification, optimality. POPL 2014: 271-284 - 2013
- [j18]Alexey Gotsman, Hongseok Yang:
Linearizability with Ownership Transfer. Logical Methods in Computer Science 9(3) (2013) - [j17]Alexey Gotsman, Hongseok Yang:
Modular verification of preemptive OS kernels. J. Funct. Program. 23(4): 452-514 (2013) - [j16]Jan Schwinghammer, Lars Birkedal, François Pottier, Bernhard Reus, Kristian Støvring, Hongseok Yang:
A step-indexed Kripke model of hidden state. Mathematical Structures in Computer Science 23(1): 1-54 (2013) - [c45]Alexey Gotsman, Noam Rinetzky, Hongseok Yang:
Verifying Concurrent Memory Reclamation Algorithms with Grace. ESOP 2013: 249-269 - [c44]Xin Zhang, Mayur Naik, Hongseok Yang:
Finding optimum abstractions in parametric dataflow analysis. PLDI 2013: 365-376 - [c43]Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew J. Parkinson, Hongseok Yang:
Views: compositional reasoning for concurrent programs. POPL 2013: 287-300 - [c42]Hila Peleg, Sharon Shoham, Eran Yahav, Hongseok Yang:
Symbolic Automata for Static Specification Mining. SAS 2013: 63-83 - 2012
- [j15]Jacob Thamsborg, Lars Birkedal, Hongseok Yang:
Two for the Price of One: Lifting Separation Logic Assertions. Logical Methods in Computer Science 8(3) (2012) - [j14]Oukseh Lee, Hongseok Yang, Rasmus Petersen:
A divide-and-conquer approach for analysing overlaid data structures. Formal Methods in System Design 41(1): 4-24 (2012) - [c41]
- [c40]Sebastian Burckhardt, Alexey Gotsman, Madanlal Musuvathi, Hongseok Yang:
Concurrent Library Correctness on the TSO Memory Model. ESOP 2012: 87-107 - [c39]Mayur Naik, Hongseok Yang, Ghila Castelnuovo, Mooly Sagiv:
Abstractions from tests. POPL 2012: 373-386 - [c38]Saswat Anand, Mayur Naik, Mary Jean Harrold, Hongseok Yang:
Automated concolic testing of smartphone apps. SIGSOFT FSE 2012: 59 - [c37]Alexey Gotsman, Madanlal Musuvathi, Hongseok Yang:
Show No Weakness: Sequentially Consistent Specifications of TSO Libraries. DISC 2012: 31-45 - 2011
- [j13]Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang:
Nested Hoare Triples and Frame Rules for Higher-order Store. Logical Methods in Computer Science 7(3) (2011) - [j12]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Compositional Shape Analysis by Means of Bi-Abduction. J. ACM 58(6): 26:1-26:66 (2011) - [c36]Oukseh Lee, Hongseok Yang, Rasmus Petersen:
Program Analysis for Overlaid Data Structures. CAV 2011: 592-608 - [c35]
- [c34]
- [c33]Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang:
Step-indexed kripke models over recursive worlds. POPL 2011: 119-132 - [e1]Hongseok Yang:
Programming Languages and Systems - 9th Asian Symposium, APLAS 2011, Kenting, Taiwan, December 5-7, 2011. Proceedings. Lecture Notes in Computer Science 7078, Springer 2011, ISBN 978-3-642-25317-1 [contents] - 2010
- [j11]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) - [j10]Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang:
Abstraction for concurrent objects. Theor. Comput. Sci. 411(51-52): 4379-4398 (2010) - [c32]
- [c31]Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus:
A Semantic Foundation for Hidden State. FOSSACS 2010: 2-17
2000 – 2009
- 2009
- [j9]Peter W. O'Hearn, Hongseok Yang, John C. Reynolds:
Separation and information hiding. ACM Trans. Program. Lang. Syst. 31(3): 11:1-11:50 (2009) - [c30]Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang:
Nested Hoare Triples and Frame Rules for Higher-Order Store. CSL 2009: 440-454 - [c29]Hongseok Yang:
Automatic Verification of Heap-Manipulating Programs Using Separation Logic. CSR 2009: 25 - [c28]Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang:
Abstraction for Concurrent Objects. ESOP 2009: 252-266 - [c27]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Compositional shape analysis by means of bi-abduction. POPL 2009: 289-300 - 2008
- [j8]Lars Birkedal, Hongseok Yang:
Relational Parametricity and Separation Logic. Logical Methods in Computer Science 4(2) (2008) - [c26]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 - [c25]Aziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly Sagiv, Hongseok Yang:
Ranking Abstractions. ESOP 2008: 148-162 - [c24]Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang:
A Simple Model of Separation Logic for Higher-Order Store. ICALP (2) 2008: 348-360 - [c23]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Space Invading Systems Code. LOPSTR 2008: 1-3 - [i2]Lars Birkedal, Hongseok Yang:
Relational Parametricity and Separation Logic. CoRR abs/0805.0783 (2008) - 2007
- [j7]
- [j6]Sunae Seo, Hongseok Yang, Kwangkeun Yi, Taisook Han:
Goal-directed weakening of abstract interpretation results. ACM Trans. Program. Lang. Syst. 29(6): 39 (2007) - [c22]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 - [c21]
- [c20]Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang:
Local Action and Abstract Separation Logic. LICS 2007: 366-378 - [c19]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Footprint Analysis: A Shape Analysis That Discovers Preconditions. SAS 2007: 402-418 - [c18]
- 2006
- [j5]Richard Bornat, Cristiano Calcagno, Hongseok Yang:
Variables as Resource in Separation Logic. Electr. Notes Theor. Comput. Sci. 155: 247-276 (2006) - [j4]Lars Birkedal, Noah Torp-Smith, Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages. Logical Methods in Computer Science 2(5) (2006) - [c17]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic. SAS 2006: 182-203 - [c16]
- [c15]Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
A Local Shape Analysis Based on Separation Logic. TACAS 2006: 287-302 - [i1]Lars Birkedal, Noah Torp-Smith, Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages. CoRR abs/cs/0610081 (2006) - 2005
- [j3]Oukseh Lee, Hongseok Yang, Kwangkeun Yi:
Static insertion of safe and effective memory reuse commands into ML-like programs. Sci. Comput. Program. 58(1-2): 141-178 (2005) - [c14]Ivana Mijajlovic, Hongseok Yang:
Data Refinement with Low-Level Pointer Operations. APLAS 2005: 19-36 - [c13]Oukseh Lee, Hongseok Yang, Kwangkeun Yi:
Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis. ESOP 2005: 124-140 - [c12]Lars Birkedal, Noah Torp-Smith, Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-Order Frame Rules. LICS 2005: 260-269 - 2004
- [j2]Uday S. Reddy, Hongseok Yang:
Correctness of data representations involving heap data structures. Sci. Comput. Program. 50(1-3): 129-160 (2004) - [j1]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) - [c11]Peter W. O'Hearn, Hongseok Yang, John C. Reynolds:
Separation and information hiding. POPL 2004: 268-280 - 2003
- [c10]Sunae Seo, Hongseok Yang, Kwangkeun Yi:
Automatic Construction of Hoare Proofs from Abstract Interpretation Results. APLAS 2003: 230-245 - [c9]Uday S. Reddy, Hongseok Yang:
Correctness of Data Representations Involving Heap Data Structures. ESOP 2003: 223-237 - [c8]Oukseh Lee, Hongseok Yang, Kwangkeun Yi:
Inserting Safe Memory Reuse Commands into ML-Like Programs. SAS 2003: 171-188 - 2002
- [c7]Oukseh Lee, Hongseok Yang, Kwangkeun Yi:
Inserting Safe Memory Re-use Commands into ML-like Programs. APLAS 2002: 317-333 - [c6]
- 2001
- [c5]Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn:
Computability and Complexity Results for a Spatial Assertion Language for Data Structures. APLAS 2001: 289-300 - [c4]Peter W. O'Hearn, John C. Reynolds, Hongseok Yang:
Local Reasoning about Programs that Alter Data Structures. CSL 2001: 1-19 - [c3]Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn:
Computability and Complexity Results for a Spatial Assertion Language for Data Structures. FSTTCS 2001: 108-119 - 2000
- [c2]
1990 – 1999
- 1998
- [c1]Hongseok Yang, Howard Huang:
Type Reconstruction for Syntactic Control of Interference, Part 2. ICCL 1998: 164-173
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-16 22:20 CEST by the dblp team