Name
Affiliation
Papers
HONGSEOK YANG
University of Oxford, Oxford, United Kingdom
89
Collaborators
Citations 
PageRank 
114
2313
115.85
Referers 
Referees 
References 
2386
1235
1297
Search Limit
1001000
Title
Citations
PageRank
Year
Probabilistic Programs with Stochastic Conditioning00.342021
Differentiable Algorithm For Marginalising Changepoints00.342020
Variational Inference for Sequential Data with Future Likelihood Estimates00.342020
On Correctness of Automatic Differentiation for Non-Differentiable Functions00.342020
Towards verified stochastic variational inference for probabilistic programs00.342020
Divide, Conquer, and Combine: a New Inference Strategy for Probabilistic Programs with Stochastic Support00.342020
Trust Region Sequential Variational Inference.00.342019
Some Semantic Issues in Probabilistic Programming Languages (Invited Talk).00.342019
Resource-aware program analysis via online abstraction coarsening10.362019
Discontinuous Hamiltonian Monte Carlo for Probabilistic Programs.00.342018
Adaptive Static Analysis via Learning with Bayesian Optimization.00.342018
On Nesting Monte Carlo Estimators.20.412018
Learning analysis strategies for octagon and context sensitivity from labeled data generated by static analyses.00.342018
The Beta-Bernoulli process and algebraic effects.00.342018
Reparameterization Gradient for Non-differentiable Models.00.342018
Automatically generating features for learning program analysis heuristics for C-like languages50.412017
Denotational validation of higher-order Bayesian inference40.482017
Probabilistic Programming (Invited Talk).00.342017
Algebraic Laws for Weak Consistency.10.352017
Abstraction refinement guided by a learnt probabilistic model.80.462016
Specification and Complexity of Collaborative Text Editing.80.542016
'Cause I'm Strong Enough: Reasoning about Consistency Choices in Distributed Systems320.932016
Learning a Variable-Clustering Strategy for Octagon from Labeled Data Generated by a Static Analysis.100.502016
Symbolic automata for representing big code10.352016
Design and Implementation of Probabilistic Programming Language Anglican.100.542016
Spreadsheet Probabilistic Programming.00.342016
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints.271.012016
Automatically generating features for learning program analysis heuristics.00.342016
The CISE tool: proving weakly-consistent applications correct.80.502016
Composite Replicated Data Types.40.452015
Learning a strategy for adapting a program analysis via bayesian optimisation200.662015
Particle Gibbs with Ancestor Sampling for Probabilistic Programs.70.612015
Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis20.382015
Transaction Chopping for Parallel Snapshot Isolation.50.392015
Hybrid top-down and bottom-up interprocedural analysis110.502014
On abstraction refinement for program analyses in Datalog270.912014
Replicated data types: specification, verification, optimality511.802014
Selective context-sensitivity guided by impact pre-analysis280.852014
Parameterised Linearisability.00.342014
A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join.40.472014
Views: compositional reasoning for concurrent programs692.002013
Modular verification of preemptive OS kernels90.622013
A step-indexed kripke model of hidden state10.362013
Symbolic Automata for Static Specification Mining.40.392013
Verifying concurrent memory reclamation algorithms with grace170.742013
Finding optimum abstractions in parametric dataflow analysis150.672013
Linearizability with ownership transfer200.952012
Automated concolic testing of smartphone apps1746.242012
Show no weakness: sequentially consistent specifications of TSO libraries240.942012
Two for the Price of One: Lifting Separation Logic Assertions30.382012
  • 1
  • 2