{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T19:40:09Z","timestamp":1748806809645,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319312194"},{"type":"electronic","value":"9783319312200"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31220-0_12","type":"book-chapter","created":{"date-parts":[[2016,3,12]],"date-time":"2016-03-12T13:59:52Z","timestamp":1457791192000},"page":"165-178","source":"Crossref","is-referenced-by-count":0,"title":["Research on Formal Development of Non-recursive Algorithms of Graph Search"],"prefix":"10.1007","author":[{"given":"Qimin","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyun","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"The Z Notation: A Reference Manual","author":"JR Abrial","year":"1998","unstructured":"Abrial, J.R., Hayes, I.J., Hoare, T.: The Z Notation: A Reference Manual, 2nd edn. Oriel College, Oxford (1998)","edition":"2"},{"key":"12_CR2","volume-title":"Introduction to Algorithms","author":"TH Corman","year":"2001","unstructured":"Corman, T.H., Lieserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"12_CR3","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, New Jersey (1976)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-15025-8_15","volume-title":"Fields of Logic and Computation","author":"CA Furia","year":"2010","unstructured":"Furia, C.A., Meyer, B.: Inferring loop invariants using postconditions. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 277\u2013300. Springer, Heidelberg (2010)"},{"key":"12_CR5","unstructured":"Furia, C.A., Meyer, B.: Inferring loop invariants: analysis, classification, and examples. To appear in ACM Comp. Sur. (2012). http:\/\/arxiv.org\/abs\/1211.4470"},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D Gries","year":"1981","unstructured":"Gries, D.: The Science of Programming. Springer, New York (1981)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-11319-2_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"TA Henzinger","year":"2010","unstructured":"Henzinger, T.A., Hottelier, T., Kov\u00e1cs, L., Voronkov, A.: Invariant and type inference for matrices. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 163\u2013179. Springer, Heidelberg (2010)"},{"key":"12_CR8","volume-title":"Systematic Software Development using VDM","author":"CB Jones","year":"1990","unstructured":"Jones, C.B.: Systematic Software Development using VDM, 2nd edn. Prentice Hall, New York (1990)","edition":"2"},{"key":"12_CR9","volume-title":"B-Method","author":"S Schneider","year":"2001","unstructured":"Schneider, S.: B-Method. Palgrave, Basingstoke (2001)"},{"key":"12_CR10","unstructured":"Janota, M.: Assertion-based loop invariant generation. In: Proceedings of the 1st International Workshop on Invariant Generation (WING 2007) (2007)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-00593-0_33","volume-title":"Fundamental Approaches to Software Engineering","author":"L Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs, L., Voronkov, A.: Finding loop invariants for programs over arrays using a theorem prover. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 470\u2013485. Springer, Heidelberg (2009)"},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07287-5","volume-title":"Formal Engineering for Industrial Software Development","author":"S Liu","year":"2004","unstructured":"Liu, S.: Formal Engineering for Industrial Software Development. Springer, Heidelberg (2004)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Kapur, D., Weimer, W., Forrest, S.: Using dynamic analysis to discover polynomial and array invariants. In: 34th International Conference on Software Engineering (ICSE 2012), pp. 683\u2013693. IEEE (2012)","DOI":"10.1109\/ICSE.2012.6227149"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.jsc.2007.01.002","volume":"42","author":"E Rodriguez-Carbonell","year":"2007","unstructured":"Rodriguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4), 443\u2013476 (2007)","journal-title":"J. Symb. Comput."},{"key":"12_CR15","unstructured":"Smith, D.R.: Designware: software development by refinement. In: Proceedings of the Eight International Conference on Category Theory and Computer Science, Edinburgh, September 1999"},{"key":"12_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9780470050118","volume-title":"Wiley Encyclopaedias of Computer Science and Engineering","author":"BW Wah","year":"2008","unstructured":"Wah, B.W., et al.: Wiley Encyclopaedias of Computer Science and Engineering. Wiley-Interscience, Hoboken (2008)"},{"key":"12_CR17","unstructured":"Wu, G., Xue, J.: PAR method and PAR platform used in development process of software outsourcing. Comput. Mod. 11.042 (2013)"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/BF02943151","volume":"12","author":"J Xue","year":"1997","unstructured":"Xue, J.: A unified approach for developing efficient algorithmic programs. J. Comput. Sci. Technol. 12(4), 314\u2013329 (1997)","journal-title":"J. Comput. Sci. Technol."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02939477","volume":"8","author":"J Xue","year":"1993","unstructured":"Xue, J.: Two new strategies for developing loop invariants and their applications. J. Comput. Sci. Technol. 8(2), 147\u2013154 (1993)","journal-title":"J. Comput. Sci. Technol."},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BF02946498","volume":"13","author":"J Xue","year":"1998","unstructured":"Xue, J.: Formal derivation of graph algorithmic programs using partition-and-recur. J. Comput. Sci. Technol. 13(6), 553\u2013561 (1998)","journal-title":"J. Comput. Sci. Technol."},{"key":"12_CR21","volume-title":"Methods of Programming","author":"J Xue","year":"2002","unstructured":"Xue, J.: Methods of Programming. Higher Education Press, Beijing (2002)"},{"key":"12_CR22","unstructured":"Xue, J.: New concept of loop invariant and its application. In: The 3rd Colloquium on Logic in Engineering Dependable Software. Nanchang, China (2013)"},{"key":"12_CR23","unstructured":"Xue, J.: PAR method and its supporting platform. In: Proceedings of AWCVS 2006, Macao, 29\u201331 October 2006"},{"key":"12_CR24","unstructured":"Xue, J., Davis, R.: A simple program whose derivation and proof is also. In: Proceedings of the First IEEE International Conference on Formal Engineering Method (ICFEM 1997), p. 11. IEEE CS Press (1997)"},{"key":"12_CR25","unstructured":"Xue, J.: Implementation of model-driven development using PAR. In: Keynote Speech on the 6th International Workshop on Harnessing Theories for Tool Support in Software, Nanchang, China (2013)"},{"key":"12_CR26","unstructured":"Zuo, Z., You, Z., Xue, J.: Derivation and formal proof of non-recursive post-order binary tree traversal algorithm. Comput. Eng. Sci. 32(3) (2013)"}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31220-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T19:22:29Z","timestamp":1748805749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31220-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319312194","9783319312200"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31220-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}