Travelled to:
1 × Austria
1 × Canada
1 × France
1 × Ireland
1 × Japan
1 × New Zealand
1 × Portugal
1 × South Africa
1 × Spain
1 × Sweden
1 × The Netherlands
1 × United Kingdom
5 × USA
Collaborated with:
O.H.Ibarra G.Xie R.A.Kemmerer C.Li H.Yen T.R.Fischer ∅ E.S.Wang T.Bultan Z.Sun D.Dementyev W.J.H.III C.Cui P.S.Pietro J.Su
Talks about:
automata (9) system (8) verif (5) time (4) pushdown (3) problem (3) model (3) use (3) diophantin (2) decomposit (2)
Person: Zhe Dang
DBLP: Dang:Zhe
Facilitated 2 volumes:
Contributed to:
Wrote 19 papers:
- CIAA-2015-DangDFH #automaton #security
- Security of Numerical Sensors in Automata (ZD, DD, TRF, WJHI), pp. 76–88.
- LATA-2013-CuiDFI #automaton #execution
- Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.
- FATES-RV-2006-LiD #algorithm #aspect-oriented #safety #testing #verification
- Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems (CL, ZD), pp. 100–114.
- FATES-2005-XieD #approach #concurrent #testing
- Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach (GX, ZD), pp. 170–186.
- ICALP-2005-LiDIY #problem #verification
- Signaling P Systems and Verification Problems (CL, ZD, OHI, HCY), pp. 1462–1473.
- CIAA-2004-XieLD #automaton #testing
- Testability of Oracle Automata (GX, CL, ZD), pp. 331–332.
- DLT-2004-IbarraYD #parallel #power of
- The Power of Maximal Parallelism in P Systems (OHI, HCY, ZD), pp. 212–224.
- DLT-J-2004-IbarraYD05 #on the #parallel
- On various notions of parallelism in P Systems (OHI, HCY, ZD), pp. 683–705.
- FATES-2004-XieD #approach #component #model checking
- An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components (GX, ZD), pp. 155–169.
- CAV-2003-XieDIP #problem #verification
- Dense Counter Machines and Verification Problems (GX, ZD, OHI, PSP), pp. 93–105.
- CIAA-2003-XieLD #complexity #equation #linear #problem #using
- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
- ICALP-2003-XieDI #equation #infinity #polynomial #verification
- A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (GX, ZD, OHI), pp. 668–680.
- DLT-2002-IbarraDS #automaton #finite #safety #verification
- Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.
- CAV-2001-Dang #analysis #automaton #reachability
- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.
- CIAA-2001-DangBIK #automaton
- Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.
- CAV-2000-DangIBKS #analysis #automaton #reachability
- Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.
- ICSE-2000-DangK #approximate #infinity #model checking #realtime
- Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems (ZD, RAK), pp. 345–354.
- ICSE-1999-DangK #mobile #model checking #using
- Using the ASTRAL Model Checker to Analyze Mobile IP (ZD, RAK), pp. 132–142.
- ASE-2015-WangD #architecture #behaviour #message passing #using
- A Message-Passing Architecture without Public Ids Using Send-to-Behavior (ESSW, ZD), pp. 902–905.