发布求助
文献互助 智能选刊 最新文献

AMAST Series in Computing最新文献

筛选
英文 中文
Formal Models of Computation - The Ultimate Limits of Computing 计算的形式模型-计算的极限
AMAST Series in Computing Pub Date : 2001-03-01 DOI: 10.1142/4592
A. Fleck
{"title":"Formal Models of Computation - The Ultimate Limits of Computing","authors":"A. Fleck","doi":"10.1142/4592","DOIUrl":"https://doi.org/10.1142/4592","url":null,"abstract":"Part 1 The finite state paradigm: regular expressions and acceptors properties of regular languages transducers and other variations. Part 2 Context-free grammars and automata: basic grammar definitions pushdown store automata properties of context-free languages. Part 3 General computability models: context-sensitive languages Turing machines and computability the universal machine and impossible computations.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132892220","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}
引用次数: 4
Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification 面向对象代数规范的语言、证明技术和方法论
AMAST Series in Computing Pub Date : 1998-07-02 DOI: 10.1142/3831
R. Diaconescu, K. Futatsugi
{"title":"Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification","authors":"R. Diaconescu, K. Futatsugi","doi":"10.1142/3831","DOIUrl":"https://doi.org/10.1142/3831","url":null,"abstract":"Basic specifications - signatures models sentences satisfaction proof system structuring specifications - fundamental semantics concepts module imports views parameterized modules module expressions built-in modules proof technologies - rewriting induction coinduction methodologies - nondeterminism concurrent object composition dynamic systems of objects applications in rewriting logic general small methodological advises.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119929","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}
引用次数: 259
Language Prototyping: An Algebraic Specification Approach 语言原型:代数规范方法
AMAST Series in Computing Pub Date : 1996-09-01 DOI: 10.1142/3163
A. Deursen, J. Heering, P. Klint
{"title":"Language Prototyping: An Algebraic Specification Approach","authors":"A. Deursen, J. Heering, P. Klint","doi":"10.1142/3163","DOIUrl":"https://doi.org/10.1142/3163","url":null,"abstract":"From the Publisher: \u0000Language prototyping provides a means to generate language implementations automatically from high-level language definitions. This volume presents an algebraic specification approach to language prototyping; and is centered around the ASF+SDF formalism and Meta-Environment. The volume is an integrated collection of articles covering a number of case studies, and includes several chapters proposing new techniques for deriving advanced language implementations. The accompanying software is freely available.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274908","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}
引用次数: 209
Construction and Analysis of Transition Systems with MEC 基于MEC的过渡系统构建与分析
AMAST Series in Computing Pub Date : 1995-03-01 DOI: 10.1142/2505
A. Arnold, D. Bégay, P. Crubillé
{"title":"Construction and Analysis of Transition Systems with MEC","authors":"A. Arnold, D. Bégay, P. Crubillé","doi":"10.1142/2505","DOIUrl":"https://doi.org/10.1142/2505","url":null,"abstract":"The importance of formal methods in software engineering has been receiving greater acknowledgement. These methods can be used at several stages of the software development process. This book focuses on a method concerning the early stages of design, namely the modeling of a system at conceptual level, and the verification and validation of this model.The mathematical formalism used for modeling and verifying systems is the synchronized product of transition systems. The book introduces this notion and presents several examples of modeling and verification covering various domains: games, industrial processes, communication protocols, etc.These examples are worked out using the \"Mec\" software tool. This book is also intended to be an introduction to this tool which is described in full detail.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133391041","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}
引用次数: 45
Algebraic Specification Techniques and Tools for Software Development: The Act Approach 软件开发的代数规范技术和工具:Act方法
AMAST Series in Computing Pub Date : 1993-11-01 DOI: 10.1142/1877
I. Claßen, H. Ehrig, D. Wolz
{"title":"Algebraic Specification Techniques and Tools for Software Development: The Act Approach","authors":"I. Claßen, H. Ehrig, D. Wolz","doi":"10.1142/1877","DOIUrl":"https://doi.org/10.1142/1877","url":null,"abstract":"Algebraic specfication as formal method for software development ACT one - a language for parameterized specification ACT two - a language for module specification the ACT environment. Appendix: algebraic concepts and operational semantics.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128343929","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}
引用次数: 27
An Algebraic Approach to Compiler Design 编译器设计的代数方法
AMAST Series in Computing Pub Date : 1900-01-01 DOI: 10.1142/2870
A. Sampaio
{"title":"An Algebraic Approach to Compiler Design","authors":"A. Sampaio","doi":"10.1142/2870","DOIUrl":"https://doi.org/10.1142/2870","url":null,"abstract":"This work investigates the design of compilers for procedural languages, based on the algebraic laws which these languages satisfy. The particular strategy adopted is to reduce an arbitrary source program to a general \"normal form\", capable of representing an arbitrary target machine. This is acheived by a series of normal form reduction theorems which are proved algebraically from the more basic laws. The normal form and the related reduction theorems can then be instantiated to design compilers for distinct target machines. This constitutes the main novelty of the author's approach to compilation, together with the fact that the entire process is formalized within a single and uniform semantic framework of a procedural language and its algebraic laws. Furthermore, by mechanizing the approach using the OBJ3 term rewriting system it is shown that a prototype compiler is developed as a byproduct of its own proof of correctness.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"29 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":"128607026","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}
引用次数: 89
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信