Skip to main content

InVeSt : A tool for the verification of invariants

Tool Papers

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1427)

Keywords

  • Model Check
  • Invariance Property
  • Verification Condition
  • Local Invariant
  • Abstract System

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This work has been partly performed while the first two authors were visiting the Computer Science Laboratory, SRI International. Their visits were funded by NSF Grants No. CCR-9712383 and CCR-9509931.

References

  1. S. Bensalem and Y. Lakhnech. Automatic generation of invariants. Accepted in Formal Methods in System Design. To appear.

    Google Scholar 

  2. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems automatically and compositionally. Accepted in CAV'98, 1998.

    Google Scholar 

  3. S. Bensalem, Y. Lakhnech, and H. Saidi. Powerful techniques for the automatic generation of invariants. In CAV'96, volume 1102 of LNCS. Springer-Verlag, 1996.

    Google Scholar 

  4. E.M. Clarke, E.A. Emerson, and E. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In 10th ACM symp. of Prog. Lang. ACM Press, 1983.

    Google Scholar 

  5. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5), 1994.

    Google Scholar 

  6. D. Dams.Abstract interpretation and partition refinement for model checking. PhD thesis, Technical University of Eindhoven, 1996.

    Google Scholar 

  7. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems: Abstractions preserving ACTL, ECTL and CTL. In PROCOMET. IFIP Transactions, North-Holland/Elsevier, 1994.

    Google Scholar 

  8. J.W. de Bakker. Mathematical Theory of Program Cortrectness. Prentice-Hall, NJ., 1980.

    Google Scholar 

  9. K. Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In FME'96, volume 1051 of LNCS. Springer-verlag, 1996.

    Google Scholar 

  10. J. Hooman. Verifying part of the access.bus protocol using PVS. In Proc. 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1026 of LNCS. Springer-Verlag, 1995.

    Google Scholar 

  11. R.P. Kurshan. Computer-Aided Verification of Coordinating Processes, the automata theoretic approach. Princeton Series in Computer Science. 1994.

    Google Scholar 

  12. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1), 1995.

    Google Scholar 

  13. D. E. Long. Model Checking, Abstraction, and Compositional Reasoning. PhD thesis, Carnegie Mellon, 1993.

    Google Scholar 

  14. Z. Manna, A. Anuchitanukul, N. Bjøner, A. Browne, E. Chang, M. Colon, L. de Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STeP: The Stanford Temporal Prover. Technical report, Stanford Univ., Stanford, CA, 1994.

    Google Scholar 

  15. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Computer Science, 83(1):97–130, 1991.

    CrossRef  Google Scholar 

  16. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.

    Google Scholar 

  17. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, Boston, 1993.

    Google Scholar 

  18. S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. volume 1102 of LNCS, pages 411–414. Springer-Verlag, 1996.

    Google Scholar 

  19. 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, Feb. 1995.

    CrossRef  Google Scholar 

  20. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. 5th Int. Sym. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337–351. Springer-Verlag, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bensalem, S., Lakhnech, Y., Owre, S. (1998). InVeSt : A tool for the verification of invariants. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028771

Download citation

  • DOI: https://doi.org/10.1007/BFb0028771

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64608-2

  • Online ISBN: 978-3-540-69339-0

  • eBook Packages: Springer Book Archive