2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)最新文献

Making sense of recursion patterns 理解递归模式

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229782

P. Bailes, L. Brough

引用次数: 6

Language engineering as an enabler for incrementally defined formal analyses 作为增量定义形式化分析的推动者的语言工程

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229790

D. Ratiu, B. Schätz, M. Völter, Bernd Kolb

{"title":"Language engineering as an enabler for incrementally defined formal analyses","authors":"D. Ratiu, B. Schätz, M. Völter, Bernd Kolb","doi":"10.1109/FORMSERA.2012.6229790","DOIUrl":"https://doi.org/10.1109/FORMSERA.2012.6229790","url":null,"abstract":"There is a big semantic gap between today's general purpose programming languages on the one hand and the input languages of formal verification tools on the other hand. This makes integrating formal analyses into the daily development practice artificially complex. In this paper we advocate that the use of language engineering techniques can substantially improve this situation along three dimensions. First, more abstract and thus more analyzable domain specific languages can be defined, avoiding the need for abstraction recovery from programs written in general purpose languages. Second, restrictions on the use of existing languages can be imposed and thereby more analyzable code can be obtained and analyses can be incrementally defined. Third, by expressing verification conditions and the verification results at the domain level, they are easier to define and the results of analyses are easier to interpret by end users. We exemplify our approach with three domain specific language fragments integrated into the C programming language, together with a set of analyses: completeness and consistency of decision tables, model-checking-based analyses for a dialect of state machines and consistency of feature models. The examples are based on the mbeddr stack, an extensible C language and IDE for embedded software development.","PeriodicalId":192140,"journal":{"name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127909553","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}

引用次数: 29

Revisiting modal interface automata 回顾模态接口自动机

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229786

Ivo Krka, N. Medvidović

{"title":"Revisiting modal interface automata","authors":"Ivo Krka, N. Medvidović","doi":"10.1109/FORMSERA.2012.6229786","DOIUrl":"https://doi.org/10.1109/FORMSERA.2012.6229786","url":null,"abstract":"Modern software systems are typically built of components that communicate through their external interfaces. A component's behavior can be effectively described using finite state automata-based formalisms (e.g., statecharts [5]). The basic formalism, labelled transition systems, describes the behavior of a component in terms of states and labeled transitions. The more advanced formalisms, such as modal transition systems and interface automata, extend LTS to incorporate additional information related to interface operation controllability - distinguishing between input, output, and internal actions - and the possible partiality of a component's specification - distinguishing between required and unknown (maybe) behaviors. Capturing the controllability and partiality aspects of a component's specification facilitates (1) checking interface compatibility, (2) checking whether one component can safely replace another component, and (3) checking whether one specification is a proper refinement of another specification. In this paper, we study the existing definitions of these three types of checks, and then exemplify their limitations in the context of modal interface automata (MIA); MIA is a class of component behavior specifications that incorporates both controllability and partiality information. We outline a set of enhancements to MIA as possible solutions to the identified limitations.","PeriodicalId":192140,"journal":{"name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133154354","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

Further steps towards efficient runtime verification: Handling probabilistic cost models 实现高效运行时验证的进一步步骤:处理概率成本模型

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229785

A. Filieri, C. Ghezzi

{"title":"Further steps towards efficient runtime verification: Handling probabilistic cost models","authors":"A. Filieri, C. Ghezzi","doi":"10.1109/FORMSERA.2012.6229785","DOIUrl":"https://doi.org/10.1109/FORMSERA.2012.6229785","url":null,"abstract":"We consider high-level models that specify system behaviors probabilistically and support the specification of cost attributes. Specifically, we focus on Discrete Time Markov Reward Models (D-MRMs), i.e. state machines where probabilities can be associated with transitions and rewards (costs) can be associated with states and transitions. Through probabilities we model assumptions on the behavior of environment in which an application is embedded. Rewards can instead model the cost assumptions involved in the system's operations. A system is designed to satisfy the requirements, under the given assumptions. Design-time assumptions, however, can turn out to be invalid at runtime, and therefore it is necessary to verify whether changes may lead to requirements violations. If they do, it is necessary to adapt the behavior in a self-healing manner to continue to satisfy the requirements. We have previously presented an approach to support efficient runtime probabilistic model checking of DTMCs for properties expressed in PCTL. In this paper we extend the approach to D-MRMs and reward properties. The benefits of the approach are justified both theoretically and empirically on significant test cases.","PeriodicalId":192140,"journal":{"name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128462226","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}

引用次数: 13

Automated continuous quality assurance 自动化连续质量保证

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229787

Johannes Neubauer, B. Steffen, Oliver Bauer, Stephan Windmüller, Maik Merten, T. Margaria, Falk Howar

引用次数: 16

Augmenting Event-B modelling with real-time verification 通过实时验证增强Event-B建模

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229789

A. Iliasov, A. Romanovsky, L. Laibinis, E. Troubitsyna, T. Latvala

引用次数: 33

Scrum goes formal: Agile methods for safety-critical systems Scrum走向正式:安全关键系统的敏捷方法

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229784

Sune Wolff

引用次数: 45

EMFtoCSP: A tool for the lightweight verification of EMF models EMFtoCSP:用于EMF模型的轻量级验证的工具

2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA) Pub Date : 2012-06-02 DOI: 10.1109/FORMSERA.2012.6229788

Carlos A. González, Fabian Büttner, R. Clarisó, Jordi Cabot

{"title":"EMFtoCSP: A tool for the lightweight verification of EMF models","authors":"Carlos A. González, Fabian Büttner, R. Clarisó, Jordi Cabot","doi":"10.1109/FORMSERA.2012.6229788","DOIUrl":"https://doi.org/10.1109/FORMSERA.2012.6229788","url":null,"abstract":"The increasing popularity of MDE results in the creation of larger models and model transformations, hence converting the specification of MDE artefacts in an error-prone task. Therefore, mechanisms to ensure quality and absence of errors in models are needed to assure the reliability of the MDE-based development process. Formal methods have proven their worth in the verification of software and hardware systems. However, the adoption of formal methods as a valid alternative to ensure model correctness is compromised for the inner complexity of the problem. To circumvent this complexity, it is common to impose limitations such as reducing the type of constructs that can appear in the model, or turning the verification process from automatic into user assisted. Since we consider these limitations to be counterproductive for the adoption of formal methods, in this paper we present EMFtoCSP, a new tool for the fully automatic, decidable and expressive verification of EMF models that uses constraint logic programming as the underlying formalism.","PeriodicalId":192140,"journal":{"name":"2012 First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches (FormSERA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134381509","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}

引用次数: 106