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

IEEE/ACM International Conference on Technical Debt (TechDebt)

作者： Christoph Becker Ruzanna Chitchyan Stefanie Betz Curtis McCord Faculty of Information University of Toronto Toronto Canada Department of Computer Science Univeristy of Bristol Bristol UK Institute of Applied Informatics and Formal Description Methods Karlsruhe Institute of Technology Karlsruhe Germany

Technical Debt arises from decisions that favour short-term outcomes at the cost of longer-term disadvantages. They may be taken knowingly or based on missing or incomplete awareness of the costs; they are taken in different roles, situations, stages and ways. Whatever technical or business factor motivate such decisions, they always imply a trade-off in time, a 'now vs. later'. How exactly are such decisions made, and how have they been studied? This paper analyzes how decisions on technical debt are studied in software engineering via a systematic literature review. It examines the presently published Software Engineering research on Technical Debt, with a particular focus on decisions involving time. The findings reveal surprising gaps in published work on empirical research in decision making. We observe that research has rarely studied how decisions are made, even in papers that focus on the decision process. Instead, most attention is focused on engineering measures and feeding them into an idealized decision making process. These findings lead to a set of recommendations for future empirical research on Technical Debt.

关键词： Decision making Software engineering Bibliographies Software Systematics Economics Guidelines

来源：评论

学校读者我要写书评

暂无评论

A balance index for phylogenetic trees based on rooted quartets

arXiv

引用

arXiv 2018年

作者： Coronado, Tomás M. Mir, Arnau Rosselló, Francesc Valiente, Gabriel Department of Mathematics and Computer Science University of the Balearic Islands PalmaE-07122 Spain Algorithms Bioinformatics Complexity and Formal Methods Research Group Technical University of Catalonia BarcelonaE-08034 Spain

We define a new balance index for rooted phylogenetic trees based on the symmetry of the evolutive history of every set of 4 leaves. This index makes sense for multifurcating trees and it can be computed in time linear in the number of leaves. We determine its maximum and minimum values for arbitrary and bifurcating trees, and we provide exact formulas for its expected value and variance on bifurcating trees under Ford's α-model and Aldous' β-model and on arbitrary trees under the α-γ-model. Copyright © 2018, The Authors. All rights reserved.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A model-derivation framework for software analysis

arXiv

引用

arXiv 2017年

作者： Yildiz, Bugra M. Rensink, Arend Bockisch, Christoph Aksit, Mehmet Formal Methods and Tools Group University of Twente Faculty of Mathematics and Computer Science Philipps-Universitat Marburg

Model-based verification allows to express behavioral correctness conditions like the validity of execution states, boundaries of variables or timing at a high level of abstraction and affirm that they are satisfied by a software system. However, this requires expressive models which are difficult and cumbersome to create and maintain by hand. This paper presents a framework that automatically derives behavioral models from real-sized Java programs. Our framework builds on the EMF/ECore technology and provides a tool that creates an initial model from Java bytecode, as well as a series of transformations that simplify the model and eventually output a timed-automata model that can be processed by a model checker such as UPPAAL. The framework has the following properties: (1) consistency of models with software, (2) extensibility of the model derivation process, (3) scalability and (4) expressiveness of models. We report several case studies to validate how our framework satisfies these properties. Copyright © 2017, The Authors. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Estimating Flow Rates through Fracture Networks using Combinatorial Optimization

arXiv

引用

arXiv 2018年

作者： Hobé, A. Vogler, D. Seybold, M.P. Ebigbo, A. Settgast, R.R. Saar, M.O. ETH Zurich Geothermal Energy and Geofluids Institute of Geophysics Zurich Switzerland ETH Zurich Transport Processes and Reactions Laboratory Institute of Process Engineering Zurich Switzerland University of Stuttgart Institute of Formal Methods in Computer Science Stuttgart Germany Lawrence Livermore National Laboratory Atmospheric Earth and Energy Division LivermoreCA United States

MSC Codes 8608 (Primary) 8604 (Secondary)To enable fast uncertainty quantification of fluid flow in a discrete fracture network (DFN), we present two approaches to quickly compute fluid flow in DFNs using combinatorial optimization algorithms. Specifically, the presented Hanan Shortest Path Maxflow (HSPM) and Intersection Shortest Path Maxflow (ISPM) methods translate DFN geometries and properties to a graph on which a max flow algorithm computes a combinatorial flow, from which an overall fluid flow rate is estimated using a shortest path decomposition of this flow. The two approaches are assessed by comparing their predictions with results from explicit numerical simulations of simple test cases as well as stochastic DFN realizations covering a range of fracture densities. Both methods have a high accuracy and very low computational cost, which can facilitate much-needed in-depth analyses of the propagation of uncertainty in fracture and fracture-network properties to fluid flow rates. Copyright © 2018, The Authors. All rights reserved.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Complex Systems Design & Management: Proceedings of the Fourth International Conference on Complex Systems Design & Management CSD&M 2013

引用

2016年

作者： Marc Aiguier Frédéric Boulanger Daniel Krob Clotilde Marchal

ISBN: (纸本)9783319377636

This book contains all refereed papers that were accepted to the fourth edition of the Complex Systems Design & Management (CSD&M 2013) international conference which took place in Paris (France) from December 4-6, 2013. These proceedings cover the most recent trends in the emerging field of complex systems sciences & practices from an industrial and academic perspective, including the main industrial domains (transport, defense & security, electronics, energy & environment, e-services), scientific & technical topics (systems fundamentals, systems architecture & engineering, systems metrics & quality, systemic tools) and system types (transportation systems, embedded systems, software & information systems, systems of systems, artificial ecosystems). The CSD&M 2013 conference is organized under the guidance of the CESAMES non-profit organization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proper protocol

