{"title":"自动程序合成通过合成无循环段*","authors":"J. Duran","doi":"10.1109/MARK.1979.8817062","DOIUrl":null,"url":null,"abstract":"Work on theorem-proving-based automatic program synthesis (see Lee, et al. , 7 for example) has been neglected lately. In their 1971 paper, Manna and Waldinger 8 covered one of the main reasons why—the difficulty of synthesizing program loops within the current state of the art of automatic theorem-proving. However, there is a great deal of continuing work in theorem-proving, and it is important that motivating work in related areas such as program synthesis not be neglected.","PeriodicalId":341008,"journal":{"name":"1979 International Workshop on Managing Requirements Knowledge (MARK)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic program synthesis via synthesis of loop-free segments*\",\"authors\":\"J. Duran\",\"doi\":\"10.1109/MARK.1979.8817062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Work on theorem-proving-based automatic program synthesis (see Lee, et al. , 7 for example) has been neglected lately. In their 1971 paper, Manna and Waldinger 8 covered one of the main reasons why—the difficulty of synthesizing program loops within the current state of the art of automatic theorem-proving. However, there is a great deal of continuing work in theorem-proving, and it is important that motivating work in related areas such as program synthesis not be neglected.\",\"PeriodicalId\":341008,\"journal\":{\"name\":\"1979 International Workshop on Managing Requirements Knowledge (MARK)\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1979 International Workshop on Managing Requirements Knowledge (MARK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MARK.1979.8817062\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1979 International Workshop on Managing Requirements Knowledge (MARK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MARK.1979.8817062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic program synthesis via synthesis of loop-free segments*
Work on theorem-proving-based automatic program synthesis (see Lee, et al. , 7 for example) has been neglected lately. In their 1971 paper, Manna and Waldinger 8 covered one of the main reasons why—the difficulty of synthesizing program loops within the current state of the art of automatic theorem-proving. However, there is a great deal of continuing work in theorem-proving, and it is important that motivating work in related areas such as program synthesis not be neglected.