A comparison of presburger engines for EFSM reachability

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

Volumn 1427 LNCS, Issue , 1998, Pages 280-292

  Shiple, Thomas R ^a   Kukula, James H ^a   Ranjan, Rajeev K ^a  

^a SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; LOGIC CIRCUITS;

ASYMPTOTIC PERFORMANCE; DECISION PROCEDURE; EXTENDED FINITE STATE MACHINE; PRESBURGER; PRESBURGER ARITHMETIC; REACHABILITY; STATE ENUMERATION;

COMPUTER AIDED ANALYSIS;

EID: 84863973748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028752     Document Type: Conference Paper

References (19)

1. T. Amon, G. Bordello, T. Hu, and J. Liu. Symbolic timing verification of timing diagrams using Presburger formulas. In Proc. 34th Design Automat. Conf., pages 226-237, June 1997.
2. M. Biehl, N. Klarlund, and T. Rauhe. Mona: Decidable arithmetic in practice. In B. Jonsson and J. Parrow, editors, Fourth International Symposium Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 1135 of LNCS, Uppsala, Sweden, 1996. Springer-Verlag.
3. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In D. L. Dill, editor, Proc. Computer Aided Verification, volume 818 of LNCS, pages 55-67, Stanford, CA, June 1994. Springer-Verlag.
4. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Trees and Algebra in Programming - CAAP, volume 1059 of LNCS, pages 30-43. Springer-Verlag, 1996. (Pubitemid 126064261)
5. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, and T. Villa. VIS: A system for verification and synthesis. In R. Alur and T. A. Henzinger, editors, Proceedings of the Conference on Computer-Aided Verification, volume 1102 of LNCS, pages 428-432, New Brunswick, NJ, July 1996. Springer-Verlag. (Pubitemid 126101307)
6. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, pages 1-11, Berkeley, CA, 1960. Stanford University Press.
7. T. Bultan, R. Gerber, and C. League. Verifying systems with integer constraints and boolean predicates: A composite approach. In Proceedings of the 1998 International Symposium on Software Testing and Analysis (ISSTA '98), 1998.
8. T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state programs using Presburger arithmetic. In O. Grumberg, editor, Proc. Computer Aided Verification, volume 1254 of LNCS, pages 400-411, Haifa, June 1997. Springer-Verlag. (Pubitemid 127088995)
9. K.-T. Cheng and A. Krishnakumar. Automatic functional test generation using the extended finite state machine model. In Proc. 30th Design Automat. Confi, pages 86-91, June 1993. (Pubitemid 23673283)
10. O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis, editor, Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 365-373. Springer-Verlag, June 1989.
11. S. Devadas. Comparing two-level and ordered binary decision diagram representations of logic functions. IEEE Trans. Computer-Aided Design, 12(5):722-723, May 1993. (Pubitemid 23700431)
12. S. Devadas, K. Keutzer, and A. Krishnakumar. Design verification and reachability analysis using algebraic manipulation. In Proc. Inf'l Conf. on Computer Design, pages 250-258, Oct. 1991.
13. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
14. J. G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, volume 1019 of LNCS, pages 89-110. Springer-Verlag, May 1995. (Pubitemid 126004023)
15. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega library (Version 1.1.0) interface guide, http://www.cs.umd.edu/ projects/omega, Nov. 1996.
16. 2 upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Sciences, 16(3):323 - 332, July 1978.
17. W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8): 102-114, Aug. 1992.
18. B. L. van der Waerden. Modern Algebra, volume 1. Ungar, 1953.
19. P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proc. of Static Analysis Symposium, volume 983 of LNCS, pages 21-32. Springer-Verlag, Sept. 1995.