A comparison of Presburger engines for EFSM reachability

This publication has 15 references indexed in Scilit:

• Design verification and reachability analysis using algebraic manipulation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Symbolic model checking of infinite state systems using presburger arithmetic
  Published by Springer Nature ,1997
• VIS: A system for verification and synthesis
  Lecture Notes in Computer Science, 1996
• An automata-theoretic approach to Presburger arithmetic constraints
  Published by Springer Nature ,1995
• Symbolic verification with periodic sets
  Published by Springer Nature ,1994
• Comparing two-level and ordered binary decision diagram representations of logic functions
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
• Automatic functional test generation using the extended finite state machine model
  Published by Association for Computing Machinery (ACM) ,1993
• A practical algorithm for exact array dependence analysis
  Communications of the ACM, 1992
• Verification of synchronous sequential machines based on symbolic execution
  Published by Springer Nature ,1990
• A 222pn upper bound on the complexity of Presburger Arithmetic
  Journal of Computer and System Sciences, 1978