The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Zhe Dang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zhe Dang
    Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:506-518 [Conf]
  2. Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, Jianwen Su
    Binary Reachability Analysis of Discrete Pushdown Timed Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:69-84 [Conf]
  3. Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
    Dense Counter Machines and Verification Problems. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:93-105 [Conf]
  4. Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
    Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:529-539 [Conf]
  5. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On Sequential and 1-Deterministic P Systems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:905-914 [Conf]
  6. Pierluigi San Pietro, Zhe Dang
    Automatic Verification of Multi-queue Discrete Timed Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:159-171 [Conf]
  7. Shuohao Zhang, Curtis E. Dyreson, Zhe Dang
    Compacting XML Data. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2006, pp:767-776 [Conf]
  8. Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun
    Safety Verification for Two-Way Finite Automata with Monotonic Counters. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:326-338 [Conf]
  9. Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
    The Power of Maximal Parallelism in P Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:212-224 [Conf]
  10. Gaoyan Xie, Zhe Dang
    Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach. [Citation Graph (0, 0)][DBLP]
    FATES, 2005, pp:170-186 [Conf]
  11. Cheng Li, Zhe Dang
    Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems. [Citation Graph (0, 0)][DBLP]
    FATES/RV, 2006, pp:100-114 [Conf]
  12. Gaoyan Xie, Zhe Dang
    An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components. [Citation Graph (0, 0)][DBLP]
    FATES, 2004, pp:155-169 [Conf]
  13. Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
    Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:132-143 [Conf]
  14. Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
    Real-Counter Automata and Their Decision Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:198-210 [Conf]
  15. Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen
    Signaling P Systems and Verification Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1462-1473 [Conf]
  16. Gaoyan Xie, Zhe Dang, Oscar H. Ibarra
    A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:668-680 [Conf]
  17. Zhe Dang, Richard A. Kemmerer
    Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:345-354 [Conf]
  18. Zhe Dang, Richard A. Kemmerer
    Using the ASTRAL Model Checker to Analyze Mobile IP. [Citation Graph (0, 0)][DBLP]
    ICSE, 1999, pp:132-142 [Conf]
  19. Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
    On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:103-114 [Conf]
  20. Zhe Dang, Oscar H. Ibarra, Jianwen Su
    Composability of Infinite-State Activity Automata. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:377-388 [Conf]
  21. Oscar H. Ibarra, Zhe Dang
    On Removing the Pushdown Stack in Reachability Constructions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:244-256 [Conf]
  22. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On Symport/Antiport P Systems and Semilinear Sets. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2005, pp:253-271 [Conf]
  23. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena
    Characterizations of Catalytic Membrane Computing Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:480-489 [Conf]
  24. Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer
    Conter Machines: Decidable Properties and Applications to Verification Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:426-435 [Conf]
  25. Zhe Dang, Richard A. Kemmerer
    A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications. [Citation Graph (0, 0)][DBLP]
    RTCSA, 1999, pp:174-181 [Conf]
  26. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
    On Presburger Liveness of Discrete Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:132-143 [Conf]
  27. Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
    On Model-Checking of P Systems. [Citation Graph (0, 0)][DBLP]
    UC, 2005, pp:82-93 [Conf]
  28. Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer
    Past Pushdown Timed Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:74-86 [Conf]
  29. Gaoyan Xie, Cheng Li, Zhe Dang
    New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:163-175 [Conf]
  30. Gaoyan Xie, Cheng Li, Zhe Dang
    Testability of Oracle Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:331-332 [Conf]
  31. Paul Z. Kolano, Zhe Dang, Richard A. Kemmerer
    The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment. [Citation Graph (0, 0)][DBLP]
    Ann. Software Eng., 1999, v:7, n:, pp:177-210 [Journal]
  32. Zhe Dang
    Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  33. Zhe Dang
    The Existence of $\omega$-Chains for Transitive Mixed Linear Relations and Its Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  34. Gaoyan Xie, Zhe Dang
    Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  35. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On the Computational Power of 1-Deterministic and Sequential P Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:133-152 [Journal]
  36. Zhe Dang, Oscar H. Ibarra
    The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:6, pp:911-936 [Journal]
  37. Zhe Dang, Oscar H. Ibarra
    On one-membrane P systems operating in sequential mode. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:867-881 [Journal]
  38. Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
    On various notions of parallelism in P Systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:683-705 [Journal]
  39. Zhe Dang
    Pushdown timed automata: a binary reachability characterization and safety verification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:93-121 [Journal]
  40. Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer
    Past pushdown timed automata and safety verification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:1, pp:57-71 [Journal]
  41. Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
    Generalized discrete timed automata: decidable approximations for safety verificatio. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:59-74 [Journal]
  42. Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
    On two-way nondeterministic finite automata with one reversal-bounded counter. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:59-79 [Journal]
  43. Zhe Dang, Oscar H. Ibarra, Jianwen Su
    On composition and lookahead delegation of e-services modeled by automata, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:344-363 [Journal]
  44. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
    Presburger liveness verification of discrete timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:413-438 [Journal]
  45. Oscar H. Ibarra, Zhe Dang
    Eliminating the storage tape in reachability constructions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:687-706 [Journal]
  46. Oscar H. Ibarra, Zhe Dang
    On two-way FA with monotonic counters and quadratic Diophantine equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:359-378 [Journal]
  47. Oscar H. Ibarra, Zhe Dang
    On the solvability of a class of diophantine equations and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:342-346 [Journal]
  48. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu
    Catalytic P systems, semilinear sets, and vector addition systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:379-399 [Journal]
  49. Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
    Verification in loosely synchronous queue-connected discrete timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1713-1735 [Journal]
  50. Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer
    Counter Machines and Verification Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:165-189 [Journal]
  51. Linmin Yang, Zhe Dang, Oscar H. Ibarra
    Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. [Citation Graph (0, 0)][DBLP]
    UC, 2007, pp:226-241 [Conf]
  52. Gaoyan Xie, Zhe Dang
    Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  53. Optimal Software Testing - A Cooling Down Process. [Citation Graph (, )][DBLP]


  54. Automata on Multisets of Communicating Objects. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002