A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 668-680

  Xie, Gaoyan ^a   Dang, Zhe ^a   Ibarra, Oscar H ^b  

^a Washington State University   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIOPHANTINE EQUATION; LINEAR POLYNOMIALS; NON NEGATIVES; NONNEGATIVE INTEGERS; POSITIVE INTEGERS; VERIFICATION OF INFINITE-STATE SYSTEMS;

COMPUTABILITY AND DECIDABILITY;

EID: 33746358170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_53     Document Type: Article

References (19)

1. R. Alur. Timed automata. In CAV'99, volume 1633 of LNCS, pages 8-22. Springer, 1999.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, April 1994.
3. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: application to model-checking. In CONCUR'97, volume 1243 of LNCS, pages 135-150. Springer, 1997.
4. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747-789, July 1999.
5. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
6. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In CAV'98, volume 1427 of LNCS, pages 268-279. Springer, 1998.
7. Z. Dang. Verifying and debugging real-time infinite state systems (PhD. Dissertation). Department of Computer Science, University of California at Santa Barbara, 2000.
8. Z. Dang, O. Ibarra, and Z. Sun. On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter. In ISAAC'02, volume 2518 of LNCS, pages 103-114. Springer, 2002.
9. Zhe Dang. Binary reachability analysis of pushdown timed automata with dense clocks. In CAV'01, volume 2102 of LNCS, pages 506-517. Springer, 2001.
10. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997. Special Issue: Formal Methods in Software Practice.
11. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-133, January 1978.
12. O. H. Ibarra and Z. Dang. Deterministic two-way finite automata augmented with monotonic counters. 2002 (submitted).
13. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
14. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In CAV'00, volume 1855 of LNCS, pages 36-52. Springer, 2000.
15. K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In CAV'01, volume 2102 of LNCS, pages 493-505. Springer, 2001.
16. Y. V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, 1993.
17. M. Minsky. Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74:437-455, 1961.
18. R. Parikh. On context-free languages. Journal of the ACM, 13:570-581, 1966.
19. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS'86, pages 332-344. IEEE Computer Society Press, 1986.