Pub Date : 1986-03-01DOI: 10.7146/DPB.V15I217.7568
P. Mosses, D. Watt
Formal descriptions of semantics have so far failed to match the acceptance and popularity of formal descriptions of syntax. Thus, in current standards for programming languages, syntax is usually described formally but semantics informally, despite the greater danger of impreciseness in the description of semantics. Possible reasons for this state of affairs are discussed. Action Semantics, which has been developed from Denotational Semantics and Abstract Semantic Algebras, has some features that may make it more attractive than other semantic formalisms. This paper describes and motivates Action Semantics, and gives some realistic examples of its use.
{"title":"The use of action semantics","authors":"P. Mosses, D. Watt","doi":"10.7146/DPB.V15I217.7568","DOIUrl":"https://doi.org/10.7146/DPB.V15I217.7568","url":null,"abstract":"Formal descriptions of semantics have so far failed to match the acceptance and popularity of formal descriptions of syntax. Thus, in current standards for programming languages, syntax is usually described formally but semantics informally, despite the greater danger of impreciseness in the description of semantics. Possible reasons for this state of affairs are discussed. Action Semantics, which has been developed from Denotational Semantics and Abstract Semantic Algebras, has some features that may make it more attractive than other semantic formalisms. This paper describes and motivates Action Semantics, and gives some realistic examples of its use.","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116441197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1982-07-01DOI: 10.7146/DPB.V11I145.6543
P. Mosses
A new approach to the formal description of programming language semantics is described and illustrated. ''Abstract semantic algebras'' are just algebraically-specified abstract data types whose operations correspond to fundamental concepts of programming languages. The values of abstract semantic algebras are taken as meanings of programs in Denotational (or Initial Algebra) Semantics, instead of using Scott domains. This leads to semantic descriptions that clearly exhibit the underlying conceptual analysis, and which are rather easy to modify and extend. Some basic abstract semantic algebras corresponding to fundamental concepts of programming languages are given; they could be used in the description of many different programming languages.
{"title":"Abstract Semantic Algebras","authors":"P. Mosses","doi":"10.7146/DPB.V11I145.6543","DOIUrl":"https://doi.org/10.7146/DPB.V11I145.6543","url":null,"abstract":"A new approach to the formal description of programming language semantics is described and illustrated. ''Abstract semantic algebras'' are just algebraically-specified abstract data types whose operations correspond to fundamental concepts of programming languages. The values of abstract semantic algebras are taken as meanings of programs in Denotational (or Initial Algebra) Semantics, instead of using Scott domains. This leads to semantic descriptions that clearly exhibit the underlying conceptual analysis, and which are rather easy to modify and extend. Some basic abstract semantic algebras corresponding to fundamental concepts of programming languages are given; they could be used in the description of many different programming languages.","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130024898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1981-09-01DOI: 10.7146/DPB.V10I137.7411
Henning Christiansen, N. Jones
A simple algebra-based algorithm for compiler generation is described. Its input is a semantic definition of a programming language, and its output is a ''compiling semantics'' which maps each source program into a sequence of compile-time actions whose net effect on execution is the production of a semantically equivalent target program. The method does not require individual compiler correctness proofs or the construction of specialized target algebras. Source program execution is assumed to proceed by performing a series of elementary actions on a runtime state. A semantic algebra is introduced to represent and manipulate possible execution sequences. A source semantic definition has two parts: A set of semantic equations mapping source programs into terms of the algebra, and an interpretation which gives concrete definitions of the state and the elementary actions on it.
{"title":"Control Flow Treatment in a Simple Semantics-Directed Compiler Generator","authors":"Henning Christiansen, N. Jones","doi":"10.7146/DPB.V10I137.7411","DOIUrl":"https://doi.org/10.7146/DPB.V10I137.7411","url":null,"abstract":"A simple algebra-based algorithm for compiler generation is described. Its input is a semantic definition of a programming language, and its output is a ''compiling semantics'' which maps each source program into a sequence of compile-time actions whose net effect on execution is the production of a semantically equivalent target program. The method does not require individual compiler correctness proofs or the construction of specialized target algebras. Source program execution is assumed to proceed by performing a series of elementary actions on a runtime state. A semantic algebra is introduced to represent and manipulate possible execution sequences. A source semantic definition has two parts: A set of semantic equations mapping source programs into terms of the algebra, and an interpretation which gives concrete definitions of the state and the elementary actions on it.","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124816834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract : This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers.
{"title":"Nondeterminism and the Correctness of Parallel Programs","authors":"L. Flon, N. Suzuki","doi":"10.21236/ada043450","DOIUrl":"https://doi.org/10.21236/ada043450","url":null,"abstract":"Abstract : This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers.","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"49 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1977-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132496792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1016/b978-0-934613-12-5.50008-2
K. Apt, E. Olderog
{"title":"Introduction to Program Verification","authors":"K. Apt, E. Olderog","doi":"10.1016/b978-0-934613-12-5.50008-2","DOIUrl":"https://doi.org/10.1016/b978-0-934613-12-5.50008-2","url":null,"abstract":"","PeriodicalId":432086,"journal":{"name":"Formal Description of Programming Concepts","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130425984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：