skip to main content
abstract

Automatic versus interactive program verification

Published:10 November 2013Publication History
Skip Abstract Section

Abstract

We report on experiences in using two very different program verification technologies. One of them is based on object-oriented assertion languages and it comes with automatic static verification of object-oriented programs. The other technology is independent of a programming language or programming paradigm and it offers static interactive verification of very complex constraints. These two technologies were applied to the problem of static verification of object-oriented transactions. The problem was chosen because database technologies are not equipped to handle general integrity constraints and verification technologies are not used to verify transactions. The implications of static verification on data integrity, effciency, and reliability of transactions are significant.

References

  1. S. Alagic and A. Fazeli, Verifiable object-oriented transactions, Proceedings of COB 2012 (Concurrent Objects and Beyond), LNCS, to appear.Google ScholarGoogle Scholar
  2. S. Alagic, P. Bernstein, and R. Jairath, Object-oriented constraints for XML Schema, Proceedings of ICOODB 2010, LNCS 6348, pp. 101--118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. I. G. Baltopoulos, J. Borgstrom, and A. G. Gordon, Maintaining database integrity with refinement types, Proceedings of ECOOP 2011, LNCS 6813, pp. 484--509, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Microsoft Corp., Spec#, http://research.microsoft.com/specsharp/.Google ScholarGoogle Scholar
  5. S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Clavert: PVS Language Reference, SRI International, Computer Science Laboratory, http://pvs.csl.sri.com/doc/pvs-language-reference.pdf.Google ScholarGoogle Scholar
  6. T. Sheard and D. Stemple, Automatic verification of database transaction safety, ACM TODS 14, pp. 322--368, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Automatic versus interactive program verification

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGAda Ada Letters
          ACM SIGAda Ada Letters  Volume 33, Issue 3
          HILT '13
          December 2013
          80 pages
          ISSN:1094-3641
          DOI:10.1145/2658982
          Issue’s Table of Contents
          • cover image ACM Conferences
            HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
            November 2013
            100 pages
            ISBN:9781450324670
            DOI:10.1145/2527269

          Copyright © 2013 Owner/Author

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 November 2013

          Check for updates

          Author Tags

          Qualifiers

          • abstract
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)1

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!