检索结果-内蒙古大学图书馆

LearnLib: A framework for extrapolating behavioral models

International Journal on software Tools for Technology Transfer 2009年第5期11卷 393-407页

作者： Raffelt, Harald Steffen, Bernhard Berg, Therese Margaria, Tiziana Department of Programming Systems TU Dortmund Otto-Hahn-Str. 14 44227 Dortmund Germany Department of Information Technology Uppsala University 751 05 Uppsala Sweden Department of Services and Software Engineering Universität Potsdam August-Bebel-Str. 89 14482 Potsdam Germany

In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of their envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios. © Springer-Verlag 2009.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Relational concurrent refinement part II: Internal operations and outputs

引用

FORMAL ASPECTS OF COMPUTING 2009年第1-2期21卷 65-102页

作者： Boiten, Eerke Derrick, John Schellhorn, Gerhard Univ Kent Comp Lab Canterbury CT2 7NF Kent England Univ Sheffield Dept Comp Sci Sheffield S1 4DP S Yorkshire England Univ Augsburg Inst Software Engn & Programming Languages Dept Comp Sci D-86135 Augsburg Germany

Two styles of description arise naturally in formal specification: state-based and behavioural. In state-based notations, a system is characterised by a collection of variables, and their values determine which actions may occur throughout a system history. Behavioural specifications describe the chronologies of actions-interactions between a system and its environment. The exact nature of such interactions is captured in a variety of semantic models with corresponding notions of refinement;refinement in state based systems is based on the semantics of sequential programs and is modelled relationally. Acknowledging that these viewpoints are complementary, substantial research has gone into combining the paradigms. The purpose of this paper is to do three things. First, we survey recent results linking the relational model of refinement to the process algebraic models. Specifically, we detail how variations in the relational framework lead to relational data refinement being in correspondence with traces-divergences, singleton failures and failures-divergences refinement in a process semantics. Second, we generalise these results by providing a general flexible scheme for incorporating the two main "erroneous" concurrent behaviours: deadlock and divergence, into relational refinement. This is shown to subsume previous characterisations. In doing this we derive relational refinement rules for specifications containing both internal operations and outputs that corresponds to failures-divergences refinement. Third, the theory has been formally specified and verified using the interactive theorem prover KIV.

关键词： Data refinement Z Simulations, Process algebraic semantics Failures-divergences refinement Deadlock Internal operations Outputs Mechanisation KIV

来源：评论

学校读者我要写书评

暂无评论

Generating formal specifications for security-critical applications - A model-driven approach

Generating formal specifications for security-critical appli...

引用

International Workshop on software Engineering for Secure Systems (SESS)

作者： Nina Moebius Kurt Stenzel Wolfgang Reif Department of Software Engineering and Programming Languages Institute of Computer Science University of Augsburg Augsburg Germany

ISBN: (纸本)9781424437252

The SecureMDD approach aims to generate both, a formal specification for verification and executable code, from UML diagrams. The UML models define the static as well as dynamic components of the system under development. This model-driven approach is focused on security-critical applications that are based on cryptographic protocols, especially Java Card applications. In this paper we describe the generation of the formal specification from the UML model which is then used as input for our interactive verification system KIV. The formal specification is based on abstract state machines and algebraic specifications. It allows to formulate and to prove application-specific security properties.

关键词： Formal specifications Object oriented modeling Unified modeling language Cryptographic protocols Java Security Application software software engineering Computer languages Computer science

来源：评论

学校读者我要写书评

暂无评论

Dynamic testing via automata learning

Dynamic testing via automata learning

引用

作者： Raffelt, Harald Merten, Maik Steffen, Bernhard Margaria, Tiziana TU Dortmund Programming Systems University of Dortmund Otto-Hahn-Str. 14 44227 Dortmund Germany Service and Software Engineering Universität Potsdam August-Bebel-Str. 89 14482 Potsdam Germany

This paper presents dynamic testing, a method that exploits automata learning to systematically test (black box) systems almost without prerequisites. Based on interface descriptions and optional sample test cases, our method successively explores the system under test (SUT), in order to extrapolate a behavioural model. This is in turn used to steer the further exploration process. Due to the applied learning technique, our method is optimal in the sense that the extrapolated models are most concise (i.e. state minimal) in consistently representing all the information gathered during the exploration. Using the LearnLib, our framework for automata learning, our method can be elegantly combined with numerous optimisations of the learning procedure, with various choices of model structures, and with the option of dynamically/ interactively enlarging the alphabet underlying the learning process. The latter is important in the Web context, where totally new situations may arise when following links. All these features are illustrated using as a case study the web application Mantis, a bug tracking system widely used in practice. In addition, we present another case study that demonstrates the scalability of the approach. We show how the dynamic testing procedure works and how behavioural models arise that concisely summarize the current testing effort. It turns out that these models reveal the system structure from a user perspective. Besides steering the automatic exploration process, they are ideal for user guidance and to support analyses to improve the system understanding, as they reveal the system structure from a user perspective. © Springer-Verlag 2009.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Dynamic testing via automata learning

