Using the ASTRAL Model Checker to Analyze Mobile IP. - Zhe Dang; Richard A. Kemmerer (ICSE, 1999)

A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications. - Zhe Dang; Richard A. Kemmerer (RTCSA, 1999)

The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment. - Paul Z. Kolano; Zhe Dang; Richard A. Kemmerer (Ann. Softw. Eng., 1999)

Binary Reachability Analysis of Discrete Pushdown Timed Automata. - Zhe Dang; Oscar H. Ibarra; Tevfik Bultan; Richard A. Kemmerer; Jianwen Su (CAV, 2000)

Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. - Zhe Dang; Richard A. Kemmerer (ICSE, 2000)

Conter Machines: Decidable Properties and Applications to Verification Problems. - Oscar H. Ibarra; Jianwen Su; Zhe Dang; Tevfik Bultan; Richard A. Kemmerer (MFCS, 2000)

Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. - Zhe Dang (CAV, 2001)

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. - Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer (COCOON, 2001)

Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. - Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro (FSTTCS, 2001)

On Removing the Pushdown Stack in Reachability Constructions. - Oscar H. Ibarra; Zhe Dang (ISAAC, 2001)

On Presburger Liveness of Discrete Timed Automata. - Zhe Dang; Pierluigi San Pietro; Richard A. Kemmerer (STACS, 2001)

Past Pushdown Timed Automata. - Zhe Dang; Tevfik Bultan; Oscar H. Ibarra; Richard A. Kemmerer (CIAA, 2001)

The Existence of $ omega$-Chains for Transitive Mixed Linear Relations and Its Applications - Zhe Dang (CoRR, 2001)

Safety Verification for Two-Way Finite Automata with Monotonic Counters. - Oscar H. Ibarra; Zhe Dang; Zhi-Wei Sun (Developments in Language Theory, 2002)

On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. - Zhe Dang; Oscar H. Ibarra; Zhi-Wei Sun (ISAAC, 2002)

The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. - Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2002)

Counter Machines and Verification Problems. - Oscar H. Ibarra; Jianwen Su; Zhe Dang; Tevfik Bultan; Richard A. Kemmerer (Theor. Comput. Sci., 2002)

Dense Counter Machines and Verification Problems. - Gaoyan Xie; Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro (CAV, 2003)

Automatic Verification of Multi-queue Discrete Timed Automata. - Pierluigi San Pietro; Zhe Dang (COCOON, 2003)

A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. - Gaoyan Xie; Zhe Dang; Oscar H. Ibarra (ICALP, 2003)

Characterizations of Catalytic Membrane Computing Systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu; Gaurav Saxena (MFCS, 2003)

New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. - Gaoyan Xie; Cheng Li; Zhe Dang (CIAA, 2003)

Pushdown timed automata: a binary reachability characterization and safety verification. - Zhe Dang (Theor. Comput. Sci., 2003)

Generalized discrete timed automata: decidable approximations for safety verificatio. - Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer (Theor. Comput. Sci., 2003)

Presburger liveness verification of discrete timed automata. - Zhe Dang; Pierluigi San Pietro; Richard A. Kemmerer (Theor. Comput. Sci., 2003)

Eliminating the storage tape in reachability constructions. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2003)

Verification in loosely synchronous queue-connected discrete timed automata. - Oscar H. Ibarra; Zhe Dang; Pierluigi San Pietro (Theor. Comput. Sci., 2003)

On P Systems Operating in Sequential Mode. - Zhe Dang; Oscar H. Ibarra (DCFS, 2004)

The Power of Maximal Parallelism in P Systems. - Oscar H. Ibarra; Hsu-Chun Yen; Zhe Dang (Developments in Language Theory, 2004)

An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components. - Gaoyan Xie; Zhe Dang (FATES, 2004)

Real-Counter Automata and Their Decision Problems. - Zhe Dang; Oscar H. Ibarra; Pierluigi San Pietro; Gaoyan Xie (FSTTCS, 2004)

Composability of Infinite-State Activity Automata. - Zhe Dang; Oscar H. Ibarra; Jianwen Su (ISAAC, 2004)

Testability of Oracle Automata. - Gaoyan Xie; Cheng Li; Zhe Dang (CIAA, 2004)

Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components - Gaoyan Xie; Zhe Dang (CoRR, 2004)

Past pushdown timed automata and safety verification. - Zhe Dang; Tevfik Bultan; Oscar H. Ibarra; Richard A. Kemmerer (Theor. Comput. Sci., 2004)

On two-way FA with monotonic counters and quadratic Diophantine equations. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2004)

Catalytic P systems, semilinear sets, and vector addition systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu (Theor. Comput. Sci., 2004)

Linear reachability problems and minimal solutions to linear Diophantine equation systems. - Gaoyan Xie; Cheng Li; Zhe Dang (Theor. Comput. Sci., 2004)

On Sequential and 1-Deterministic P Systems. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (COCOON, 2005)

Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach. - Gaoyan Xie; Zhe Dang (FATES, 2005)

Signaling P Systems and Verification Problems. - Cheng Li; Zhe Dang; Oscar H. Ibarra; Hsu-Chun Yen (ICALP, 2005)

On Symport/Antiport P Systems and Semilinear Sets. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (Workshop on Membrane Computing, 2005)

On Model-Checking of P Systems. - Zhe Dang; Oscar H. Ibarra; Cheng Li; Gaoyan Xie (UC, 2005)

On one-membrane P systems operating in sequential mode. - Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2005)

On various notions of parallelism in P Systems. - Oscar H. Ibarra; Hsu-Chun Yen; Zhe Dang (Int. J. Found. Comput. Sci., 2005)

