{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:04:28Z","timestamp":1725894268539},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540737698"},{"type":"electronic","value":"9783540737704"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73770-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T16:00:13Z","timestamp":1187971213000},"page":"79-94","source":"Crossref","is-referenced-by-count":2,"title":["Testing and Proving Distributed Algorithms in Constructive Type Theory"],"prefix":"10.1007","author":[{"given":"Qiao","family":"Haiyan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"ACM SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/289423.289451","volume-title":"ICFP 1998","author":"L. Augustsson","year":"1998","unstructured":"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.\u00a034, 1, pp. 239\u2013250. ACM Press, New York (1998)"},{"key":"5_CR2","volume-title":"SEFM 2004","author":"S. Berghofer","year":"2004","unstructured":"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)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/3-540-58450-1_41","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"C.-T. Chou","year":"1994","unstructured":"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.\u00a0859, pp. 158\u2013176. Springer, Heidelberg (1994)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosopher\u2019s problem. ACM Transactions on Programming Languages and Systems\u00a06(4), 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR5","series-title":"ACM Sigplan Notices","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/351240.351266","volume-title":"ICFP 2000","author":"K. Claessen","year":"2000","unstructured":"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\u201321, 2000. ACM Sigplan Notices, vol.\u00a035.9, pp. 268\u2013279. ACM Press, New York (2000)"},{"key":"5_CR6","unstructured":"Coquand, C.: The Agda homepage, \n                  \n                    http:\/\/www.cs.chalmers.se\/~catarina\/agda"},{"key":"5_CR7","unstructured":"Coquand, T.: Inductive definitions and type theory: an introduction, \n                  \n                    http:\/\/www-sop.inria.fr\/certilab\/types-sum-school02\/Lnotes\/"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-44904-3_8","volume-title":"Typed Lambda Calculi and Applications","author":"T. Coquand","year":"2003","unstructured":"Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 105\u2013119. Springer, Heidelberg (2003)"},{"key":"5_CR9","unstructured":"Cover - combining verification methods in software development, \n                  \n                    http:\/\/www.coverproject.org\/"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211308","volume":"6","author":"P. Dybjer","year":"1994","unstructured":"Dybjer, P.: Inductive families. Formal Aspects of Computing\u00a06(4), 440\u2013465 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-3-540-31862-0_25","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"P. Dybjer","year":"2005","unstructured":"Dybjer, P., Haiyan, Q., Takeyama, M.: Random generators for dependent types. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol.\u00a03407, pp. 341\u2013355. Springer, Heidelberg (2005)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10930755_12","volume-title":"Theorem Proving in Higher Order Logics","author":"P. Dybjer","year":"2003","unstructured":"Dybjer, P., Haiyan, Q., Takeyama, M.: Combining testing and proving in dependent type theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, Springer, Heidelberg (2003)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-48959-2_11","volume-title":"Typed Lambda Calculi and Applications","author":"P. Dybjer","year":"1999","unstructured":"Dybjer, P., Setzer, A.: A finite axiomatization of inductive and inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 129\u2013146. Springer, Heidelberg (1999)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45504-3_7","volume-title":"Proof Theory in Computer Science","author":"P. Dybjer","year":"2001","unstructured":"Dybjer, P., Setzer, A.: Indexed induction-recursion. In: Kahle, R., Schroeder-Heister, P., St\u00e4rk, R.F. (eds.) PTCS 2001. LNCS, vol.\u00a02183, Springer, Heidelberg (2001)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/BFb0055652","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.F. Groote","year":"1998","unstructured":"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.\u00a01466, pp. 629\u2013655. Springer, Heidelberg (1998)"},{"key":"5_CR16","unstructured":"Hallgren, T.: The Alfa homepage, \n                  \n                    http:\/\/www.cs.chalmers.se\/~hallgren\/Alfa"},{"key":"5_CR17","volume-title":"PX, a Computational Logic","author":"S. Hayashi","year":"1988","unstructured":"Hayashi, S., Nakano, H.: PX, a Computational Logic. MIT Press, Cambridge (1988)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(00)00350-9","volume":"272","author":"S. Hayashi","year":"2002","unstructured":"Hayashi, S., Sumitomo, R., Shii, K.-i.: Towards animation of proofs - testing proofs by examples. Theoretical Computer Science\u00a0272, 177\u2013195 (2002)","journal-title":"Theoretical Computer Science"},{"key":"5_CR19","volume-title":"Programming in Martin-L\u00f6f type theory: an introduction","author":"B. Nordstr\u00f6m","year":"1990","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.M.: Programming in Martin-L\u00f6f type theory: an introduction. Oxford University Press, Oxford (1990)"},{"key":"5_CR20","unstructured":"Programatica: Integrating programming, properties, and validation, \n                  \n                    http:\/\/www.cse.ogi.edu\/PacSoft\/projects\/programatica\/"},{"key":"5_CR21","unstructured":"Vaandrager, F.W.: Verification of a distributed summation algorithm. In: Apt, K.R., Schrijver, A., Temme, N.M. (eds.) From Universal Morphisms to Megabytes \u2013 a Baayen Space Odyssey, Amsterdam, pp. 593\u2013608. CWI (1994)"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73770-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:58:36Z","timestamp":1619517516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73770-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540737698","9783540737704"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73770-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}