引用

International Journal on software Tools for Technology Transfer 2009年第4期11卷 307-324页

作者： Raffelt, Harald Merten, Maik Steffen, Bernhard Margaria, Tiziana TU Dortmund Chair of Programming Systems University of Dortmund Dortmund Germany Chair of Service and Software Engineering Universität Potsdam Potsdam Germany

This paper presents dynamic testing, a method that exploits automata learning to systematically test (black box) systems almost without prerequisites. Based on interface descriptions and optional sample test cases, our method successively explores the system under test (SUT), in order to extrapolate a behavioural model. This is in turn used to steer the further exploration process. Due to the applied learning technique, our method is optimal in the sense that the extrapolated models are most concise (i.e. state minimal) in consistently representing all the information gathered during the exploration. Using the LearnLib, our framework for automata learning, our method can be elegantly combined with numerous optimisations of the learning procedure, with various choices of model structures, and with the option of dynamically/interactively enlarging the alphabet underlying the learning process. The latter is important in the Web context, where totally new situations may arise when following links. All these features are illustrated using as a case study the web application Mantis, a bug tracking system widely used in practice. In addition, we present another case study that demonstrates the scalability of the approach. We show how the dynamic testing procedure works and how behavioural models arise that concisely summarize the current testing effort. It turns out that these models reveal the system structure from a user perspective. Besides steering the automatic exploration process, they are ideal for user guidance and to support analyses to improve the system understanding, as they reveal the system structure from a user perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantitative Approaches in Object-Oriented software Engineering Report on the 12th Workshop QAOOSE at ECOOP 2008

引用

22nd European Conference on Object-Oriented programming (ECOOP 2008)

作者： Falcone, Giovanni Gueheneuc, Yaan-Gael Lange, Christian F. J. Porkolab, Zoltan Sahraoui, Houari Univ Mannheim Lehrstuhl Softwaretech D-6800 Mannheim 1 Germany Univ Montreal Dept Comp Sci & Operat Res Montreal PQ Canada Eindhoven Univ Technol Software Engn & Technol Grp Eindhoven Netherlands Eotvos Lorand Univ Dep Programming Languages & Compliers Budapest Hungary

ISBN: (纸本)9783642020469

The QAOOSE2008 workshop has been held at, ECOOP 2008 conference in Paphos, Cyprus on July 8th, 2008. This was the twelfth of the series of QAOOSE workshops intended to bring researchers and practitioners both from academia and industry together. The workshop provided a forum to discuss the current state of the art and the practice in the area of quantitative approaches in the related to object-orientation. This report includes a summary of the technical presentations and the subsequent discussions. Six papers has been accepted by the workshop organizers. The presentations were followed by vivid discussions.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A global operating system for HPC clusters

A global operating system for HPC clusters

引用

IEEE International Conference on Cluster Computing

作者： Emiliano Betti Marco Cesati Roberto Gioiosa Francesco Piermaria System Programming Research Group Univ. of Rome "Tor Vergata" Rome Italy System Programming Research Group Univ. of Rome "Tor Vergata" Rome Italy BlueGene Software Division IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Modern supercomputers consist of clusters of thousands of independent nodes interconnected through fast networks. These nodes run independent operating system kernels, thus synchronization among them is demanded for user mode programs. This means that temporal synchronization of the nodes is a daunting task. On the other hand, HPC cluster applications often require a rather strict temporal synchronization for activities like performance analysis, application debugging, or data checkpointing. Therefore, the performance of an HPC parallel application may be severely impaired by the lack of temporal synchronization among the activities of the nodes of the cluster; this poses a severe limit on the scalability of such architectures. In this paper we introduce CAOS, an extension of the Linux kernel that aims to address the temporal synchronization problems of modern HPC clusters. We describe the general ideas behind CAOS, and we discuss some details of a possible implementation. We also illustrate some experiments performed on a prototype implementation of CAOS including a centralized network time tick, which allows a master node to synchronize the activities of all other nodes in the cluster, and a specific task scheduler tailored for HPC applications. These experiments, performed on a modern HPC cluster, witness that this new component has no measurable impact on the efficiency of the nodes while reducing the OS noise and providing better performance prediction. An implementation of CAOS based on this component can achieve a significant gain in terms of synchronization, global control, and scalability of the cluster.

关键词： Operating systems Kernel Scalability Supercomputers Performance analysis Debugging Checkpointing Linux Prototypes Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Integrated Reservoir Prediction and Oil-Gas Evaluation in the Maoshan Area

引用

Acta Geologica Sinica - English Edition 2010年第3期74卷

作者： HAO Peidong CUI Xiuqin No. 6 Geophysical Prospecting Party East China Petroleum Bureau China National Star Petroleum Corporation Building 9 Tiantan Xincun Guanghua Rd. Nanjing 210007 Hao Peidong Born in 1954 graduated from Changchun College of Geology in 1982 majoring in geophysical prospecting of petroleum. His researches include data acquisition processing and interpretation of gravity and magnetic exploration and lithosphere deep geology research seismic interpretation comprehensive interpretation of oil/gas exploration comprehensive research of reservoir petroleum pool description and software programming.

Abstract The Maoshan area is an area with well-developed igneous rocks and complex structures. The thickness of the reservoirs is generally small. The study of the reservoirs is based on seismic data, logging data and geological data. Using techniques and software such as Voxelgeo, BCI, RM, DFM and AP, the authors have made a comprehensive analysis of the lateral variation of reservoir parameters in the Upper Shazu bed of the third member of the Palaeogene Funing Formation, and compiled the thickness map of the Shazu bed. Also, with the data from ANN, BCI and the abstracting method for seismic characteristic parameters in combination with the structural factors, the authors have tried the multi-parameter and multi-method prediction of petroleum, delineated the potential oil and gas areas and proposed two well sites. The prediction of oil and gas for Well JB2 turns out to be quite successful.

关键词： integrated reservoir prediction oil and gas evaluation Maoshan area Northern Jiangsu basin

来源：评论

学校读者我要写书评

暂无评论

Model Based Safety Analysis

引用

IFAC Proceedings Volumes 2009年第5期42卷 3-3页

作者： Wolfgang Reif Department of Software Engineering and Programming Languages Institute of ComputerScience University of Augsburg 86135 Augsburg Germany

In safety critical applications, the growing complexity and risk associated with embedded software intensive systems demands for reliable safety assessments. Additionally, in many application areas standards and norms require the usage of model based techniques to guarantee the quality of safety critical systems. Model based safety analysis is a formally grounded approach to compute reliable safety properties from system models. In this context the term safety covers functional correctness, failure tolerance, safety optimisation as well as balancing antagonistic safety concerns. The analysis has both qualitative and quantitative aspects. Systems under consideration are discrete reactive systems. An extension also applies to self-organising systems. The talk presents the approach as well as some interesting applications. Wolfgang Reif is a full professor of Computer Science at the University of Augsburg, Germany. He is Dean of the Faculty of Applied Computer Science, Director of the Institute for software & Systems Engineering, and Director of the elite graduate program software Engineering wihtin the Bavarian Elite Network (joint program with TU Muenchen and LMU Muenchen).

关键词：

来源：评论

学校读者我要写书评

暂无评论

The gap in circumventing the impossibility of consensus

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2008年第5期74卷 823-830页

作者： Guerraoui, Rachid Kuznetsov, Petr Max Planck Inst Software Syst D-66123 Saarbrucken Germany Ecole Polytech Fed Lausanne Distributed Programming Lab CH-1015 Lausanne Switzerland

The impossibility of reaching deterministic consensus in an asynchronous and crash prone system was established for a weak variant of the problem, usually called weak consensus, where a set of processes need to decide on a common value in {0, 1}, so that both 0 and 1 are possible decision values. On the other hand, approaches to circumventing the impossibility focused on a stronger variant of the problem, called consensus, where the processes need to decide on one of the values they initially propose (0 or 1). This paper studies the computational gap between the two problems. We show that any set of deterministic object types that, combined with registers, implements weak consensus, also implements consensus. Then we exhibit a non-deterministic type that implements weak consensus, among any number of processes, but, combined with registers, cannot implement consensus even among two processes. In modern terminology, this type has consensus power I and weak consensus power infinity. (c) 2007 Elsevier Inc. All rights reserved.

关键词： asynchronous distributed system consensus weak consensus FLP impossibility atomic objects determinism

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：