Obserwuj
Zhe Dang
Zhe Dang
Zweryfikowany adres z eecs.wsu.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
Binary reachability analysis of discrete pushdown timed automata
Z Dang, OH Ibarra, T Bultan, RA Kemmerer, J Su
Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000
902000
Pushdown timed automata: a binary reachability characterization and safety verification
Z Dang
Theoretical Computer Science 302 (1-3), 93-121, 2003
722003
Using the ASTRAL model checker for cryptographic protocol analysis
Z Dang, RA Kemmerer
Proc. DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997
631997
Counter machines and verification problems
OH Ibarra, J Su, Z Dang, T Bultan, RA Kemmerer
Theoretical Computer Science 289 (1), 165-189, 2002
532002
Catalytic P systems, semilinear sets, and vector addition systems
OH Ibarra, Z Dang, O Egecioglu
Theoretical Computer Science 312 (2-3), 379-399, 2004
522004
Counter machines: decidable properties and applications to verification problems
OH Ibarra, J Su, Z Dang, T Bultan, R Kemmerer
Mathematical Foundations of Computer Science 2000: 25th International …, 2000
512000
Using the ASTRAL model checker to analyze Mobile IP
Z Dang, RA Kemmerer
Proceedings of the 21st International Conference on Software Engineering …, 1999
411999
Binary reachability analysis of pushdown timed automata with dense clocks
Z Dang
Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001
382001
On stateless automata and P systems
L Yang, Z Dang, OH Ibarra
International Journal of Foundations of Computer Science 19 (05), 1259-1276, 2008
362008
On the solvability of a class of diophantine equations and applications
OH Ibarra, Z Dang
Theoretical computer science 352 (1-3), 342-346, 2006
342006
Characterizations of catalytic membrane computing systems
OH Ibarra, Z Dang, O Egecioglu, G Saxena
International Symposium on Mathematical Foundations of Computer Science, 480-489, 2003
332003
A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems
G Xie, Z Dang, OH Ibarra
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
312003
Liveness verification of reversal-bounded multicounter machines with a free counter
Z Dang, OH Ibarra, PS Pietro
International Conference on Foundations of Software Technology and …, 2001
292001
Composability of infinite-state activity automata
Z Dang, OH Ibarra, J Su
International Symposium on Algorithms and Computation, 377-388, 2004
282004
On P Systems Operating in Sequential Mode.
Z Dang, OH Ibarra
DCFS, 164-177, 2004
272004
The design and analysis of real-time systems using the ASTRAL software development environment
PZ Kolano, Z Dang, RA Kemmerer
Annals of Software Engineering 7 (1), 177-210, 1999
251999
A near-optimal protocol for the grouping problem in RFID systems
X Wang, Z Liu, Y Gao, X Zheng, Z Dang, X Shen
IEEE Transactions on Mobile Computing 20 (4), 1257-1272, 2019
242019
On the decidability of model-checking for P systems
Z Dang, OH Ibarra, C Li, G Xie
J. Autom. Lang. Comb. 11 (3), 279-298, 2006
232006
Information gain of black-box testing
L Yang, Z Dang, TR Fischer
Formal aspects of computing 23, 513-539, 2011
222011
Presburger liveness verification of discrete timed automata
Z Dang, P San Pietro, RA Kemmerer
Theoretical Computer Science 299 (1-3), 413-438, 2003
222003
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20