{"title":"面向对象并发语言的精化理论","authors":"Paulo Borba","doi":"10.5753/sbes.1996.24436","DOIUrl":null,"url":null,"abstract":"A notion of refinement for concurrent object-oriented programs was originally presented in [3]. In this article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and non-deterministic internal choice. We also establish a weaker compositionality result for the atomic evaluation constructor, and illustrate how novel compositionality properties can be derived from the basic congruence property.","PeriodicalId":114519,"journal":{"name":"Anais do X Simpósio Brasileiro de Engenharia de Software (SBES 1996)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Refinement Theory for Concurrent Object Oriented Languages\",\"authors\":\"Paulo Borba\",\"doi\":\"10.5753/sbes.1996.24436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A notion of refinement for concurrent object-oriented programs was originally presented in [3]. In this article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and non-deterministic internal choice. We also establish a weaker compositionality result for the atomic evaluation constructor, and illustrate how novel compositionality properties can be derived from the basic congruence property.\",\"PeriodicalId\":114519,\"journal\":{\"name\":\"Anais do X Simpósio Brasileiro de Engenharia de Software (SBES 1996)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do X Simpósio Brasileiro de Engenharia de Software (SBES 1996)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5753/sbes.1996.24436\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do X Simpósio Brasileiro de Engenharia de Software (SBES 1996)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/sbes.1996.24436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Refinement Theory for Concurrent Object Oriented Languages
A notion of refinement for concurrent object-oriented programs was originally presented in [3]. In this article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and non-deterministic internal choice. We also establish a weaker compositionality result for the atomic evaluation constructor, and illustrate how novel compositionality properties can be derived from the basic congruence property.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
