Person: Yanhong A. Liu

DBLP: Liu:Yanhong_A=

Contributed to:

2012

2012

2011

2010

2009

2009

2009

2008

2008

2007

2007

2006

2006

2006

2006

2005

2004

2003

2003

2003

2002

2001

2001

2001

2000

2000

1999

1999

1998

1998

1998

1996

1995

1995

2016

2016

2019

Wrote 39 papers:

OOPSLA-2012-LiuSLG #algorithm #distributed #performance

From clarity to efficiency for distributed algorithms (YAL, SDS, BL, MG), pp. 395–410.

PEPM-2012-GorbovitskiLSR #optimisation

Composing transformations for instrumentation and optimization (MG, YAL, SDS, TR), pp. 53–62.

SIGMOD-2011-TekleL #datalog #performance #query #set

More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.

PPDP-2010-TekleGL #datalog #graph #optimisation #query

Graph queries through datalog optimizations (KTT, MG, YAL), pp. 25–34.

PPDP-2010-TekleL #analysis #complexity #datalog #performance #precise #query

Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.

FM-2009-LiuCLS #model checking #refinement

Model Checking Linearizability via Refinement (YL, WC, YAL, JS), pp. 321–337.

GPCE-2009-LiuGS #framework #invariant

A language and framework for invariant-driven transformations (YAL, MG, SDS), pp. 55–64.

SEKE-2009-ZhangLSDCL #scalability #verification

Formal Verification of Scalable NonZero Indicators (SJZ, YL, JS, JSD, WC, YAL), pp. 406–411.

GPCE-2008-RothamelL #generative #implementation #incremental #query

Generating incremental implementations of object-set queries (TR, YAL), pp. 55–66.

SCAM-2008-GorbovitskiTRSL #analysis #debugging #performance

Analysis and Transformations for Efficient Query-Based Debugging (MG, KTT, TR, SDS, YAL), pp. 174–183.

PEPM-2007-RothamelL #implementation #performance #retrieval #tuple

Efficient implementation of tuple pattern based retrieval (TR, YAL), pp. 81–90.

PPDP-2007-HristovaTL #analysis #performance #policy #trust

Efficient trust management policy analysis from rules (KH, KTT, YAL), pp. 211–220.

LCTES-2006-RothamelLHL #generative #specification

Generating optimized code from SCR specifications (TR, YAL, CLH, EIL), pp. 135–144.

PADL-2006-LiuS #graph #query

Querying Complex Graphs (YAL, SDS), pp. 199–214.

PEPM-2006-LiuWGRCZZ #data access #implementation #performance

Core role-based access control: efficient implementations by transformations (YAL, CW, MG, TR, YC, YZ, JZ), pp. 112–120.

VMCAI-2006-HristovaL #algorithm #automaton #linear #logic #model checking

Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.

OOPSLA-2005-LiuSGRL #abstraction

Incrementalization across object abstraction (YAL, SDS, MG, TR, YEL), pp. 473–486.

PLDI-2004-LiuRYSH #parametricity #query

Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.

PEPM-2003-LiuS #optimisation

Optimizing Ackermann’s function by incrementalization (YAL, SDS), pp. 85–91.

PPDP-2003-LiuS #datalog #performance #source code

From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.

VMCAI-2003-UnnikrishnanSL #analysis #bound

Optimized Live Heap Bound Analysis (LU, SDS, YAL), pp. 70–85.

PEPM-2002-GomezL #analysis #automation #bound #higher-order

Automatic time-bound analysis for a higher-order language (GG, YAL), pp. 75–86.

PEPM-2002-LiuS #data type #optimisation #recursion #using

Program optimization using indexed and recursive data structures (YAL, SDS), pp. 108–118.

ASE-2001-GrosuLSSY #automation #concurrent #re-engineering #using

Automated Software Engineering Using Concurrent Class Machines (RG, YAL, SAS, SDS, JY), p. 297–?.

LCTES-OM-2001-UnnikrishnanSL #analysis #automation #garbage collection #memory management

Automatic Accurate Live Memory Analysis for Garbage-Collected Languages (LU, SDS, YAL), pp. 102–111.

SAS-2001-LiuLS #constraints #grammarware

Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.

CAV-2000-StollerUL #detection #distributed #partial order #performance #using

Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.

PEPM-2000-LiuS #optimisation #question #recursion #what

From Recursion to Iteration: What are the Optimizations? (YAL, SDS), pp. 73–82.

ESOP-1999-LiuS #programming

Dynamic Programming via Static Incrementalization (YAL, SDS), pp. 288–305.

SAS-1999-LiuS #recursion

Eliminating Dead Code on Recursive Data (YAL, SDS), pp. 211–231.

CAV-1998-StollerL #detection #distributed #performance

Efficient Symbolic Detection of Global Properties in Distributed Systems (SDS, YAL), pp. 357–368.

ICFP-1998-ZhangL #automation #incremental #source code

Automating Derivation of Incremental Programs (YZ, YAL), p. 350.

LCTES-1998-LiuG #analysis #automation #bound

Automatic Accurate Time-Bound Analysis for High-Level Languages (YAL, GG), pp. 31–40.

POPL-1996-LiuST #incremental

Discovering Auxiliary Information for Incremental Computation (YAL, SDS, TT), pp. 157–170.

KBSE-1995-Liu #incremental #interactive #named #program transformation #source code

CACHET: An Interactive, Incremental-Attribution-Based Program Transformation System for Deriving Incremental Programs (YAL), pp. 19–26.

PEPM-1995-LiuT

Caching Intermediate Results for Program Improvement (YAL, TT), pp. 190–201.

PEPM-2016-BrandveinL #query #runtime

Removing runtime overhead for optimized object queries (JB, YAL), pp. 73–84.

PPDP-2016-LiuBSL #incremental #query

Demand-driven incremental object queries (YAL, JB, SDS, BL), pp. 228–241.

PPDP-2019-LiuCS #algorithm #distributed #execution #specification

Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms (YAL, SC, SDS), p. 15.