Travelled to:1 × Austria
1 × Denmark
1 × India
1 × Ireland
1 × Norway
1 × Portugal
1 × South Africa
1 × Switzerland
1 × Vietnam
2 × France
2 × The Netherlands
2 × United Kingdom
21 × USA
4 × Italy
Collaborated with:S.Qin S.Khoo C.Popeea H.H.Nguyen C.David ∅ Z.Hu M.Tatsuta Q.L.Le C.Gherghina F.Craciun M.Takeichi D.N.Xu T.C.Le J.S.0001 T.Pham A.Truong G.He M.C.Rinard M.Hagiya D.Le Y.M.Teo M.F.A.Ameen V.Kuncak J.S.Dong S.Anand A.Goh T.Lee M.Trinh C.Luo N.Truong Quang-Trung Ta A.Sharma S.Wang A.Costea A.Hobor R.Voicu
Talks about:verif (12) program (10) separ (7) logic (7) analysi (6) specif (5) infer (5) type (5) calcul (4) bound (4)
Person: Wei-Ngan Chin
DBLP: Chin:Wei=Ngan
Facilitated 2 volumes:
EdEdContributed to:
20152015
2015
2014
201420112011
2011
20102013
2009200920092008
20082008
20082008
200820072006
2005
20052004200420032003
2002
2001
2000200020001999199819981997
199519931993
19921992201620172018Wrote 47 papers:
- FM-2015-SharmaWCHC #infinity #reasoning
- Certified Reasoning with Infinity (AS, SW, AC, AH, WNC), pp. 496–513.
- PEPM-2015-LeCT #concurrent #thread #verification
- Threads as Resource for Concurrency Verification (DKL, WNC, YMT), pp. 73–84.
- PLDI-2015-LeQC #specification #termination
- Termination and non-termination specification inference (TCL, SQ, WNC), pp. 489–498.
- CAV-2014-LeGQC #analysis #higher-order
- Shape Analysis via Second-Order Bi-Abduction (QLL, CG, SQ, WNC), pp. 52–68.
- SEFM-2014-TatsutaC #induction #logic #verification
- Completeness of Separation Logic with Inductive Definitions for Program Verification (MT, WNC), pp. 20–34.
- CAV-2011-ChinGVLCQ #calculus #verification
- A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.
- CAV-2011-PhamTTC #constraints #fixpoint #named #quantifier
- FixBag: A Fixpoint Calculator for Quantified Bag Constraints (THP, MTT, AHT, WNC), pp. 656–662.
- FM-2011-GherghinaDQC #source code #specification #verification
- Structured Specifications for Better Verification of Heap-Manipulating Programs (CG, CD, SQ, WNC), pp. 386–401.
- FM-2011-QinLCH #automation #specification #verification
- Automatically Refining Partial Specifications for Program Verification (SQ, CL, WNC, GH), pp. 369–385.
- OOPSLA-2011-DavidC #precise #specification #verification
- Immutable specifications for more concise and precise verification (CD, WNC), pp. 359–374.
- SAC-2010-PopeeaC #analysis #debugging #proving #safety
- Dual analysis for proving safety and finding bugs (CP, WNC), pp. 2137–2143.
- SAC-PL-J-2010-PopeeaC13 #analysis #debugging #proving #safety
- Dual analysis for proving safety and finding bugs (CP, WNC), pp. 390–411.
- ESOP-2009-CraciunCHQ #parametricity
- An Interval-Based Inference of Variant Parametric Types (FC, WNC, GH, SQ), pp. 112–127.
- PEPM-2009-DavidGC #calculus #exception #optimisation
- Translation and optimization for a core calculus with exceptions (CD, CG, WNC), pp. 41–50.
- SEFM-2009-TatsutaCA #logic #pointer #verification
- Completeness of Pointer Program Verification by Separation Logic (MT, WNC, MFAA), pp. 179–188.
- CAV-2008-NguyenC #verification
- Enhancing Program Verification with Lemmas (HHN, WNC), pp. 355–369.
- ISMM-2008-ChinNPQ #bound #low level #memory management #source code
- Analysing memory resource bounds for low-level programs (WNC, HHN, CP, SQ), pp. 151–160.
- PEPM-2008-PopeeaXC #array #bound #precise
- A practical and precise inference and specializer for array bound checks elimination (CP, DNX, WNC), pp. 177–187.
- POPL-2008-ChinDNQ #composition #logic #object-oriented #verification
- Enhancing modular OO verification with separation logic (WNC, CD, HHN, SQ), pp. 87–99.
- SEFM-2008-PhamTTC #algorithm #bound #java #memory management #performance
- A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.
- VMCAI-2008-NguyenKC #logic #runtime
- Runtime Checking for Separation Logic (HHN, VK, WNC), pp. 203–217.
- VMCAI-2007-NguyenDQC #automation #logic #verification
- Automated Verification of Shape and Size Properties Via Separation Logic (HHN, CD, SQ, WNC), pp. 251–266.
- OOPSLA-2006-ChinCKP #approach #parametricity
- A flow-based approach for variant parametric types (WNC, FC, SCK, CP), pp. 273–290.
- ICSE-2005-ChinKQPN #alias #policy #safety #verification
- Verifying safety policies with size properties and alias controls (WNC, SCK, SQ, CP, HHN), pp. 186–195.
- SAS-2005-ChinNQR #memory management #object-oriented #source code #verification
- Memory Usage Verification for OO Programs (WNC, HHN, SQ, MCR), pp. 70–86.
- PEPM-2004-PopeeaC #correctness #protocol #proving #type system #verification
- A type system for resource protocol verification and its correctness proof (CP, WNC), pp. 135–146.
- PLDI-2004-ChinCQR #object-oriented
- Region inference for an object-oriented language (WNC, FC, SQ, MCR), pp. 243–254.
- FME-2003-QinC #hardware
- Mapping Statecharts to Verilog for Hardware/Software Co-specification (SQ, WNC), pp. 282–300.
- FME-2003-QinDC #programming #semantics
- A Semantic Foundation for TCOZ in Unifying Theories of Programming (SQ, JSD, WNC), pp. 321–340.
- PEPM-2003-ChinKX #analysis
- Extending sized type with collection analysis (WNC, SCK, DNX), pp. 75–84.
- GPCE-2002-ChinH #composition #towards
- Towards a Modular Program Derivation via Fusion and Tupling (WNC, ZH), pp. 140–155.
- ICFP-2001-AnandCK
- Charting Patterns on Price History (SA, WNC, SCK), pp. 134–145.
- PADL-2000-HuCT #algorithm #analysis #data mining #mining
- Calculating a New Data Mining Algorithm for Market Basket Analysis (ZH, WNC, MT), pp. 169–184.
- PEPM-2000-ChinK
- Calculating Sized Types (WNC, SCK), pp. 62–72.
- SAS-2000-ChinKHT #invariant #parallel
- Deriving Parallel Codes via Invariants (WNC, SCK, ZH, MT), pp. 75–94.
- PEPM-1999-ChinGK #effectiveness #lazy evaluation #multi #optimisation #traversal
- Effective Optimization of Multiple Traversals in Lazy Languages (WNC, AHG, SCK), pp. 119–130.
- ESOP-1998-ChinKL #analysis
- Synchronisation Analysis to Stop Tulping (WNC, SCK, TWL), pp. 75–89.
- POPL-1998-HuTC #parallel
- Parallelization in Calculational Forms (ZH, MT, WNC), pp. 316–328.
- ICFP-1997-ChinH #bound
- A Bounds Inference Method for Vector-Based Memoisation (WNC, MH), pp. 176–187.
- PLILP-1995-ChinK #deforestation
- Better Consumers for Deforestation (WNC, SCK), pp. 223–240.
- PEPM-1993-Chin #automation #towards
- Towards an Automated Tupling Strategy (WNC), pp. 119–132.
- WSA-1993-ChinK #multi #parametricity #recursion
- Tupling Functions with Multiple Recursion Parameters (WNC, SCK), pp. 124–140.
- LFP-1992-Chin #functional
- Safe Fusion of Functional Expressions (WNC), pp. 11–20.
- PEPM-1992-Chin #higher-order #lazy evaluation
- Fully Lazy Higher-Order Removal (WNC), pp. 38–47.
- CAV-2016-LeSC #satisfiability #source code
- Satisfiability Modulo Heap-Based Programs (QLL, JS0, WNC), pp. 382–404.
- CAV-2017-LeT0C #decidability #induction #logic
- A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic (QLL, MT, JS0, WNC), pp. 495–517.
- POPL-2018-TaLKC #automation #logic #synthesis
- Automated lemma synthesis in symbolic-heap separation logic (QTT, TCL, SCK, WNC), p. 29.