Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarZhe Dang
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j33]Oscar H. Ibarra, Zhe Dang, Qin Li:
Accepting runs in a two-way finite automaton. Inf. Comput. 260: 1-8 (2018)- 2017
- [j32]Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer:
Lossiness of communication channels modeled by transducers. Computability 6(2): 165-181 (2017) - [j31]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information rate of some classes of non-regular languages: An automata-theoretic approach. Inf. Comput. 256: 45-61 (2017) - [i8]Cewei Cui, Zhe Dang:
Random Words in a (Weighted) Regular Language: a Free Energy Approach. CoRR abs/1711.08963 (2017) - 2016
- [j30]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution information rate for some classes of automata. Inf. Comput. 246: 20-29 (2016) - [j29]Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li:
Quantifying communication in synchronized languages. Theor. Comput. Sci. 654: 33-44 (2016) - [c44]Cewei Cui, Zhe Dang:
A Free Energy Foundation of Semantic Similarity in Automata and Languages. SISAP 2016: 34-47 - [i7]Cewei Cui, Zhe Dang:
Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy. CoRR abs/1605.07220 (2016) - [i6]Cewei Cui, Zhe Dang:
A Free Energy Foundation of Semantic Similarity in Automata and Languages. CoRR abs/1605.07224 (2016) - 2015
- [j28]
- [c43]Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li:
Quantifying Communication in Synchronized Languages. COCOON 2015: 635-647 - [c42]Xiujun Wang, Yusheng Ji, Zhe Dang, Xiao Zheng, Baohua Zhao:
Improved Weighted Bloom Filter and Space Lower Bound Analysis of Algorithms for Approximated Membership Querying. DASFAA (2) 2015: 346-362 - [c41]Eric Shing-Suan Wang, Zhe Dang:
A Message-Passing Architecture without Public Ids Using Send-to-Behavior. ASE 2015: 902-905 - [c40]Zhe Dang, Dmitry Dementyev, Thomas R. Fischer, William J. Hutton III:
Security of Numerical Sensors in Automata. CIAA 2015: 76-88 - 2014
- [j27]Eric Wang, Cewei Cui, Zhe Dang, Thomas R. Fischer, Linmin Yang:
Zero-Knowledge Blackbox Testing: where are the Faults? Int. J. Found. Comput. Sci. 25(2): 195-218 (2014) - [c39]Xiujun Wang, Xiao Zheng, Zhe Dang, Xuangou Wu, Baohua Zhao:
Near-Optimal Approximate Duplicate-Detection in Data Streams Over Sliding Windows for the Uniform Query Frequency or Membership Likelihood. CBD 2014: 122-127 - [c38]Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer:
Lossiness of Communication Channels Modeled by Transducers. CiE 2014: 224-233 - [c37]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). MFCS (1) 2014: 232-243 - 2013
- [j26]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Similarity in languages and programs. Theor. Comput. Sci. 498: 58-75 (2013) - [c36]Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution Information Rate for Some Classes of Automata. LATA 2013: 226-237 - [i5]
- 2011
- [j25]Linmin Yang, Zhe Dang, Thomas R. Fischer:
Information gain of black-box testing. Formal Asp. Comput. 23(4): 513-539 (2011) - [j24]Cewei Cui, Zhe Dang, Thomas R. Fischer:
Typical Paths of a Graph. Fundam. Inform. 110(1-4): 95-109 (2011) - 2010
- [j23]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. Natural Computing 9(2): 347-364 (2010) - [j22]Linmin Yang, Yong Wang, Zhe Dang:
Automata and processes on multisets of communicating objects. Natural Computing 9(4): 865-887 (2010) - [c35]Linmin Yang, Zhe Dang, Thomas R. Fischer, Min Sik Kim, Li Tan:
Entropy and software systems: towards an information-theoretic foundation of software testing. FoSER 2010: 427-432
2000 – 2009
- 2009
- [c34]Linmin Yang, Zhe Dang, Thomas R. Fischer:
Optimal Software Testing - A Cooling Down Process. FCS 2009: 162-168 - 2008
- [j21]Oscar H. Ibarra, Zhe Dang, Linmin Yang:
On Counter Machines, Reachability Problems, and Diophantine Equations. Int. J. Found. Comput. Sci. 19(4): 919-934 (2008) - [j20]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
On Stateless Automata and P Systems. Int. J. Found. Comput. Sci. 19(5): 1259-1276 (2008) - [c33]
- 2007
- [c32]Linmin Yang, Zhe Dang, Oscar H. Ibarra:
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. UC 2007: 226-241 - 2006
- [j19]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems. Fundam. Inform. 73(1-2): 133-152 (2006) - [j18]Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie:
On the Decidability of Model-Checking for P Systems. Journal of Automata, Languages and Combinatorics 11(3): 279-298 (2006) - [j17]Oscar H. Ibarra, Zhe Dang:
On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352(1-3): 342-346 (2006) - [c31]
- [c30]Cheng Li, Zhe Dang:
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems. FATES/RV 2006: 100-114 - [e2]Oscar H. Ibarra, Zhe Dang:
Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings. Lecture Notes in Computer Science 4036, Springer 2006, ISBN 3-540-35428-X [contents] - 2005
- [j16]Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang:
On various notions of parallelism in P Systems. Int. J. Found. Comput. Sci. 16(4): 683-705 (2005) - [j15]Zhe Dang, Oscar H. Ibarra:
On one-membrane P systems operating in sequential mode. Int. J. Found. Comput. Sci. 16(5): 867-881 (2005) - [j14]Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On two-way nondeterministic finite automata with one reversal-bounded counter. Theor. Comput. Sci. 330(1): 59-79 (2005) - [j13]Zhe Dang, Oscar H. Ibarra, Jianwen Su:
On composition and lookahead delegation of e-services modeled by automata, . Theor. Comput. Sci. 341(1-3): 344-363 (2005) - [c29]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On Sequential and 1-Deterministic P Systems. COCOON 2005: 905-914 - [c28]Gaoyan Xie, Zhe Dang:
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach. FATES 2005: 170-186 - [c27]Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen:
Signaling P Systems and Verification Problems. ICALP 2005: 1462-1473 - [c26]Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On Symport/Antiport P Systems and Semilinear Sets. Workshop on Membrane Computing 2005: 253-271 - [c25]
- [i4]Gaoyan Xie, Zhe Dang:
Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach. CoRR abs/cs/0502040 (2005) - 2004
- [j12]Oscar H. Ibarra, Zhe Dang:
On two-way FA with monotonic counters and quadratic Diophantine equations. Theor. Comput. Sci. 312(2-3): 359-378 (2004) - [j11]Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu:
Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312(2-3): 379-399 (2004) - [j10]Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past pushdown timed automata and safety verification. Theor. Comput. Sci. 313(1): 57-71 (2004) - [j9]Gaoyan Xie, Cheng Li, Zhe Dang:
Linear reachability problems and minimal solutions to linear Diophantine equation systems. Theor. Comput. Sci. 328(1-2): 203-219 (2004) - [c24]
- [c23]Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang:
The Power of Maximal Parallelism in P Systems. Developments in Language Theory 2004: 212-224 - [c22]Gaoyan Xie, Zhe Dang:
An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components. FATES 2004: 155-169 - [c21]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie:
Real-Counter Automata and Their Decision Problems. FSTTCS 2004: 198-210 - [c20]Zhe Dang, Oscar H. Ibarra, Jianwen Su:
Composability of Infinite-State Activity Automata. ISAAC 2004: 377-388 - [c19]
- [i3]Gaoyan Xie, Zhe Dang:
Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components. CoRR cs.SE/0404037 (2004) - 2003
- [j8]Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata. Theor. Comput. Sci. 290(3): 1713-1735 (2003) - [j7]Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer:
Generalized discrete timed automata: decidable approximations for safety verificatio. Theor. Comput. Sci. 296(1): 59-74 (2003) - [j6]Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
Presburger liveness verification of discrete timed automata. Theor. Comput. Sci. 299(1-3): 413-438 (2003) - [j5]Oscar H. Ibarra, Zhe Dang:
Eliminating the storage tape in reachability constructions. Theor. Comput. Sci. 299(1-3): 687-706 (2003) - [j4]Zhe Dang:
Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci. 302(1-3): 93-121 (2003) - [c18]Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Dense Counter Machines and Verification Problems. CAV 2003: 93-105 - [c17]Pierluigi San Pietro, Zhe Dang:
Automatic Verification of Multi-queue Discrete Timed Automata. COCOON 2003: 159-171 - [c16]Gaoyan Xie, Zhe Dang, Oscar H. Ibarra:
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. ICALP 2003: 668-680 - [c15]Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems. MFCS 2003: 480-489 - [c14]Gaoyan Xie, Cheng Li, Zhe Dang:
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. CIAA 2003: 163-175 - [e1]Oscar H. Ibarra, Zhe Dang:
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2759, Springer 2003, ISBN 3-540-40561-5 [contents] - 2002
- [j3]Zhe Dang, Oscar H. Ibarra:
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. Int. J. Found. Comput. Sci. 13(6): 911-936 (2002) - [j2]Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
Counter Machines and Verification Problems. Theor. Comput. Sci. 289(1): 165-189 (2002) - [c13]Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters. Developments in Language Theory 2002: 326-338 - [c12]Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun:
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. ISAAC 2002: 103-114 - 2001
- [c11]Zhe Dang:
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. CAV 2001: 506-518 - [c10]Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer:
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. COCOON 2001: 529-539 - [c9]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. FSTTCS 2001: 132-143 - [c8]Oscar H. Ibarra, Zhe Dang:
On Removing the Pushdown Stack in Reachability Constructions. ISAAC 2001: 244-256 - [c7]Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
On Presburger Liveness of Discrete Timed Automata. STACS 2001: 132-143 - [c6]Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past Pushdown Timed Automata. CIAA 2001: 74-86 - [i2]Zhe Dang:
Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification. CoRR cs.LO/0110010 (2001) - [i1]Zhe Dang:
The Existence of $\omega$-Chains for Transitive Mixed Linear Relations and Its Applications. CoRR cs.LO/0110063 (2001) - 2000
- [c5]Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata. CAV 2000: 69-84 - [c4]Zhe Dang, Richard A. Kemmerer:
Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. ICSE 2000: 345-354 - [c3]Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems. MFCS 2000: 426-435
1990 – 1999
- 1999
- [j1]Paul Z. Kolano, Zhe Dang, Richard A. Kemmerer:
The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment. Ann. Software Eng. 7: 177-210 (1999) - [c2]Zhe Dang, Richard A. Kemmerer:
Using the ASTRAL Model Checker to Analyze Mobile IP. ICSE 1999: 132-142 - [c1]Zhe Dang, Richard A. Kemmerer:
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications. RTCSA 1999: 174-181
Coauthor Index
maintained by 
at 
at 
last updated on 2018-08-15 01:55 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint