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

Ershov Memorial Conference最新文献

筛选
英文 中文
RSSA: A Reversible SSA Form 可逆的SSA表格
Ershov Memorial Conference Pub Date : 2015-08-24 DOI: 10.1007/978-3-319-41579-6_16
Torben Æ. Mogensen
{"title":"RSSA: A Reversible SSA Form","authors":"Torben Æ. Mogensen","doi":"10.1007/978-3-319-41579-6_16","DOIUrl":"https://doi.org/10.1007/978-3-319-41579-6_16","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133632127","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}
引用次数: 7
Applying MDA to Generate Hadoop Based Scientific Computing Applications 应用MDA生成基于Hadoop的科学计算应用
Ershov Memorial Conference Pub Date : 2015-08-24 DOI: 10.1007/978-3-319-41579-6_3
D. Akhmed-Zaki, M. Mansurova, B. Matkerim, Ekateryna Dadykina, B. Kumalakov
{"title":"Applying MDA to Generate Hadoop Based Scientific Computing Applications","authors":"D. Akhmed-Zaki, M. Mansurova, B. Matkerim, Ekateryna Dadykina, B. Kumalakov","doi":"10.1007/978-3-319-41579-6_3","DOIUrl":"https://doi.org/10.1007/978-3-319-41579-6_3","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697692","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}
引用次数: 0
Program Schemata Technique to Solve Propositional Program Logics Revised 解决命题程序逻辑的程序图式技术修正
Ershov Memorial Conference Pub Date : 2015-08-24 DOI: 10.1007/978-3-319-41579-6_19
N. Shilov
{"title":"Program Schemata Technique to Solve Propositional Program Logics Revised","authors":"N. Shilov","doi":"10.1007/978-3-319-41579-6_19","DOIUrl":"https://doi.org/10.1007/978-3-319-41579-6_19","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115596854","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}
引用次数: 1
A Sufficient Condition for the Observational Equivalence of Processes 过程观测等价的一个充分条件
Ershov Memorial Conference Pub Date : 2014-07-28 DOI: 10.29007/hs67
A. Mironov
{"title":"A Sufficient Condition for the Observational Equivalence of Processes","authors":"A. Mironov","doi":"10.29007/hs67","DOIUrl":"https://doi.org/10.29007/hs67","url":null,"abstract":"The article deals with the problem of proving observational equivalence for the class of computational processes called processes with message passing. These processes can execute actions of the following forms: sending or receiving of messages, checking logical conditions and updating values of internal variables of processes. Our main result is a theorem that reduces the problem of proving observational equivalence of a pair of processes with message passing to the problem of nding formulas associated with pairs of states of these processes, satisfying certain conditions that are associated with transitions of these processes. This reduction is a generalization of Floyd’s method of owchart verication, which reduces the problem of verication of owcharts to the problem of nding formulas (called intermediate assertions) associated with points in the owcharts and satisfying conditions, corresponding to transitions in the owcharts. The above method of proving observational equivalence of processes with message passing is illustrated by a sliding window protocol verication.","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121114095","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}
引用次数: 0
Turchin's Relation and Subsequence Relation in Loop Approximation 环近似中的Turchin关系和子序列关系
Ershov Memorial Conference Pub Date : 2014-07-28 DOI: 10.29007/xqx9
A. Nepeivoda
{"title":"Turchin's Relation and Subsequence Relation in Loop Approximation","authors":"A. Nepeivoda","doi":"10.29007/xqx9","DOIUrl":"https://doi.org/10.29007/xqx9","url":null,"abstract":"The paper studies the subsequence relation through a notion of an intransitive binary relation on words in traces generated by prefix-rewriting systems. The relation was introduced in 1988 by V.F. Turchin for loop approximation in supercompilation. We study properties of this relation and introduce some refinements of the subsequence relation that inherit the useful features of Turchin’s relation.","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132902761","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}
引用次数: 2
Making the Evolution of Graphical Models Visible 使图形模型的演变可见
Ershov Memorial Conference Pub Date : 2014-07-28 DOI: 10.29007/fqc6
T. Baar, Issam Bendaas
{"title":"Making the Evolution of Graphical Models Visible","authors":"T. Baar, Issam Bendaas","doi":"10.29007/fqc6","DOIUrl":"https://doi.org/10.29007/fqc6","url":null,"abstract":"With adoption of the UML and other graphical languages by software industry, graphical models became a cornerstone in today’s software development practice. As other artefacts such as program source code, graphical models evolve over time and are, thus, put regularily under version control. In order to deeply understand the role an artefact plays within a project, it is sometimes helpful to review the history of this artefact. While there are numerous tools available that make it easy for a user to grasp the evolution of textual les (or even portions of it), an adequate support for graphical les has remained to be an area of niche products. In this paper, we argue that a better support for reviewing the version history of graphical les can facilitate the work with graphical models. In order to support this claim, we implemented a prototypcical tool that can extract and display the version history of any graphical le stored in a GitHub-repository. In addition, users can annotate each version of a le with comments, what turns our tool into a review tool for software projects. Recently, we started to use the tool is a software engineering course to give students better feedback on complex UML models they have to develop iteratively.","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"33 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129482544","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}
引用次数: 0
Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems 单站点多行程车辆路径问题的多蚁群优化
Ershov Memorial Conference Pub Date : 2014-07-28 DOI: 10.29007/8tjs
Z. Ye, H. Mohamadian
{"title":"Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems","authors":"Z. Ye, H. Mohamadian","doi":"10.29007/8tjs","DOIUrl":"https://doi.org/10.29007/8tjs","url":null,"abstract":"The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different trips as long as the total time or distance is not exceeded. Various approaches are developed to solve the vehicle routing problem (VRP). Except for the simplest cases, VRP is always a computationally complex issue in order to optimize the objective function in terms or both time and expense. Ant colony optimization (ACO) has been introduced to solve the vehicle routing problem. The multiple ant colony system is proposed to search for alternative trails between the source and destination so as to minimize (fuel consumption, distance, time) among numerous geographically scattered routes. The objective is to design adaptive routing so as to balance loads among congesting city networks and to be adaptable to connection failures. As the route number increases, each route becomes less densely packed. It can be viewed as the vehicle scheduling problem with capacity constraints. The proposed scheme is applied to typical cases of vehicle routing problems with a single depot and flexible trip numbers. Results show feasibility and effectiveness of the approach.","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227442","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
Model Checking Value-Passing Modal Specifications 模型检查值传递模态规范
Ershov Memorial Conference Pub Date : 2014-06-24 DOI: 10.1007/978-3-662-46823-4_25
M. T. Beek, S. Gnesi, F. Mazzanti
{"title":"Model Checking Value-Passing Modal Specifications","authors":"M. T. Beek, S. Gnesi, F. Mazzanti","doi":"10.1007/978-3-662-46823-4_25","DOIUrl":"https://doi.org/10.1007/978-3-662-46823-4_25","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"44 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113956426","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}
引用次数: 9
Polynomial-Time Optimal Pretty-Printing Combinators with Choice 多项式时间最优的漂亮印刷组合与选择
Ershov Memorial Conference Pub Date : 2014-06-24 DOI: 10.1007/978-3-662-46823-4_21
A. Podkopaev, D. Boulytchev
{"title":"Polynomial-Time Optimal Pretty-Printing Combinators with Choice","authors":"A. Podkopaev, D. Boulytchev","doi":"10.1007/978-3-662-46823-4_21","DOIUrl":"https://doi.org/10.1007/978-3-662-46823-4_21","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131515752","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}
引用次数: 3
Skeblle: A New Kind of Diagramming Tool with Programmable Active Diagrams Skeblle:一种具有可编程活动图的新型绘图工具
Ershov Memorial Conference Pub Date : 2014-06-24 DOI: 10.1007/978-3-662-46823-4_23
V. K. Sunkara, A. Sane
{"title":"Skeblle: A New Kind of Diagramming Tool with Programmable Active Diagrams","authors":"V. K. Sunkara, A. Sane","doi":"10.1007/978-3-662-46823-4_23","DOIUrl":"https://doi.org/10.1007/978-3-662-46823-4_23","url":null,"abstract":"","PeriodicalId":367126,"journal":{"name":"Ershov Memorial Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133481895","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信