Skip to main content
SpringerLink
Log in

CDB-PV: A Constraint Database-Based Program Verifier

  • Conference paper
Book cover Abstraction, Reformulation, and Approximation (SARA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4612))

  • 659 Accesses

Abstract

In this paper we present a new system called CDB-PV that uses constraint databases (CDBs) for program verification (PV). The CDB-PV system was implemented in C++ and tested on several sample programs that are difficult to verify using other methods. The CDB-PV system also runs efficiently for the sample programs. The CDB-PV approach is similar to abstract interpretation but it allows non-convex approximations.

This research was supported in part by a NSF grant and a NASA Space and EPSCoR grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kilroy, C.: Investigation: Air france 296 (1997), http://www.airdisaster.com/investigations/af296/af296.shtml

  2. Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming, pp. 106–130 (1976)

    Google Scholar 

  3. Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages, pp. 238–252. ACM Press, New York (1977)

    Chapter  Google Scholar 

  4. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 84–96. ACM Press, New York (1978)

    Chapter  Google Scholar 

  5. Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511–547 (1992)

    Article  MATH  Google Scholar 

  6. Halbwachs, N.: Delay analysis in synchronous programs. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 333–346. Springer, Heidelberg (1993)

    Google Scholar 

  7. Kerbrat, A.: Reachable state space analysis of lotos specifications. In: Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII, London, UK, pp. 181–196. Chapman & Hall, Ltd., Sydney, Australia (1995)

    Google Scholar 

  8. Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1–24. Springer, Heidelberg (2005)

    Google Scholar 

  9. Jaffar, J., Lassez, J.L.: Constraint logic programming. In: POPL 1987. Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, New York, NY, USA, pp. 111–119. ACM Press, New York (1987)

    Chapter  Google Scholar 

  10. Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14(3), 339–395 (1992)

    Article  Google Scholar 

  11. Colmerauer, A.: Note sur prolog iii. In: SPLT’86, Séminaire Programmation en Logique, 159–174 (1986)

    Google Scholar 

  12. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Logic Programming Language CHIP. In: Proceedings of the International Conference on Fifth Generation Computer Systems, vol. 2, pp. 693–702 (1988)

    Google Scholar 

  13. Kanellakis, P., Kuper, G., Revesz, P.: Constraint Query Languages. Journal of Computer and System Science 51(1), 26–52 (1995)

    Article  Google Scholar 

  14. Revesz, P.: A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theoretical Computer Science 116(1-2), 117–149 (1993)

    Article  MATH  Google Scholar 

  15. Revesz, P.: Introduction to Constraint Databases. Springer-Verlag, London (2002)

    MATH  Google Scholar 

  16. Matiyasevich, Y.V.: Hilbert’s Tenth Problem. MIT Press, Cambridge (1993)

    Google Scholar 

  17. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285–309 (1955)

    MATH  Google Scholar 

  18. Ullman, J.: Principles of database and knowledge-base systems. Computer Science Press, Rockville, Md (1988)

    Google Scholar 

  19. Revesz, P.Z.: Reformulation and approximation in model checking. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol. 2371, pp. 202–218. Springer, Heidelberg (2002)

    Google Scholar 

  20. Revesz, P., Chen, R., Kanjamala, P., Li, Y., Liu, Y., Wang, Y.: The MLPQ/GIS constraint database system. In: ACM SIGMOD International Conference on Management of Data (2000)

    Google Scholar 

  21. Revesz, P.: The constraint database approach to software verification. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 329–345. Springer, Heidelberg (2007)

    Google Scholar 

  22. Miné, A.: The octagon abstract domain. In: Proceedings Analysis, Slicing and Transformation, pp. 310–319. IEEE Press, New York (2001)

    Google Scholar 

  23. Anderson, S., Revesz, P.: Verifying the incorrectness of programs and automata. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 1–13. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southern Adventist University, Collegedale, TN 37315, USA

    Scot Anderson

  2. University of Nebraska-Lincoln, NE 68588, USA

    Peter Revesz

Authors
  1. Scot Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Revesz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ian Miguel Wheeler Ruml

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, S., Revesz, P. (2007). CDB-PV: A Constraint Database-Based Program Verifier. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73580-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73579-3

  • Online ISBN: 978-3-540-73580-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation