{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:08:56Z","timestamp":1743142136331,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_24","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:22:37Z","timestamp":1625613757000},"page":"253-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Proof Searching in PVS Theorem Prover Using Simulated Annealing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9856-2885","authenticated-orcid":false,"given":"M. Saqib","family":"Nawaz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6550-7396","authenticated-orcid":false,"given":"Meng","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7680-9899","authenticated-orcid":false,"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"24_CR1","unstructured":"Owre, S., et al.: PVS system guide, PVS prover guide. PVS language reference. Technical report, SRI International, USA (2001)"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development Coq\u2019Art: The Calculus of Inductive Construction. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-71067-7_6","volume-title":"Theorem Proving in Higher Order Logics","author":"K Slind","year":"2008","unstructured":"Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28\u201332. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_6"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-31517-7_4","volume-title":"Fundamentals of Software Engineering","author":"MS Nawaz","year":"2019","unstructured":"Nawaz, M.S., Sun, M., Fournier-Viger, P.: Proof guidance in PVS with sequential pattern mining. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 45\u201360. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31517-7_4"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"119806","DOI":"10.1109\/ACCESS.2020.3004199","volume":"8","author":"MS Nawaz","year":"2020","unstructured":"Nawaz, M.S., et al.: Proof learning in PVS with utility pattern mining. IEEE Access 8, 119806\u2013119818 (2020)","journal-title":"IEEE Access"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Nawaz, M.Z., et al.: Proof searching in HOL4 with genetic algorithm. In: Proceedings of SAC, pp. 513\u2013520. ACM (2020)","DOI":"10.1145\/3341105.3373917"},{"key":"24_CR7","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-91086-4_1","volume-title":"Handbook of Metaheuristics","author":"D Delahaye","year":"2019","unstructured":"Delahaye, D., Chaimatanan, S., Mongeau, M.: Simulated annealing: from basics to applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 1\u201335. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_1"},{"key":"24_CR8","unstructured":"Huang, S.I., Chen, Y.P.: Proving theorems by using evolutionary search with human involvement. In: Proceedings of CEC, pp. 1495\u20131502. IEEE (2017)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Yang, L.A., et al.: Automatically proving mathematical theorems with evolutionary algorithms and proof assistants. In: Proceedings of CEC, pp. 4421\u20134428. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744352"},{"key":"24_CR10","unstructured":"Duncan, H.: The use of data-mining for the automatic formation of tactics. PhD thesis, University of Edinburgh, UK (2007)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Nagashima, Y.: Towards evolutionary theorem proving for Isabelle\/HOL. In: Proceedings of GECCO (Poster), pp. 419\u2013420. ACM (2019)","DOI":"10.1145\/3319619.3321921"},{"key":"24_CR12","unstructured":"Schafer, S., Schulz, S.: Breeding theorem proving heuristics with genetic algorithms. In: Proceedings of GCAI, pp. 263\u2013274. EasyChair (2015)"},{"key":"24_CR13","unstructured":"Nawaz, M.S., et al.: A survey on theorem provers in formal methods. arXiv:cs.SE\/1912.03028 (2019)"},{"issue":"1","key":"24_CR14","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., et al.: A survey of sequential pattern mining. Data Sci. Patt. Recogn. 1(1), 54\u201377 (2017)","journal-title":"Data Sci. Patt. Recogn."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Nawaz, M.S., Sun, M.: Reo2PVS: formal specification and verification of component connectors. In: Proceedings of SEKE, pp. 391\u2013396 (2018)","DOI":"10.18293\/SEKE2018-024"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-31517-7_5","volume-title":"Fundamentals of Software Engineering","author":"MS Nawaz","year":"2019","unstructured":"Nawaz, M.S., Sun, M.: Using PVS for modeling and verification of probabilistic connectors. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 61\u201376. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31517-7_5"},{"issue":"1","key":"24_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman, M.: A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 11(1), 86\u201392 (1940)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"24_CR18","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bull. 1(6), 80\u201383 (1945)","journal-title":"Biometrics Bull."},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1007\/s10489-020-01837-7","volume":"51","author":"MS Nawaz","year":"2021","unstructured":"Nawaz, M.S., et al.: Proof searching and prediction in HOL4 with evolutionary\/heuristic and deep learning techniques. Appl. Intell. 51(3), 1580\u20131601 (2021)","journal-title":"Appl. Intell."},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Nawaz, M.S., et al.: An evolutionary\/heuristic-based proof searching framework for interactive theorem prover. Appl. Soft Comput. (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107200","DOI":"10.1016\/j.asoc.2021.107200"},{"key":"24_CR21","unstructured":"Huang, D., et al.: GamePad: a learning environment for theorem proving. In: Proceedings of ICLR (Poster) (2019)"},{"key":"24_CR22","unstructured":"Yang, K., Deng, J.: Learning to prove theorems via interacting with proof assistants. In: Proceedings of ICML, pp. 6984\u20136994. PMLR (2019)"},{"key":"24_CR23","unstructured":"Bansal, K., et al.: HOList: an environment for machine learning of higher order logic theorem proving. In: Proceedings of ICML, pp. 454\u2013463, PMLR (2019)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Sanchez-Stern, A., et al.: Generating correctness proofs with neural networks. In: Proceedings of MAPL@PLDI, pp. 1\u201310. ACM (2020)","DOI":"10.1145\/3394450.3397466"},{"key":"24_CR25","unstructured":"Santo, J.E.: Curry-howard for sequent calculus at last! In: Proceedings of TLCA, pp. 165\u2013179 (2015)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:24:18Z","timestamp":1625613858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}