Skip to main content
SpringerLink
Log in

Testing and Proving Distributed Algorithms in Constructive Type Theory

  • Conference paper
Book cover Tests and Proofs (TAP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4454))

Included in the following conference series:

Abstract

We report our experiences to verify distributed algorithms in constructive type theory by testing and proving. Properties can be tested to eliminate bugs before proving, thus saving expensive proof effort. Both deadlock property and liveness property are proven after testing. The verified algorithm can be executed in Cayenne, a functional programming language with dependent types.

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. Augustsson, L.: Cayenne: a language with dependent types. In: Berman, M., Berman, S. (eds.) ICFP 1998. Proceedings of the third ACM SIGPLAN International Conference on Functional Programming. ACM SIGPLAN Notices, vol. 34, 1, pp. 239–250. ACM Press, New York (1998)

    Chapter  Google Scholar 

  2. Berghofer, S., Nipkow, T.: Random testing in Isabelle/HOL. In: Cuellar, J., Liu, Z. (eds.) SEFM 2004. Software Engineering and Formal Methods, IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  3. Chou, C.-T.: Mechanical verification of distributed algorithms in higher-order logic. In: Melham, T.F., Camilleri, J. (eds.) Higher Order Logic Theorem Proving and Its Applications. LNCS, vol. 859, pp. 158–176. Springer, Heidelberg (1994)

    Google Scholar 

  4. Chandy, K.M., Misra, J.: The drinking philosopher’s problem. ACM Transactions on Programming Languages and Systems 6(4), 632–646 (1984)

    Article  Google Scholar 

  5. Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: ICFP 2000. Proceedings of the ACM SIGPLAN International Conference on Functional Programming, NY, september 18–21, 2000. ACM Sigplan Notices, vol. 35.9, pp. 268–279. ACM Press, New York (2000)

    Chapter  Google Scholar 

  6. Coquand, C.: The Agda homepage, http://www.cs.chalmers.se/~catarina/agda

  7. Coquand, T.: Inductive definitions and type theory: an introduction, http://www-sop.inria.fr/certilab/types-sum-school02/Lnotes/

  8. Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 105–119. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Cover - combining verification methods in software development, http://www.coverproject.org/

  10. Dybjer, P.: Inductive families. Formal Aspects of Computing 6(4), 440–465 (1994)

    Article  MATH  Google Scholar 

  11. Dybjer, P., Haiyan, Q., Takeyama, M.: Random generators for dependent types. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 341–355. Springer, Heidelberg (2005)

    Google Scholar 

  12. Dybjer, P., Haiyan, Q., Takeyama, M.: Combining testing and proving in dependent type theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Dybjer, P., Setzer, A.: A finite axiomatization of inductive and inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 129–146. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Dybjer, P., Setzer, A.: Indexed induction-recursion. In: Kahle, R., Schroeder-Heister, P., Stärk, R.F. (eds.) PTCS 2001. LNCS, vol. 2183, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Groote, J.F., Monin, F., van de Pol, J.: Checking verifications of protocols and distributed systems by computer. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 629–655. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Hallgren, T.: The Alfa homepage, http://www.cs.chalmers.se/~hallgren/Alfa

  17. Hayashi, S., Nakano, H.: PX, a Computational Logic. MIT Press, Cambridge (1988)

    Google Scholar 

  18. Hayashi, S., Sumitomo, R., Shii, K.-i.: Towards animation of proofs - testing proofs by examples. Theoretical Computer Science 272, 177–195 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nordström, B., Petersson, K., Smith, J.M.: Programming in Martin-Löf type theory: an introduction. Oxford University Press, Oxford (1990)

    MATH  Google Scholar 

  20. Programatica: Integrating programming, properties, and validation, http://www.cse.ogi.edu/PacSoft/projects/programatica/

  21. Vaandrager, F.W.: Verification of a distributed summation algorithm. In: Apt, K.R., Schrijver, A., Temme, N.M. (eds.) From Universal Morphisms to Megabytes – a Baayen Space Odyssey, Amsterdam, pp. 593–608. CWI (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-Sen University, Guangzhou 510275, China

    Qiao Haiyan

Authors
  1. Qiao Haiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yuri Gurevich Bertrand Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haiyan, Q. (2007). Testing and Proving Distributed Algorithms in Constructive Type Theory. In: Gurevich, Y., Meyer, B. (eds) Tests and Proofs. TAP 2007. Lecture Notes in Computer Science, vol 4454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73770-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73770-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73769-8

  • Online ISBN: 978-3-540-73770-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation