{"title":"完整的一阶规格的正确性","authors":"W. Reif","doi":"10.1109/SEKE.1992.227918","DOIUrl":null,"url":null,"abstract":"Investigates an algebraic specification method for abstract data types which is designed for the application in formal software development. The specification language is full first-order logic, and the semantics of a specification is the class of its generated models. Full first-order specifications are more flexible than Horn clause specifications and exhibit better deductive properties. The author presents criteria for the correctness of full first-order specifications and for the incremental development of large specifications from smaller ones.<<ETX>>","PeriodicalId":191866,"journal":{"name":"Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Correctness of full first-order specifications\",\"authors\":\"W. Reif\",\"doi\":\"10.1109/SEKE.1992.227918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Investigates an algebraic specification method for abstract data types which is designed for the application in formal software development. The specification language is full first-order logic, and the semantics of a specification is the class of its generated models. Full first-order specifications are more flexible than Horn clause specifications and exhibit better deductive properties. The author presents criteria for the correctness of full first-order specifications and for the incremental development of large specifications from smaller ones.<<ETX>>\",\"PeriodicalId\":191866,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEKE.1992.227918\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEKE.1992.227918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Investigates an algebraic specification method for abstract data types which is designed for the application in formal software development. The specification language is full first-order logic, and the semantics of a specification is the class of its generated models. Full first-order specifications are more flexible than Horn clause specifications and exhibit better deductive properties. The author presents criteria for the correctness of full first-order specifications and for the incremental development of large specifications from smaller ones.<>