Salsa: Combining constraint solvers with BDDs for automatic invariant checking

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

Volumn 1785 LNCS, Issue , 2000, Pages 378-395

  Bharadwaj, Ramesh ^a   Sims, Steve ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b Reactive Systems Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; SPECIFICATIONS; USER INTERFACES; ALGORITHMS;

ABSTRACT LANGUAGES; CONSTRAINT SOLVERS; EXECUTION SEQUENCES; INTEGRATED DECISION; INVARIANT CHECKING; STATE EXPLOSION PROBLEMS; SYSTEM DESCRIPTION; VERIFICATION CONDITION;

MODEL CHECKING;

EID: 84863921782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_26     Document Type: Conference Paper

References (34)

1. T. A. Alspaugh et al. Software requirements for the A-7E aircraft. Technical Report NRL-9194, Naval Research Laboratory, Wash., DC, 1992.
2. R. J. Anderson, P. Beame, et al. Model checking large software specifications. In Proc. Fourth ACM FSE, October 1996.
3. M. Archer, C. Heitmeyer, and S. Sims. TAME: A PVS interface to simplify proofs for automata models. In Proc. User Interfaces for Theorem Provers, Eindhoven, Netherlands, July 1998. Eindhoven University CS Technical Report.
4. C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Formal Methods In Computer-Aided Design, Volume 1166 of LNCS, pages 187-201, November 1996. (Pubitemid 126149757)
5. S. Bensalem and Y. Lakhnech. Automatic Generation of Invariants. Formal Methods in Systems Design, July 1998.
6. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful techniques for the automatic generation of invariants. In Conference on Computer Aided Verification CAV'96, LNCS 1102, July 1996.
7. R. Bharadwaj and C. Heitmeyer. Applying the SCR requirements method to a simple autopilot. In Proc. Fourth NASA Langley Formal Methods Workshop (LFM97), NASA Langley Research Center, September 1997.
8. st ACM Workshop on Autom. Analysis of Software, 1997.
9. R. Bharadwaj and C. Heitmeyer. Model checking complete requirements specifications using abstraction. Journal of Automated Software Eng., January 1999.
10. R. Bharadwaj and S. Sims. Salsa: Combining decision procedures for fullyautomatic verification. Technical report, Naval Research Laboratory, To appear.
11. N. Bjorner, A. Browne, M. Colon, B. Finkbeiner, Z. Manna, H. Sipma, and T. Uribe. Verifying temporal properties of reactive systems: A step tutorial. Formal Methods in System Design, 1999.
12. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Trees and Algebra in Programming - CAAP, LNCS 1059, 1996.
13. 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. Stanford University Press, 1960.
14. T. Bultan, R. Gerber, and C. League. Verifying systems with integer constraints and boolean predicates: A composite approach. Technical Report UMIACS-TR-97-62, University of Maryland, College Park, MD, August 1997.
15. W. Chan, R. Anderson, P. Beame, and D. Notkin. Combining constraint solving with symbolic model checking for a class of systems with non-linear constraints. In Computer Aided Verification, LNCS, pages 316-327, 1997. (Pubitemid 127088988)
16. William Chan, Richard J. Anderson, Paul Beame, Steve Burns, Francesmary Modugno, David Notkin, and Jon D. Reese. Model checking large software specifications. IEEE Trans. on Softw. Eng., 24(7), July 1998.
17. E. M. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. on Prog. Lang. and Systems, 8(2):244-263, April 1986. (Pubitemid 16633197)
18. J. Elgaard, N. Klarlund, and A. Moller. Mona 1.x: new techniques for ws1s and ws2s. In Computer Aided Verification, CAV '98, LNCS 1427, 1998.
19. Fischer and Rabin. Super-exponential complexity of Presburger arithmetic. In Complexity of Computation: Proceedings of a Symposium in Applied Mathematics of the American Mathematical Society and the Society for Industrial and Applied Mathematics, 1974.
20. M.R. Garey and D.S. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W.H. Freeman and Company, 1979.
21. S. Graf and H. Saidi. Verifying invariants using theorem proving. In Conference on Computer Aided Verification CAV'96, LNCS 1102, Springer Verlag, 1996.
22. C. Heitmeyer, J. Kirby, B. Labaw, M. Archer, and R. Bharadwaj. Using abstraction and model checking to detect safety violations in requirements specifications. IEEE Transactions on Software Engineering, 24:927-947, November 1998.
23. *: A toolset for specifying and analyzing software requirements. In Proc. Computer-Aided Verification, 10th Annual Conf. (CAV'98), Vancouver, Canada, June 1998.
24. C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. Automated consistency checking of requirements specifications. ACM Transactions on Software Engineering and Methodology, 5(3):231-261, July 1996. (Pubitemid 126417405)
25. G. J. Holzmann. The model checker SPIN. IEEE Trans. on Softw. Eng., 23(5):279-295, May 1997. (Pubitemid 127828295)
26. R. Jeffords and C. Heitmeyer. Automatic generation of state invariants from requirements specifications. In Proc. Sixth ACM SIGSOFT Symp. on Foundations of Software Engineering, November 1998.
27. J. Kirby, Jr., M. Archer, and C. Heitmeyer. SCR: A practical approach to building a high assurance COMSEC system. In Proceedings of the 15th Annual Computer Security Applications Conference (ACSAC '99), December 1999.
28. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
29. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
30. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
31. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: A flexible toolset for monadic second-order logic. In Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), Volume 1217 of (LNCS), pages 183-202, Heidelberg, Germany, March 1997. Springer-Verlag. (Pubitemid 127053060)
32. Y. Lakhnech S. Bensalem and S. Owre. In VeSt: A tool for the verification of invariants. In Proc. Computer-Aided Verification, 10th Annual Conf. (CAV'98), Vancouver, Canada, June 1998.
33. Robert E. Shostak. Deciding combinations of theories. JACM, 31(1):1-12, January 1984.
34. th Int'l. Conference, LNCS 1427, 1998.