BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Cyprus
1 × Estonia
1 × France
1 × Germany
1 × Hungary
1 × Italy
1 × Portugal
2 × USA
3 × United Kingdom
Collaborated with:
B.Wang P.A.Abdulla M.Tsai M.F.Atig A.Rezine Y.Tsay L.Holík C.Hong C.Leonardsson E.M.Clarke A.Farzan P.Rümmer C.Hsieh F.Wang W.Chan R.Mayr T.Vojnar L.Song Z.Wu J.Stenman L.Zhang N.Sinha C.Luo K.Wu L.Clemente Bui Phi Diep M.Heizmann O.Lengál Yong Li 0031 A.Turrini L.Z.0001
Talks about:
program (5) automata (4) learn (4) constraint (3) string (3) insert (3) verif (3) tool (3) fenc (3) base (3)

Person: Yu-Fang Chen

DBLP DBLP: Chen:Yu=Fang

Contributed to:

CAV 20152015
TACAS 20152015
CAV 20142014
SAS 20142014
TACAS 20132013
CAV 20122012
SAS 20122012
TACAS 20122012
CAV 20102010
TACAS 20102010
TACAS 20092009
TACAS 20082008
TACAS 20072007
CAV (2) 20162016
PLDI 20172017
PLDI 20182018

Wrote 21 papers:

CAV-2015-AbdullaACHRRS #constraints #named #smt #string
Norn: An SMT Solver for String Constraints (PAA, MFA, YFC, LH, AR, PR, JS), pp. 462–469.
CAV-2015-ChenHWZ #generative #invariant #polynomial
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation (YFC, CDH, BYW, LZ), pp. 658–674.
TACAS-2015-ChenHSW #commutative #reduction
Commutativity of Reducers (YFC, CDH, NS, BYW), pp. 131–146.
TACAS-2015-ChenHTWW #contest #named #program transformation #recursion #source code #text-to-text #verification
CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation — (Competition Contribution) (YFC, CH, MHT, BYW, FW), pp. 426–428.
CAV-2014-AbdullaACHRRS #constraints #string #verification
String Constraints for Verification (PAA, MFA, YFC, LH, AR, PR, JS), pp. 150–166.
SAS-2014-ChenHTWW #recursion #source code #using #verification
Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.
TACAS-2013-AbdullaACLR #automation #precise
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO (PAA, MFA, YFC, CL, AR), pp. 530–536.
TACAS-2013-ChenW #algorithm #learning #library #named
BULL: A Library for Learning Algorithms of Boolean Functions (YFC, BYW), pp. 537–542.
CAV-2012-ChenW #incremental #learning
Learning Boolean Functions Incrementally (YFC, BYW), pp. 55–70.
SAS-2012-AbdullaACLR #abstraction #automation #integer #source code
Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
TACAS-2012-AbdullaACLR
Counter-Example Guided Fence Insertion under TSO (PAA, MFA, YFC, CL, AR), pp. 204–219.
CAV-2010-AbdullaCCHHMV #automaton #simulation #testing
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
CAV-2010-ChenCFTTW #automation #learning #reasoning
Automated Assume-Guarantee Reasoning through Implicit Learning (YFC, EMC, AF, MHT, YKT, BYW), pp. 511–526.
TACAS-2010-AbdullaCHMV #anti #simulation
When Simulation Meets Antichains (PAA, YFC, LH, RM, TV), pp. 158–174.
TACAS-2009-ChenFCTW #automaton #composition #learning #verification
Learning Minimal Separating DFA’s for Compositional Verification (YFC, AF, EMC, YKT, BYW), pp. 31–45.
TACAS-2008-FarzanCCTW #automation #composition #regular expression #verification
Extending Automated Compositional Verification to the Full Class of ω-Regular Languages (AF, YFC, EMC, YKT, BYW), pp. 2–17.
TACAS-2008-TsayCTCL #automaton #logic #research #towards
GOAL Extended: Towards a Research Tool for ω Automata and Temporal Logic (YKT, YFC, MHT, WCC, CJL), pp. 346–350.
TACAS-2007-TsayCTWC #automaton #named #visual notation
GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae (YKT, YFC, MHT, KNW, WCC), pp. 466–471.
CAV-2016-ChenSW #approach #commutative #framework #pipes and filters #problem #transducer
The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach (YFC, LS, ZW), pp. 91–111.
PLDI-2017-AbdullaACDHRR #analysis #constraints #framework #performance #string
Flatten and conquer: a framework for efficient analysis of string constraints (PAA, MFA, YFC, BPD, LH, AR, PR), pp. 602–617.
PLDI-2018-ChenHLLTTZ #algorithm #termination
Advanced automata-based algorithms for program termination checking (YFC, MH, OL, YL0, MHT, AT, LZ0), pp. 135–150.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.