On two-way nondeterministic finite automata with one reversal-bounded counter. - Zhe Dang; Oscar H. Ibarra; Zhi-Wei Sun (Theor. Comput. Sci., 2005)

On composition and lookahead delegation of e-services modeled by automata, . - Zhe Dang; Oscar H. Ibarra; Jianwen Su (Theor. Comput. Sci., 2005)

Compacting XML Data. - Shuohao Zhang; Curtis E. Dyreson; Zhe Dang (DASFAA, 2006)

Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems. - Cheng Li; Zhe Dang (FATES/RV, 2006)

On the Computational Power of 1-Deterministic and Sequential P Systems. - Oscar H. Ibarra; Sara Woodworth; Hsu-Chun Yen; Zhe Dang (Fundam. Informaticae, 2006)

On the Decidability of Model-Checking for P Systems. - Zhe Dang; Oscar H. Ibarra; Cheng Li; Gaoyan Xie (J. Autom. Lang. Comb., 2006)

On the solvability of a class of diophantine equations and applications. - Oscar H. Ibarra; Zhe Dang (Theor. Comput. Sci., 2006)

Automata on Multisets of Communicating Objects. - Linmin Yang; Yong Wang; Zhe Dang (UC, 2008)

On Counter Machines, Reachability Problems, and Diophantine Equations. - Oscar H. Ibarra; Zhe Dang; Linmin Yang (Int. J. Found. Comput. Sci., 2008)

On Stateless Automata and P Systems. - Linmin Yang; Zhe Dang; Oscar H. Ibarra (Int. J. Found. Comput. Sci., 2008)

Optimal Software Testing - A Cooling Down Process. - Linmin Yang; Zhe Dang; Thomas R. Fischer (FCS, 2009)

Entropy and software systems: towards an information-theoretic foundation of software testing. - Linmin Yang; Zhe Dang; Thomas R. Fischer; Min Sik Kim; Li Tan (FoSER, 2010)

Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. - Linmin Yang; Zhe Dang; Oscar H. Ibarra (Nat. Comput., 2010)

Automata and processes on multisets of communicating objects. - Linmin Yang; Yong Wang; Zhe Dang (Nat. Comput., 2010)

Information gain of black-box testing. - Linmin Yang; Zhe Dang; Thomas R. Fischer (Formal Aspects Comput., 2011)

Typical Paths of a Graph. - Cewei Cui; Zhe Dang; Thomas R. Fischer (Fundam. Informaticae, 2011)

Bit Rate of Programs. - Cewei Cui; Zhe Dang; Thomas R. Fischer (CoRR, 2013)

Similarity in languages and programs. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Theor. Comput. Sci., 2013)

Near-Optimal Approximate Duplicate-Detection in Data Streams Over Sliding Windows for the Uniform Query Frequency or Membership Likelihood. - Xiujun Wang; Xiao Zheng; Zhe Dang; Xuangou Wu; Baohua Zhao (CBD, 2014)

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (MFCS (1), 2014)

Zero-Knowledge Blackbox Testing: where are the Faults? - Eric Wang; Cewei Cui; Zhe Dang; Thomas R. Fischer; Linmin Yang (Int. J. Found. Comput. Sci., 2014)

Improved Weighted Bloom Filter and Space Lower Bound Analysis of Algorithms for Approximated Membership Querying. - Xiujun Wang; Yusheng Ji; Zhe Dang; Xiao Zheng; Baohua Zhao (DASFAA (2), 2015)

A Message-Passing Architecture without Public Ids Using Send-to-Behavior. - Eric Shing-Suan Wang; Zhe Dang (ASE, 2015)

Security of Numerical Sensors in Automata. - Zhe Dang; Dmitry Dementyev; Thomas R. Fischer; William J. Hutton III (CIAA, 2015)

Sampling automata and programs. - Qin Li; Zhe Dang (Theor. Comput. Sci., 2015)

A Free Energy Foundation of Semantic Similarity in Automata and Languages. - Cewei Cui; Zhe Dang (SISAP, 2016)

Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy. - Cewei Cui; Zhe Dang (CoRR, 2016)

Execution information rate for some classes of automata. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Inf. Comput., 2016)

Quantifying communication in synchronized languages. - Zhe Dang; Thomas R. Fischer; William J. Hutton III; Oscar H. Ibarra; Qin Li (Theor. Comput. Sci., 2016)

Lossiness of communication channels modeled by transducers. - Oscar H. Ibarra; Cewei Cui; Zhe Dang; Thomas R. Fischer (Comput., 2017)

Random Words in a (Weighted) Regular Language: a Free Energy Approach. - Cewei Cui; Zhe Dang (CoRR, 2017)

Information rate of some classes of non-regular languages: An automata-theoretic approach. - Cewei Cui; Zhe Dang; Thomas R. Fischer; Oscar H. Ibarra (Inf. Comput., 2017)

Accepting runs in a two-way finite automaton. - Oscar H. Ibarra; Zhe Dang; Qin Li (Inf. Comput., 2018)

A Near-optimal Protocol for the Subset Selection Problem in RFID Systems. - Xiujun Wang; Zhi Liu 002; Susumu Ishihara; Zhe Dang; Jie Li 002 (MSN, 2020)

A Near-Optimal Protocol for the Grouping Problem in RFID Systems. - Xiujun Wang; Zhi Liu 002; Yan Gao; Xiao Zheng; Zhe Dang; Xiaojun Shen 002 (IEEE Trans. Mob. Comput., 2021)

A Near-Optimal Protocol for Continuous Tag Recognition in Mobile RFID Systems. - Xiujun Wang; Zhi Liu 002; Alex X. Liu; Xiao Zheng; Hao Zhou 001; Ammar Hawbani; Zhe Dang (IEEE/ACM Trans. Netw., 2024)