Proper protocol

引用

Frank de Boer on the Occasion of His 60th Birthday, 2016

作者： Arbab, Farhad Formal Methods CWI Science Park 123 Amsterdam1098 XG Netherlands Leiden Institute for Advanced Computer Science Leiden University Leiden Netherlands

ISBN: (纸本)9783319307336

Treating interaction as an explicit first-class concept, complete with its own composition operators, leads to a model of concurrency that allows direct specification and manipulation of protocols as proper mathematical objects. Reo [2,5,6,8] serves as a premier example of such an interaction-centric model of concurrency. In this paper, we peruse Reo and explain how its model of protocols as encapsulated, reusable constructs facilitates their fulfilling of the more prominent role slated for them in engineering of modular, verifiable, scalable concurrent software. We also explore clues enlaced with some recent results of our ongoing work on compiling Reo protocol specifications into efficient executable code, which sketch a promising perspective for future work on high-level protocol specification languages. © Springer International Publishing Switzerland 2016.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Automated verification of nested DFS 20

引用

20th International Workshop on formal methods for Industrial Critical Systems, FMICS 2015

作者： van de Pol, Jaco C. Formal Methods and Tools Department of Computer Science CTIT University of Twente Enschede Netherlands

ISBN: (纸本)9783319194578

In this paper we demonstrate the automated verification of the Nested Depth-First Search (NDFS) algorithm for detecting accepting cycles. The starting point is a recursive formulation of the NDFS algorithm. We use Dafny to annotate the algorithm with invariants and a global specification. The global specification requires that NDFS indeed solves the accepting cycle problem. The invariants are proved automatically by the SMT solver Z3 underlying Dafny. The global specifications, however, need some inductive reasoning on paths in a graph. To prove these properties, some auxiliary lemmas had to be provided. The full specification is contained in this paper. It fits on 4 pages, is verified by Dafny in about 2 minutes, and was developed in a couple of weeks. © Springer International Publishing Switzerland 2015.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

A definition scheme for quantitative bisimulation 13

A definition scheme for quantitative bisimulation

引用

13th Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2015

作者： Latella, Diego Massink, Mieke De Vink, Erik Formal Methods and Tools CNR/ISTI Pisa Italy Department of Mathematics and Computer Science TU/e Eindhoven Netherlands Centrum voor Wiskunde en Informatica Amsterdam Netherlands

FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A general scheme for the definition of a notion of strong bisimulation associated with a FuTS is proposed. It is shown that this notion of bisimulation for a FuTS coincides with the coalgebraic notion of behavioral equivalence associated to the functor on Set given by the type of the FuTS. For a series of concrete quantitative semantical models the notion of bisimulation as reported in the literature is proven to coincide with the notion of quantitative bisimulation obtained from the scheme. The comparison includes models with orthogonal behaviour, like interactive Markov chains, and with multiple levels of behavior, like Markov automata. As a consequence of the general result relating FuTS bisimulation and behavioral equivalence we obtain, in a systematic way, a coalgebraic underpinning of all quantitative bisimulations discussed. © 2015 A. Aldini, M. Bernardo.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

SAT and IP based algorithms for magic labeling including a complete search for total magic labelings

SAT and IP based algorithms for magic labeling including a c...

引用

作者： Jäger, Gerold Arnold, Florian Department of Mathematics and Mathematical Statistics University of Umeå UmeåSE-90187 Sweden Formal Methods and Tools Group Department of Computer Science University of Twente AE EnschedeNL-7500 Netherlands

In this paper a labeling of a graph with n vertices and m edges is a one-to-one mapping from the union of the set of vertices and edges onto the set {1,2,...,m+n}. Such a labeling is defined as magic, if one or both of the following two conditions is fulfilled: the sum of an edge label and the labels of its endpoint vertices is constant for all edges;the sum of a vertex label and the labels of its incident edges is constant for all vertices. If a graph has a labeling fulfilling both conditions, it is called a totally magic graph. We present effective IP and Sat based algorithms for the problem of finding a magic labeling for a given graph, and we extend these algorithms also to find all magic labelings for a given graph. We experimentally compare the resulted algorithms by applying it to random graphs. Finally, we demonstrate its performance by solving small cases of seven open problems within the theory of magic graphs. As main practical result we perform an exhaustive search showing that no totally magic graph with 11 vertices exists. © 2015 Elsevier B.V.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Scalable modeling and analysis of requirements preferences: A qualitative approach using CI-Nets

Scalable modeling and analysis of requirements preferences: ...

引用

IEEE International Conference on Requirements Engineering

作者： Zachary J. Oster Ganesh Ram Santhanam Samik Basu Department of Computer Science University of Wisconsin-Whitewater Whitewater WI Formal Methods and Verification Group Iowa State University Ames IA

We present a framework for reasoning with preferences in the context of Goal-Oriented Requirements Engineering (GORE). Our choice of preference language, conditional importance networks (CI-nets), is motivated by the occurrence in requirements engineering of qualitative preferences and tradeoffs involving sets of items; such preferences are expressed more naturally in CI-nets than in other representations. Building on our past experience with CI-nets, we are improving the scalability and usability of CI-nets for specifying and analyzing requirements preferences. We discuss our ongoing work and long-term plans, including efforts to develop more efficient methods to identify conflicting preferences among possible requirements, guide negotiation of resolutions to such conflicts, and improve traceability and comprehension of requirements preferences.

关键词： Stakeholders Analytical models Cognition Security Algorithm design and analysis Requirements engineering Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：