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

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

筛选
英文 中文
Optimizing the SAT Decision Ordering of Bounded Model Checking by Structural Information 利用结构信息优化有界模型检验的SAT决策排序
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.11
Liangze Yin, Fei He, M. Gu
{"title":"Optimizing the SAT Decision Ordering of Bounded Model Checking by Structural Information","authors":"Liangze Yin, Fei He, M. Gu","doi":"10.1109/TASE.2013.11","DOIUrl":"https://doi.org/10.1109/TASE.2013.11","url":null,"abstract":"This paper considers bounded model checking for extended labeled transition systems. Bounded model checking relies on a SAT solver to prove (or disprove) the existence of a counterexample with a bounded length. During the translation of a BMC problem to a SAT problem, much useful information is lost. This paper proposes an algorithm to analyze the transition system model, and then utilize the structure information hidden in the model to refine the decision ordering of variables in SAT solving. The basic idea is to guide the search process of SAT solving by the structure of the transition system. Experiments with this heuristic on real industrial designs show 5-12 times speedup over standard bounded model checking.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"31 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":"127094908","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
Incremental Construction of Greibach Normal Form Greibach范式的增量构造
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.42
M. Bals, Christina Jansen, T. Noll
{"title":"Incremental Construction of Greibach Normal Form","authors":"M. Bals, Christina Jansen, T. Noll","doi":"10.1109/TASE.2013.42","DOIUrl":"https://doi.org/10.1109/TASE.2013.42","url":null,"abstract":"This paper presents an incremental version of the well-known algorithm for constructing the Greibach normal form (GNF) of a context-free string grammar. It supports the extension of the grammar by additional rules without the need of reperforming the GNF construction from scratch. Thus it offers an efficiency advantage over the classical GNF algorithm in use cases where grammars are extended at a later stage. It ensures that nonterminals and production rules once generated during GNF construction are not removed due to recomputation of GNF, thus preserving the structure of derivations. We present a commandline tool implementing both the classical and the incremental GNF algorithm and compare both by means of two case studies.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"25 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":"127161379","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
Growing a Language in Pattern Calculus 在模式微积分中培养一门语言
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.37
B. Jay, Jose Vergara
{"title":"Growing a Language in Pattern Calculus","authors":"B. Jay, Jose Vergara","doi":"10.1109/TASE.2013.37","DOIUrl":"https://doi.org/10.1109/TASE.2013.37","url":null,"abstract":"Pattern calculus treats all computation as pattern matching, which is, in turn, central to the implementation of programming languages. Hence, its realisation in the general purpose language bondi provides a natural host in which to develop domain-specific languages (DSLs). bondi is a strongly typed language that supports mixing of programming styles to support the features required for language implementation. In particular, bondi supports queries, views and transformations that can be used to develop object-oriented meta-models. The approach is illustrated by growing a small combinatory language in which each language feature i.e. each production of each grammar, is isolated within a single object-oriented class that captures the rules for parsing, type inference, evaluation and printing. Further, growth is used to support lambda-abstractions, providing good evidence that this combinatory language could grow to support a general purpose programming language.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"8 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":"122699468","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
Model Repair for Markov Decision Processes 马尔可夫决策过程的模型修复
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.20
Taolue Chen, E. M. Hahn, Tingting Han, M. Kwiatkowska, Hongyang Qu, Lijun Zhang
{"title":"Model Repair for Markov Decision Processes","authors":"Taolue Chen, E. M. Hahn, Tingting Han, M. Kwiatkowska, Hongyang Qu, Lijun Zhang","doi":"10.1109/TASE.2013.20","DOIUrl":"https://doi.org/10.1109/TASE.2013.20","url":null,"abstract":"Markov decision processes (MDPs) are often used for modelling distributed systems with probabilistic failure or randomisation. We consider the problem of model repair for MDPs defined as follows: if the MDP fails to satisfy a property, we aim to find new values for the transition probabilities so that the property is guaranteed to hold, while at the same time the cost of repair is minimised. Because solving the MDP repair problem exactly is infeasible, in this paper we focus on approximate solution methods. We first formulate a region-based approach, which yields an interval in which the minimal repair cost is contained. As an alternative, we also consider sampling based approaches, which are faster but unable to provide lower bounds on the repair cost. We have integrated both methods into the probabilistic model checker PRISM and demonstrated their usefulness in practice using a computer virus case study.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"206 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":"116511670","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}
引用次数: 73
Designs with Angelic Nondeterminism 天使非决定论的设计
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.18
P. Ribeiro, Ana Cavalcanti
{"title":"Designs with Angelic Nondeterminism","authors":"P. Ribeiro, Ana Cavalcanti","doi":"10.1109/TASE.2013.18","DOIUrl":"https://doi.org/10.1109/TASE.2013.18","url":null,"abstract":"Hoare and He's Unifying Theories of Programming (UTP) are a predicative relational framework for the definition and combination of refinement languages for a variety of programming paradigms. Previous work has defined a theory for angelic nondeterminism in the UTP; this is basically an encoding of binary multirelations in a predicative model. In the UTP a theory of designs (pre and postcondition pairs) provides, not only a model of terminating programs, but also a stepping stone to define a theory for state-rich reactive processes. In this paper, we cast the angelic nondeterminism theory of the UTP as a theory of designs with the long-term objective of providing a model for well established refinement process algebras like Communicating Sequential Processes (CSP) and Circus.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"66 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":"123480248","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}
引用次数: 10
Modeling and Verification of AUTOSAR OS and EMS Application AUTOSAR OS和EMS应用的建模与验证
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.13
Yunhui Peng, Yanhong Huang, Ting Su, Jian Guo
{"title":"Modeling and Verification of AUTOSAR OS and EMS Application","authors":"Yunhui Peng, Yanhong Huang, Ting Su, Jian Guo","doi":"10.1109/TASE.2013.13","DOIUrl":"https://doi.org/10.1109/TASE.2013.13","url":null,"abstract":"AUTOSAR, derived from OSEK/VDX, is the most popular industrial standard in the automotive electric development. It is challenging to manually verify or validate the correctness and safety of AUTOSAR Operating System (OS) as well as mission-critical or real-time applications built on it. In this paper, we adopt timed CSP to describe and reason about the Schedule Table, a new task scheduling mechanism in AUTOSAR. We also employ timed CSP to model AUTOSAR OS and a realtime application, i.e., the Engine Management System (EMS), based on the Schedule Table mechanism, and verify some safety properties. In addition, we simulate and verify our models in Process Analysis Toolkit (PAT). The result indicates that both AUTOSAR OS and EMS application conform to the specifications and requirements.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"1 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":"122041935","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
Feasibility Analysis of the EFSM Transition Path Combining Slicing with Theorem Proving 结合切片和定理证明的EFSM转移路径可行性分析
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.29
Gongzheng Lu, Huai-kou Miao
{"title":"Feasibility Analysis of the EFSM Transition Path Combining Slicing with Theorem Proving","authors":"Gongzheng Lu, Huai-kou Miao","doi":"10.1109/TASE.2013.29","DOIUrl":"https://doi.org/10.1109/TASE.2013.29","url":null,"abstract":"It is an important problem to generate test data from EFSM model in model-based testing, but it is time-wasting to generate test data for the infeasible paths, so determining the feasibility of the paths before generating test data for them is necessary. The feasibility of EFSM transition paths is analyzed by combing slicing with theorem proving. It is divided into two phases. In the first phase, the transitions related to the predicate on each transition in the path are got by backward slicing. And in the second phase, the feasibility of the path is determined by theorem proving to prove whether the post-condition of the transitions related to the predicate implying the predicate or not. Experimental result shows that the feasibility of the paths can be decided effectively and the number of theorem proving is reduced greatly, the infeasibility of the path also can be checked quicker by the proposed method.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"277 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":"123083324","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
Using Intelligent Proxies to Develop Self-Adaptive Service-Based Systems 利用智能代理开发基于服务的自适应系统
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.41
R. Calinescu, Yasmin Rafiq
{"title":"Using Intelligent Proxies to Develop Self-Adaptive Service-Based Systems","authors":"R. Calinescu, Yasmin Rafiq","doi":"10.1109/TASE.2013.41","DOIUrl":"https://doi.org/10.1109/TASE.2013.41","url":null,"abstract":"We present the theory underpinning the operation of a new tool-supported approach to engineering self-adaptive service-based systems (SBSs), and preliminary results from its evaluation in a telehealth case study. SBSs developed using our approach select their services dynamically, in order to maintain compliance with reliability requirements in the presence of changes in service behaviour. This adaptation is enabled by a new type of web service proxy called an intelligent proxy.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"40 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":"123596152","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}
引用次数: 8
Requirements-Driven Self-Repairing against Environmental Failures 针对环境故障的需求驱动自我修复
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.38
Rui-Zhi Dong, Xin Peng, Y. Yu, Wenyun Zhao
{"title":"Requirements-Driven Self-Repairing against Environmental Failures","authors":"Rui-Zhi Dong, Xin Peng, Y. Yu, Wenyun Zhao","doi":"10.1109/TASE.2013.38","DOIUrl":"https://doi.org/10.1109/TASE.2013.38","url":null,"abstract":"Self-repairing approaches have been proposed to alleviate the runtime requirements satisfaction problem by switching to appropriate alternative solutions according to the feedback monitored. However, little has been done formally on analyzing the relations between specific environmental failures and corresponding repairing decisions, making it a challenge to derive a set of alternative solutions to withstand possible environmental failures at runtime. To address these challenges, we propose a requirements-driven self-repairing approach against environmental failures, which combines both development-time and runtime techniques. At the development phase, in a stepwise manner, we formally analyze the issue of self-repairing against environmental failures with the support of the model checking technique, and then design a sufficient and necessary set of alternative solutions to withstand possible environmental failures. The runtime part is a runtime self-repairing mechanism that monitors the operating environment for unsatisfiable situations, and makes self-repairing decisions among alternative solutions in response to the detected environmental failures.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"58 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":"116354103","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
Verifying Bigraphical Models of Architectural Reconfigurations 验证建筑重构的图形模型
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.25
A. Sánchez, L. Barbosa, D. Riesco
{"title":"Verifying Bigraphical Models of Architectural Reconfigurations","authors":"A. Sánchez, L. Barbosa, D. Riesco","doi":"10.1109/TASE.2013.25","DOIUrl":"https://doi.org/10.1109/TASE.2013.25","url":null,"abstract":"ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems. This paper proposes a structural semantics for ARCHERY, and a method for deriving labelled transition systems (LTS) in which states and transitions represent configurations and reconfiguration operations, respectively. Architectures are modelled by bigraphs and their dynamics by parametric reaction rules. The resulting LTSs can be regarded as Kripke frames, appropriate for verifying reconfiguration constraints over architectural patterns expressed in a modal logic. The derivation method proposed here applies the approach in [1] twice, and combines the results of each application to obtain a label representing a reconfiguration operation and its actual parameters. Labels obtained in this way are minimal and yield LTSs in which bisimulation is a congruence.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"1 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":"124381595","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
下一页 尾页
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学术官方微信