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

2013 International Symposium on Theoretical Aspects of Software Engineering最新文献

筛选
英文 中文
Surfing with Fun 有趣的冲浪
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.26
Laurent Thiry, M. Hassenforder
{"title":"Surfing with Fun","authors":"Laurent Thiry, M. Hassenforder","doi":"10.1109/TASE.2013.26","DOIUrl":"https://doi.org/10.1109/TASE.2013.26","url":null,"abstract":"The paper presents a formalization of web sites based on functional programming (FP) and graphs. More precisely, it explains how FP can be used to infer and to generate web pages from a data model, or to embed a query language (helpful to search a precise information). As a consequence, the paper also proposes a generic web site to be configured with a (meta)model of a domain, and its application to the CCAlps European project.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121330267","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
Unified Modeling of Active and Reactive Components for Real-Time Systems 实时系统中有功和无功组件的统一建模
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.27
Zhucheng Shao, Jing Liu, Xiaohong Chen, Zuohua Ding, Zhengheng Yuan
{"title":"Unified Modeling of Active and Reactive Components for Real-Time Systems","authors":"Zhucheng Shao, Jing Liu, Xiaohong Chen, Zuohua Ding, Zhengheng Yuan","doi":"10.1109/TASE.2013.27","DOIUrl":"https://doi.org/10.1109/TASE.2013.27","url":null,"abstract":"In component-based architecture, a component is a unit of computation or a data store. Connectors are architectural building blocks used to model interactions among components. However, in some particular complex real-time systems, it is non-determinate and confused to distinguish some modules functioning as components as well as connectors. Therefore, a unified model method is demanded to describe those modules. In this paper, we propose a method to divide components into reactive and active component based on providing or requiring services when they interact with each other. A reactive component provides services and could call services of other reactive components. Active components call reactive components and are used to coordinate reactive components. Active and reactive timed automata are unified defined by extending timed automata to denote them. Then, we redefine the component composition language and present the semantics of composition of timed automata. A case study of Train Integrity Detection System illustrates the usage of our unified models for active and reactive components.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128460106","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
Process Rewrite Systems for Software Model Checking 用于软件模型检查的过程重写系统
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.10
Tayssir Touili
{"title":"Process Rewrite Systems for Software Model Checking","authors":"Tayssir Touili","doi":"10.1109/TASE.2013.10","DOIUrl":"https://doi.org/10.1109/TASE.2013.10","url":null,"abstract":"We consider the verification problem of multithreaded recursive programs. We use Process Rewrite Systems (PRS) to model such programs. This allows the use of all the existing results for the analysis of PRS to analyse multithreaded recursive programs. We first give a fully automatic translation from parallel recursive programs to PRS. As far as we know, this is the first time that a formal translation from multithreaded programs to PRS is given. The obtained PRS is an abstraction of the program. We identify a class of programs for which our translation is exact. We also propose a refinement procedure that allows to create more precise PRS models of a given program. We applied our techniques successfuly for the analysis of two versions of a Windows NT Bluetooth driver.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126537343","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
Planning in Real-Time Domains with Timed CTL Goals via Symbolic Model Checking 基于符号模型检查的定时CTL目标实时域规划
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.9
Daniel Stöhr, S. Glesner
{"title":"Planning in Real-Time Domains with Timed CTL Goals via Symbolic Model Checking","authors":"Daniel Stöhr, S. Glesner","doi":"10.1109/TASE.2013.9","DOIUrl":"https://doi.org/10.1109/TASE.2013.9","url":null,"abstract":"Current methods for planning in real-time environments only consider planning goals with a restricted expressiveness, even those using the temporal logic Timed CTL (TCTL). These approaches support TCTL subsets expressing rather simple reachability goals and safety properties, but do not allow the arbitrary nesting and conjunction of TCTL formulas. However, this is a serious drawback in many practical applications. An example are medical systems that have to repeat an action infinitely often within given time bounds. To close this gap, we provide an algorithm for planning with these goals by adapting concepts from symbolic model checking. Hence, we can automatically generate plans fulfilling more complex tasks within a real-time context, while improving safety and efficiency by using formally founded model checking methods.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125346937","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}
引用次数: 5
Integration of Linear Constraints with a Temporal Logic Programming Language 线性约束与时序逻辑编程语言的集成
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.30
Q. Ma, Zhenhua Duan, Mengfei Yang
{"title":"Integration of Linear Constraints with a Temporal Logic Programming Language","authors":"Q. Ma, Zhenhua Duan, Mengfei Yang","doi":"10.1109/TASE.2013.30","DOIUrl":"https://doi.org/10.1109/TASE.2013.30","url":null,"abstract":"This paper investigates the integration of linear constraints with MSVL. To this end, we first define linear constraint statements and discuss related issues of the incorporation. Further, for calling SMT solvers to solve the newly introduced constraints, we give a translation algorithm from state programs in MSVL with linear constraints to SMT-LIB2.0 script language and then supply a solving procedure.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122036397","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
On Information Flow Control in Event-B and Refinement Event-B中的信息流控制与细化
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.43
C. Mu
{"title":"On Information Flow Control in Event-B and Refinement","authors":"C. Mu","doi":"10.1109/TASE.2013.43","DOIUrl":"https://doi.org/10.1109/TASE.2013.43","url":null,"abstract":"This paper investigates the problem of preserving information flow security in Event-B specification models and during the process of refining an abstract specification to be more concrete. A typed Event-B model is presented to enforce information flow security.We then present an approach to the problem of preserving information flow properties under abstraction refinement. The novelty of the approach is that we formalise refinement transformation in terms of the mathematical concept of Galois connection for the purpose of information-flow analysis and control. That is, the stateinvariant and state-transition predicates of the models are used to generate the Galois connection. We show how the refinement transformation ensures to preserve the security properties during the development steps from the beginning abstract-level specification to a concrete implementation.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125403528","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
GSOS Formalized in Coq GSOS在Coq中正规化
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.34
K. Madlener, S. Smetsers
{"title":"GSOS Formalized in Coq","authors":"K. Madlener, S. Smetsers","doi":"10.1109/TASE.2013.34","DOIUrl":"https://doi.org/10.1109/TASE.2013.34","url":null,"abstract":"Structural operational semantics provides a well known framework to describe the semantics of programming languages, lending itself to formalization in theorem provers. The formalization of syntactic SOS rule formats, which enforce some form of well-behavedness, has so far received less attention. GSOS is a rule format that enjoys the property that the operational semantics and denotational semantics, both derived from the same set of GSOS rules, are consistent. The present paper formalizes the underlying theory in the theorem prover COQ, and proves the consistency property, also known as the adequacy theorem. The inspiration for our work has been drawn from the field of bialgebraic semantics.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"21 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120904265","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}
引用次数: 6
A Timing Verification Framework for AUTOSAR OS Component Development Based on Real-Time Maude 基于实时模态的AUTOSAR OS组件开发时序验证框架
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.12
Longfei Zhu, Peng Liu, Jianqi Shi, Zheng Wang, Huibiao Zhu
{"title":"A Timing Verification Framework for AUTOSAR OS Component Development Based on Real-Time Maude","authors":"Longfei Zhu, Peng Liu, Jianqi Shi, Zheng Wang, Huibiao Zhu","doi":"10.1109/TASE.2013.12","DOIUrl":"https://doi.org/10.1109/TASE.2013.12","url":null,"abstract":"The AUTOSAR (AUTomotive Open System ARchitecture) is an open standard in automotive industry, aiming at unifying the methodology of the automotive software development. It is drawing increasing attention because of its great concern about the safety of automotive electronics. The safety of automotive electronics greatly depends on the Operating System (OS) components, which fully implement the functionality part of automotive applications. However, taking the complex timing protection mechanism of AUTOSAR OS and random occurrences of interrupt requests (IRs) into consideration, it is hard for the developers to design and configure the OS components correctly or even reconcilably. In this paper, we focus on the timing properties and propose an automatic verification framework, in which developers could analyze the timing behaviors and devise the OS components configuration. Furthermore, three important timing properties are expressed and can be verified in our framework, namely, schedulability, non-fault-propagation, and consistency. As a reduced version of AUTOSAR OS and auxiliary analysis modules have been implemented based on Real-Time Maude, developers could easily employ the tool to experiment with different configurations of OS components.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116662267","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
Formal Analysis of AODV Using Rely-Guarantee 基于可靠保证的AODV形式化分析
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.14
Xiaofeng Wu, Qiwen Xu, Huibiao Zhu
{"title":"Formal Analysis of AODV Using Rely-Guarantee","authors":"Xiaofeng Wu, Qiwen Xu, Huibiao Zhu","doi":"10.1109/TASE.2013.14","DOIUrl":"https://doi.org/10.1109/TASE.2013.14","url":null,"abstract":"Mobile Ad-hoc Networks (MANETs) are increasingly deployed in infrastructureless scenarios. Routing protocol is a crucial solution for MANETs to establish network connections. This paper presents a formal description of the AODV routing protocol and analyzes its properties using relyguarantee method. In our approach the network is specified as a shared variable concurrent program, where communication is modelled by assignment on shared variables. Each parallel component of this program is a specification of route discovery process. The rely-guarantee method allows us to express and verify properties of the protocol on the basis of specifications of its constituent components.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980220","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
Class Diagrams with Equated Association Chains 具有等价关联链的类图
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.35
Ingo Feinerer, G. Salzer, Tanja Sisel
{"title":"Class Diagrams with Equated Association Chains","authors":"Ingo Feinerer, G. Salzer, Tanja Sisel","doi":"10.1109/TASE.2013.35","DOIUrl":"https://doi.org/10.1109/TASE.2013.35","url":null,"abstract":"We investigate properties of class diagrams with multiplicity constraints - as they appear e.g. in model-based engineering or database design - augmented by equational constraints on association chains. Constraints are typically used to generate additional code that throws an exception when a constraint is violated during run-time. Our aim is different: We develop methods to check already at modelling time whether all constraints can be satisfied, to provide suitable user feedback, and to compute optimal instances of the model. In this paper we extend our approach by a family of constraints that has proven relevant in practice, namely equations between chains of associations. Such equational constraints are necessary if we want to specify that the objects reachable via one chain of associations should in fact be the same as reachable via another one.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530914","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学术官方微信