Travelled to:
1 × Canada
1 × Hungary
1 × Italy
1 × Republic of China
1 × Spain
2 × France
2 × Germany
2 × India
3 × United Kingdom
4 × USA
Collaborated with:
Y.Chen ∅ Y.Tsay K.Yi M.Tsai F.He R.Alur W.Lee E.M.Clarke A.Farzan C.Hong L.Zhang Y.Jung C.Hsieh F.Wang F.H.0001 S.Mao X.Gao N.Sinha L.Yin L.Zhu M.Zhou M.Gu S.Kong J.Liu X.Shi B.Yang L.d.Alfaro R.Grosu T.A.Henzinger M.Kang C.M.Kirsch R.Majumdar F.Y.C.Mang
Talks about:
learn (9) composit (5) reason (5) model (5) program (4) verifi (4) verif (4) autom (4) algorithm (3) guarante (3)
Person: Bow-Yaw Wang
DBLP: Wang:Bow=Yaw
Contributed to:
Wrote 25 papers:
- CAV-2015-ChenHWZ #generative #invariant #polynomial
- Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation (YFC, CDH, BYW, LZ), pp. 658–674.
- POPL-2015-HeGWZ #automaton #composition #concurrent #probability #reasoning
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems (FH, XG, BYW, LZ), pp. 503–514.
- 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.
- ICSE-2014-HeWYZ #learning #reasoning
- Symbolic assume-guarantee reasoning through BDD learning (FH, BYW, LY, LZ), pp. 1071–1082.
- SAS-2014-ChenHTWW #recursion #source code #using #verification
- Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.
- 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.
- CAV-2012-LeeWY #algorithm #analysis #learning #termination
- Termination Analysis with Algorithmic Learning (WL, BYW, KY), pp. 88–104.
- TACAS-2011-JungLWY #generative #invariant #quantifier
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference (YJ, WL, BYW, KY), pp. 205–219.
- CAV-2010-ChenCFTTW #automation #learning #reasoning
- Automated Assume-Guarantee Reasoning through Implicit Learning (YFC, EMC, AF, MHT, YKT, BYW), pp. 511–526.
- CAV-2010-ZhouHWG #array #bound #on the
- On Array Theory of Bounded Elements (MZ, FH, BYW, MG), pp. 570–584.
- VMCAI-2010-JungKWY #abstraction #algorithm #invariant #learning
- Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction (YJ, SK, BYW, KY), pp. 180–196.
- TACAS-2009-ChenFCTW #automaton #composition #learning #verification
- Learning Minimal Separating DFA’s for Compositional Verification (YFC, AF, EMC, YKT, BYW), pp. 31–45.
- CIAA-2008-TsayW #automation #composition #reasoning
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 36–45.
- CIAA-J-2008-TsayW09 #automation #composition #reasoning
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 747–762.
- 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.
- PADL-2006-Wang #automation #model checking #verification
- Automatic Verification of a Model Checker by Reflection (BYW), pp. 45–59.
- SAC-2006-Wang #case study #domain-specific language #modelling
- Modeling and analyzing applications with domain-specific languages by reflective rewriting: a case study (BYW), pp. 1773–1778.
- SEKE-2005-Wang #infinity #logic #model checking #specification
- Specification of an Infinite-State Local Model Checker in Rewriting Logic (BYW), pp. 442–447.
- WRLA-2004-Wang05 #calculus #maude #model checking #μ-calculus
- μ-Calculus Model Checking in Maude (BYW), pp. 135–152.
- CAV-2001-AlurW #implementation #network #protocol #refinement #verification
- Verifying Network Protocol Implementations by Symbolic Refinement Checking (RA, BYW), pp. 169–181.
- ICSE-2001-AlurAGHKKMMW #design #model checking #named
- JMOCHA: A Model Checking Tool that Exploits Design Structure (RA, LdA, RG, TAH, MK, CMK, RM, FYCM, BYW), pp. 835–836.
- ASE-2019-LiuSTWY #c #encryption #source code #verification
- Verifying Arithmetic in Cryptographic C Programs (JL, XS, MHT, BYW, BYY), pp. 552–564.
- CAV-2016-HeMW #verification
- Learning-Based Assume-Guarantee Regression Verification (FH0, SM, BYW), pp. 310–328.