{"title":"动态过程创建的组合证明系统","authors":"F. S. Boer","doi":"10.1109/LICS.1991.151663","DOIUrl":null,"url":null,"abstract":"A compositional proof systems for a parallel language, P, with dynamic process creation is presented. It is shown how a dynamic system of processes can be described in terms of specifications of the local processes which involve a characterization of their interface with the environment. The proof system formalizes reasoning about these interfaces on an abstraction level that is at least as high as that of the programming language. The programming language P is described, and two assertion languages, the local one and the global one, are defined. The proof system is described and its soundness and completeness are discussed. >","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"15 1","pages":"399-405"},"PeriodicalIF":0.0000,"publicationDate":"1991-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Compositional Proof System for Dynamic Process Creation\",\"authors\":\"F. S. Boer\",\"doi\":\"10.1109/LICS.1991.151663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A compositional proof systems for a parallel language, P, with dynamic process creation is presented. It is shown how a dynamic system of processes can be described in terms of specifications of the local processes which involve a characterization of their interface with the environment. The proof system formalizes reasoning about these interfaces on an abstraction level that is at least as high as that of the programming language. The programming language P is described, and two assertion languages, the local one and the global one, are defined. The proof system is described and its soundness and completeness are discussed. >\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"15 1\",\"pages\":\"399-405\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1991.151663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1991.151663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Compositional Proof System for Dynamic Process Creation
A compositional proof systems for a parallel language, P, with dynamic process creation is presented. It is shown how a dynamic system of processes can be described in terms of specifications of the local processes which involve a characterization of their interface with the environment. The proof system formalizes reasoning about these interfaces on an abstraction level that is at least as high as that of the programming language. The programming language P is described, and two assertion languages, the local one and the global one, are defined. The proof system is described and its soundness and completeness are discussed. >
![[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
